/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/linear_sea.ch.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:01:46,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:01:46,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:01:46,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:01:46,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:01:46,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:01:46,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:01:46,762 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:01:46,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:01:46,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:01:46,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:01:46,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:01:46,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:01:46,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:01:46,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:01:46,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:01:46,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:01:46,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:01:46,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:01:46,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:01:46,782 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:01:46,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:01:46,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:01:46,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:01:46,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:01:46,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:01:46,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:01:46,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:01:46,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:01:46,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:01:46,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:01:46,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:01:46,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:01:46,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:01:46,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:01:46,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:01:46,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:01:46,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:01:46,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:01:46,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:01:46,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:01:46,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:01:46,798 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:01:46,808 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:01:46,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:01:46,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:01:46,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:01:46,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:01:46,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:01:46,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:01:46,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:01:46,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:01:46,811 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:01:46,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:01:46,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:01:46,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:01:46,811 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:01:46,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:01:46,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:46,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:01:46,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:01:46,811 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:01:46,812 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:01:46,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:01:46,812 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:01:46,812 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:01:47,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:01:47,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:01:47,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:01:47,044 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:01:47,044 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:01:47,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_sea.ch.c [2022-04-15 12:01:47,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b70a6d2f/f1b95bd64840421e811894371b454e39/FLAG3f21f8a6c [2022-04-15 12:01:47,406 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:01:47,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch.c [2022-04-15 12:01:47,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b70a6d2f/f1b95bd64840421e811894371b454e39/FLAG3f21f8a6c [2022-04-15 12:01:47,425 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b70a6d2f/f1b95bd64840421e811894371b454e39 [2022-04-15 12:01:47,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:01:47,428 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:01:47,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:47,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:01:47,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:01:47,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:47" (1/1) ... [2022-04-15 12:01:47,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53bc7174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:47, skipping insertion in model container [2022-04-15 12:01:47,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:47" (1/1) ... [2022-04-15 12:01:47,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:01:47,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:01:47,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch.c[383,396] [2022-04-15 12:01:47,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:47,647 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:01:47,655 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch.c[383,396] [2022-04-15 12:01:47,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:47,679 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:01:47,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:47 WrapperNode [2022-04-15 12:01:47,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:47,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:01:47,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:01:47,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:01:47,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:47" (1/1) ... [2022-04-15 12:01:47,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:47" (1/1) ... [2022-04-15 12:01:47,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:47" (1/1) ... [2022-04-15 12:01:47,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:47" (1/1) ... [2022-04-15 12:01:47,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:47" (1/1) ... [2022-04-15 12:01:47,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:47" (1/1) ... [2022-04-15 12:01:47,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:47" (1/1) ... [2022-04-15 12:01:47,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:01:47,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:01:47,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:01:47,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:01:47,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:47" (1/1) ... [2022-04-15 12:01:47,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:47,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:47,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:01:47,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:01:47,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:01:47,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:01:47,762 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:01:47,762 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:01:47,762 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-04-15 12:01:47,762 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:01:47,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 12:01:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:01:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:01:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:01:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:01:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 12:01:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:01:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:01:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-04-15 12:01:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:01:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:01:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 12:01:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 12:01:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:01:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:01:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:01:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:01:47,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:01:47,820 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:01:47,822 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:01:47,990 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:01:47,994 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:01:47,994 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:01:47,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:47 BoogieIcfgContainer [2022-04-15 12:01:47,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:01:47,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:01:47,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:01:48,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:01:48,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:01:47" (1/3) ... [2022-04-15 12:01:48,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32536ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:48, skipping insertion in model container [2022-04-15 12:01:48,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:47" (2/3) ... [2022-04-15 12:01:48,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32536ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:48, skipping insertion in model container [2022-04-15 12:01:48,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:47" (3/3) ... [2022-04-15 12:01:48,004 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.c [2022-04-15 12:01:48,007 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:01:48,008 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:01:48,033 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:01:48,037 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:01:48,037 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:01:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:01:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:01:48,052 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:48,052 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:48,052 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:48,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:48,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1307815669, now seen corresponding path program 1 times [2022-04-15 12:01:48,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:48,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1769864973] [2022-04-15 12:01:48,068 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:48,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1307815669, now seen corresponding path program 2 times [2022-04-15 12:01:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:48,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56509213] [2022-04-15 12:01:48,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:48,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:48,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:48,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {36#true} is VALID [2022-04-15 12:01:48,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 12:01:48,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #66#return; {36#true} is VALID [2022-04-15 12:01:48,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 12:01:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:48,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {36#true} is VALID [2022-04-15 12:01:48,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 12:01:48,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #60#return; {36#true} is VALID [2022-04-15 12:01:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 12:01:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:48,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {36#true} is VALID [2022-04-15 12:01:48,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume !true; {37#false} is VALID [2022-04-15 12:01:48,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {37#false} is VALID [2022-04-15 12:01:48,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 12:01:48,333 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37#false} {36#true} #62#return; {37#false} is VALID [2022-04-15 12:01:48,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:48,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {36#true} is VALID [2022-04-15 12:01:48,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 12:01:48,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #66#return; {36#true} is VALID [2022-04-15 12:01:48,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret10 := main(); {36#true} is VALID [2022-04-15 12:01:48,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 8 then 1 + #t~nondet7 % 4294967296 / 8 else #t~nondet7 % 4294967296 / 8);havoc #t~nondet7; {36#true} is VALID [2022-04-15 12:01:48,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * (~SIZE~0 % 4294967296)); {36#true} is VALID [2022-04-15 12:01:48,338 INFO L272 TraceCheckUtils]: 7: Hoare triple {36#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0 % 4294967296, 4, 4 * (~SIZE~0 % 4294967296)); {50#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 12:01:48,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {50#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {36#true} is VALID [2022-04-15 12:01:48,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 12:01:48,338 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#true} {36#true} #60#return; {36#true} is VALID [2022-04-15 12:01:48,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#true} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * ((if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296), 4); {36#true} is VALID [2022-04-15 12:01:48,339 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#true} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {36#true} is VALID [2022-04-15 12:01:48,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {36#true} is VALID [2022-04-15 12:01:48,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#true} assume !true; {37#false} is VALID [2022-04-15 12:01:48,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {37#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {37#false} is VALID [2022-04-15 12:01:48,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 12:01:48,341 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {37#false} {36#true} #62#return; {37#false} is VALID [2022-04-15 12:01:48,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {37#false} is VALID [2022-04-15 12:01:48,341 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert(#t~ret9); {37#false} is VALID [2022-04-15 12:01:48,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-15 12:01:48,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-15 12:01:48,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-15 12:01:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:48,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:48,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56509213] [2022-04-15 12:01:48,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56509213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:48,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:48,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:48,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:48,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1769864973] [2022-04-15 12:01:48,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1769864973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:48,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:48,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:48,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350858837] [2022-04-15 12:01:48,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:48,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 12:01:48,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:48,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 12:01:48,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:48,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:01:48,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:48,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:01:48,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:01:48,407 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 12:01:48,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:48,577 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-15 12:01:48,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:01:48,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 12:01:48,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 12:01:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-15 12:01:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 12:01:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-15 12:01:48,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-04-15 12:01:48,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:48,655 INFO L225 Difference]: With dead ends: 51 [2022-04-15 12:01:48,655 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:01:48,657 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:01:48,660 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:48,661 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 37 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:01:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 12:01:48,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:48,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:48,701 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:48,702 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:48,708 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 12:01:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:01:48,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:48,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:48,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 12:01:48,709 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 12:01:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:48,712 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 12:01:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:01:48,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:48,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:48,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:48,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-15 12:01:48,716 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2022-04-15 12:01:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:48,717 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-15 12:01:48,717 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 12:01:48,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-15 12:01:48,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:01:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:01:48,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:48,748 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:48,748 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:01:48,750 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:48,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:48,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1795654780, now seen corresponding path program 1 times [2022-04-15 12:01:48,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:48,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1331100160] [2022-04-15 12:01:48,754 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:48,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1795654780, now seen corresponding path program 2 times [2022-04-15 12:01:48,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:48,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84694453] [2022-04-15 12:01:48,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:48,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:48,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:48,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {280#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {262#true} is VALID [2022-04-15 12:01:48,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 12:01:48,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #66#return; {262#true} is VALID [2022-04-15 12:01:48,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 12:01:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:48,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {281#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {262#true} is VALID [2022-04-15 12:01:48,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 12:01:48,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #60#return; {262#true} is VALID [2022-04-15 12:01:48,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 12:01:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:48,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {262#true} is VALID [2022-04-15 12:01:48,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {262#true} is VALID [2022-04-15 12:01:48,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {262#true} is VALID [2022-04-15 12:01:48,971 INFO L290 TraceCheckUtils]: 3: Hoare triple {262#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {262#true} is VALID [2022-04-15 12:01:48,971 INFO L290 TraceCheckUtils]: 4: Hoare triple {262#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-15 12:01:48,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-15 12:01:48,973 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {262#true} #62#return; {277#(= |main_#t~ret9| 1)} is VALID [2022-04-15 12:01:48,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {280#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:48,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {280#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {262#true} is VALID [2022-04-15 12:01:48,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 12:01:48,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #66#return; {262#true} is VALID [2022-04-15 12:01:48,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret10 := main(); {262#true} is VALID [2022-04-15 12:01:48,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 8 then 1 + #t~nondet7 % 4294967296 / 8 else #t~nondet7 % 4294967296 / 8);havoc #t~nondet7; {262#true} is VALID [2022-04-15 12:01:48,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * (~SIZE~0 % 4294967296)); {262#true} is VALID [2022-04-15 12:01:48,975 INFO L272 TraceCheckUtils]: 7: Hoare triple {262#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0 % 4294967296, 4, 4 * (~SIZE~0 % 4294967296)); {281#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 12:01:48,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {281#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {262#true} is VALID [2022-04-15 12:01:48,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 12:01:48,976 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {262#true} {262#true} #60#return; {262#true} is VALID [2022-04-15 12:01:48,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#true} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * ((if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296), 4); {262#true} is VALID [2022-04-15 12:01:48,976 INFO L272 TraceCheckUtils]: 12: Hoare triple {262#true} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {262#true} is VALID [2022-04-15 12:01:48,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {262#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {262#true} is VALID [2022-04-15 12:01:48,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {262#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {262#true} is VALID [2022-04-15 12:01:48,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {262#true} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {262#true} is VALID [2022-04-15 12:01:48,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {262#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {262#true} is VALID [2022-04-15 12:01:48,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {262#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-15 12:01:48,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-15 12:01:48,979 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {262#true} #62#return; {277#(= |main_#t~ret9| 1)} is VALID [2022-04-15 12:01:48,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {277#(= |main_#t~ret9| 1)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {277#(= |main_#t~ret9| 1)} is VALID [2022-04-15 12:01:48,980 INFO L272 TraceCheckUtils]: 21: Hoare triple {277#(= |main_#t~ret9| 1)} call __VERIFIER_assert(#t~ret9); {278#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-15 12:01:48,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {278#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {279#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-15 12:01:48,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {279#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {263#false} is VALID [2022-04-15 12:01:48,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-15 12:01:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:48,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:48,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84694453] [2022-04-15 12:01:48,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84694453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:48,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:48,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:01:48,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:48,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1331100160] [2022-04-15 12:01:48,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1331100160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:48,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:48,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:01:48,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637415586] [2022-04-15 12:01:48,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:48,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-04-15 12:01:48,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:48,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 12:01:49,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:49,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:01:49,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:49,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:01:49,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:01:49,005 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 12:01:49,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:49,303 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-15 12:01:49,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:01:49,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-04-15 12:01:49,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 12:01:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-15 12:01:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 12:01:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-15 12:01:49,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-15 12:01:49,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:49,337 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:01:49,337 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:01:49,337 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:01:49,338 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:49,338 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 45 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:01:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:01:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 12:01:49,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:49,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:49,342 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:49,342 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:49,343 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-15 12:01:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-15 12:01:49,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:49,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:49,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 12:01:49,344 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 12:01:49,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:49,345 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-15 12:01:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-15 12:01:49,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:49,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:49,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:49,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:49,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:49,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-15 12:01:49,346 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 25 [2022-04-15 12:01:49,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:49,347 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-15 12:01:49,347 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 12:01:49,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2022-04-15 12:01:49,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-15 12:01:49,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:01:49,369 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:49,369 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:49,369 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:01:49,370 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:49,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:49,370 INFO L85 PathProgramCache]: Analyzing trace with hash -52844445, now seen corresponding path program 1 times [2022-04-15 12:01:49,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:49,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1113480575] [2022-04-15 12:01:49,370 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:49,370 INFO L85 PathProgramCache]: Analyzing trace with hash -52844445, now seen corresponding path program 2 times [2022-04-15 12:01:49,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:49,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069893978] [2022-04-15 12:01:49,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:49,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:49,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:49,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {483#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {484#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:49,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} assume true; {484#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:49,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {484#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} {466#true} #66#return; {471#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:49,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 12:01:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:49,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {485#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {466#true} is VALID [2022-04-15 12:01:49,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-15 12:01:49,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {472#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} #60#return; {472#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:01:49,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 12:01:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:49,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {466#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {486#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:49,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {486#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {487#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-15 12:01:49,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {486#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:49,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {486#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {486#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:49,543 INFO L290 TraceCheckUtils]: 4: Hoare triple {486#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {488#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-15 12:01:49,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {488#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {488#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-15 12:01:49,544 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {488#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {472#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} #62#return; {467#false} is VALID [2022-04-15 12:01:49,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {483#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:49,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {484#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:49,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} assume true; {484#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:49,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {484#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} {466#true} #66#return; {471#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:49,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} call #t~ret10 := main(); {471#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:49,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 8 then 1 + #t~nondet7 % 4294967296 / 8 else #t~nondet7 % 4294967296 / 8);havoc #t~nondet7; {471#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:49,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * (~SIZE~0 % 4294967296)); {472#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:01:49,549 INFO L272 TraceCheckUtils]: 7: Hoare triple {472#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0 % 4294967296, 4, 4 * (~SIZE~0 % 4294967296)); {485#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 12:01:49,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {485#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {466#true} is VALID [2022-04-15 12:01:49,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-15 12:01:49,550 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {466#true} {472#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} #60#return; {472#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:01:49,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {472#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * ((if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296), 4); {472#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:01:49,551 INFO L272 TraceCheckUtils]: 12: Hoare triple {472#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {466#true} is VALID [2022-04-15 12:01:49,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {466#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {486#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:49,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {486#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {487#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-15 12:01:49,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {487#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {486#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:49,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {486#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {486#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:01:49,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {486#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {488#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-15 12:01:49,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {488#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {488#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-15 12:01:49,555 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {488#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {472#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} #62#return; {467#false} is VALID [2022-04-15 12:01:49,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {467#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {467#false} is VALID [2022-04-15 12:01:49,555 INFO L272 TraceCheckUtils]: 21: Hoare triple {467#false} call __VERIFIER_assert(#t~ret9); {467#false} is VALID [2022-04-15 12:01:49,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {467#false} ~cond := #in~cond; {467#false} is VALID [2022-04-15 12:01:49,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {467#false} assume 0 == ~cond; {467#false} is VALID [2022-04-15 12:01:49,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-04-15 12:01:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:49,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:49,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069893978] [2022-04-15 12:01:49,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069893978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:49,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:49,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:01:49,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:49,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1113480575] [2022-04-15 12:01:49,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1113480575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:49,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:49,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:01:49,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837782682] [2022-04-15 12:01:49,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:49,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 12:01:49,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:49,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 12:01:49,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:49,576 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:01:49,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:49,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:01:49,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:01:49,577 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 12:01:51,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 12:01:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:52,367 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 12:01:52,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:01:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 12:01:52,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 12:01:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2022-04-15 12:01:52,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 12:01:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2022-04-15 12:01:52,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 42 transitions. [2022-04-15 12:01:52,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:52,416 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:01:52,416 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:01:52,416 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:01:52,417 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 64 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:52,417 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 37 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 98 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 12:01:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:01:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-15 12:01:52,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:52,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:52,462 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:52,462 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:52,463 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-15 12:01:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-15 12:01:52,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:52,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:52,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-15 12:01:52,464 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-15 12:01:52,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:52,465 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-15 12:01:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-15 12:01:52,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:52,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:52,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:52,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-15 12:01:52,467 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-04-15 12:01:52,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:52,467 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-15 12:01:52,467 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 12:01:52,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-15 12:01:52,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:01:52,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 12:01:52,505 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:52,505 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:52,506 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:01:52,506 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:52,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:52,506 INFO L85 PathProgramCache]: Analyzing trace with hash -238208460, now seen corresponding path program 1 times [2022-04-15 12:01:52,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:52,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2017145854] [2022-04-15 12:01:52,513 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:52,513 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:52,513 INFO L85 PathProgramCache]: Analyzing trace with hash -238208460, now seen corresponding path program 2 times [2022-04-15 12:01:52,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:52,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840432955] [2022-04-15 12:01:52,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:52,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:52,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:52,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {732#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {733#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:52,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} assume true; {733#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:52,614 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {733#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} {712#true} #66#return; {717#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 12:01:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:52,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {734#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {712#true} is VALID [2022-04-15 12:01:52,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-15 12:01:52,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {712#true} {718#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} #60#return; {718#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:01:52,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 12:01:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:52,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {712#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {735#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 12:01:52,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {735#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {736#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-15 12:01:52,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {736#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {736#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-15 12:01:52,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {736#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} assume !!#t~short5;havoc #t~mem4;havoc #t~short5;#t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {737#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} is VALID [2022-04-15 12:01:52,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {737#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {738#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} is VALID [2022-04-15 12:01:52,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {739#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-15 12:01:52,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {739#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {739#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-15 12:01:52,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {740#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:01:52,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {740#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} assume true; {740#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:01:52,781 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {740#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {718#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} #62#return; {713#false} is VALID [2022-04-15 12:01:52,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {732#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:52,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {732#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {733#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:52,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} assume true; {733#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:52,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} {712#true} #66#return; {717#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:52,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {717#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} call #t~ret10 := main(); {717#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:52,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {717#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 8 then 1 + #t~nondet7 % 4294967296 / 8 else #t~nondet7 % 4294967296 / 8);havoc #t~nondet7; {717#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-15 12:01:52,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {717#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * (~SIZE~0 % 4294967296)); {718#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:01:52,787 INFO L272 TraceCheckUtils]: 7: Hoare triple {718#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0 % 4294967296, 4, 4 * (~SIZE~0 % 4294967296)); {734#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 12:01:52,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {734#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {712#true} is VALID [2022-04-15 12:01:52,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-15 12:01:52,788 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {712#true} {718#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} #60#return; {718#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:01:52,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {718#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * ((if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296), 4); {718#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 12:01:52,788 INFO L272 TraceCheckUtils]: 12: Hoare triple {718#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {712#true} is VALID [2022-04-15 12:01:52,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {735#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 12:01:52,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {735#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {736#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-15 12:01:52,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {736#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {736#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-15 12:01:52,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {736#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} assume !!#t~short5;havoc #t~mem4;havoc #t~short5;#t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {737#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} is VALID [2022-04-15 12:01:52,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {737#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {738#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} is VALID [2022-04-15 12:01:52,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {738#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {739#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-15 12:01:52,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {739#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {739#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-15 12:01:52,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {739#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {740#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:01:52,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {740#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} assume true; {740#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:01:52,795 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {740#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {718#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} #62#return; {713#false} is VALID [2022-04-15 12:01:52,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {713#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {713#false} is VALID [2022-04-15 12:01:52,795 INFO L272 TraceCheckUtils]: 24: Hoare triple {713#false} call __VERIFIER_assert(#t~ret9); {713#false} is VALID [2022-04-15 12:01:52,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {713#false} ~cond := #in~cond; {713#false} is VALID [2022-04-15 12:01:52,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {713#false} assume 0 == ~cond; {713#false} is VALID [2022-04-15 12:01:52,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {713#false} assume !false; {713#false} is VALID [2022-04-15 12:01:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:52,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:52,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840432955] [2022-04-15 12:01:52,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840432955] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:52,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951087586] [2022-04-15 12:01:52,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:52,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:52,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:52,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:52,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process