/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-lit/jm2006_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:14:44,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:14:44,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:14:44,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:14:44,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:14:44,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:14:44,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:14:44,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:14:44,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:14:44,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:14:44,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:14:44,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:14:44,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:14:44,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:14:44,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:14:44,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:14:44,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:14:44,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:14:44,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:14:44,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:14:44,672 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:14:44,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:14:44,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:14:44,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:14:44,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:14:44,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:14:44,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:14:44,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:14:44,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:14:44,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:14:44,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:14:44,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:14:44,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:14:44,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:14:44,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:14:44,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:14:44,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:14:44,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:14:44,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:14:44,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:14:44,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:14:44,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:14:44,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:14:44,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:14:44,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:14:44,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:14:44,689 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:14:44,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:14:44,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:14:44,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:14:44,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:14:44,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:14:44,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:14:44,690 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:14:44,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:14:44,690 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:14:44,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:14:44,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:14:44,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:14:44,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:14:44,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:14:44,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:14:44,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:14:44,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:14:44,691 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:14:44,691 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:14:44,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:14:44,692 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:14:44,692 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 06:14:44,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:14:44,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:14:44,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:14:44,928 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:14:44,928 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:14:44,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006_variant.i [2022-04-15 06:14:44,986 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1328413/4da3bdce77a04dc38ec118e6a8c2dfdd/FLAG9d43d1ea2 [2022-04-15 06:14:45,336 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:14:45,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i [2022-04-15 06:14:45,340 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1328413/4da3bdce77a04dc38ec118e6a8c2dfdd/FLAG9d43d1ea2 [2022-04-15 06:14:45,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1328413/4da3bdce77a04dc38ec118e6a8c2dfdd [2022-04-15 06:14:45,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:14:45,812 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:14:45,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:14:45,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:14:45,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:14:45,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:14:45" (1/1) ... [2022-04-15 06:14:45,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24dc15c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:45, skipping insertion in model container [2022-04-15 06:14:45,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:14:45" (1/1) ... [2022-04-15 06:14:45,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:14:45,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:14:46,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i[895,908] [2022-04-15 06:14:46,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:14:46,127 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:14:46,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i[895,908] [2022-04-15 06:14:46,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:14:46,168 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:14:46,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:46 WrapperNode [2022-04-15 06:14:46,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:14:46,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:14:46,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:14:46,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:14:46,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:46" (1/1) ... [2022-04-15 06:14:46,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:46" (1/1) ... [2022-04-15 06:14:46,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:46" (1/1) ... [2022-04-15 06:14:46,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:46" (1/1) ... [2022-04-15 06:14:46,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:46" (1/1) ... [2022-04-15 06:14:46,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:46" (1/1) ... [2022-04-15 06:14:46,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:46" (1/1) ... [2022-04-15 06:14:46,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:14:46,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:14:46,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:14:46,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:14:46,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:46" (1/1) ... [2022-04-15 06:14:46,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:14:46,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:14:46,294 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 06:14:46,296 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 06:14:46,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:14:46,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:14:46,330 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:14:46,330 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:14:46,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:14:46,330 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:14:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:14:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:14:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 06:14:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 06:14:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:14:46,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:14:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:14:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:14:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:14:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:14:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:14:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:14:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:14:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:14:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:14:46,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:14:46,381 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:14:46,382 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:14:46,477 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:14:46,481 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:14:46,482 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:14:46,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:14:46 BoogieIcfgContainer [2022-04-15 06:14:46,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:14:46,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:14:46,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:14:46,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:14:46,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:14:45" (1/3) ... [2022-04-15 06:14:46,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1081c9a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:14:46, skipping insertion in model container [2022-04-15 06:14:46,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:14:46" (2/3) ... [2022-04-15 06:14:46,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1081c9a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:14:46, skipping insertion in model container [2022-04-15 06:14:46,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:14:46" (3/3) ... [2022-04-15 06:14:46,489 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006_variant.i [2022-04-15 06:14:46,492 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:14:46,492 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:14:46,521 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:14:46,558 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 06:14:46,558 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:14:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:14:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:14:46,608 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:46,609 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:46,609 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:46,613 INFO L85 PathProgramCache]: Analyzing trace with hash -522767122, now seen corresponding path program 1 times [2022-04-15 06:14:46,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:46,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [695926616] [2022-04-15 06:14:46,633 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:14:46,634 INFO L85 PathProgramCache]: Analyzing trace with hash -522767122, now seen corresponding path program 2 times [2022-04-15 06:14:46,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:46,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258859421] [2022-04-15 06:14:46,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:46,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:46,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:46,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#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(9, 2); {25#true} is VALID [2022-04-15 06:14:46,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 06:14:46,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #64#return; {25#true} is VALID [2022-04-15 06:14:46,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:46,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#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(9, 2); {25#true} is VALID [2022-04-15 06:14:46,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 06:14:46,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #64#return; {25#true} is VALID [2022-04-15 06:14:46,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-15 06:14:46,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {25#true} is VALID [2022-04-15 06:14:46,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {25#true} is VALID [2022-04-15 06:14:46,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {25#true} is VALID [2022-04-15 06:14:46,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-15 06:14:46,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume ~i~0 == ~j~0; {26#false} is VALID [2022-04-15 06:14:46,776 INFO L272 TraceCheckUtils]: 10: Hoare triple {26#false} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {26#false} is VALID [2022-04-15 06:14:46,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-15 06:14:46,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-15 06:14:46,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 06:14:46,777 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 06:14:46,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:46,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258859421] [2022-04-15 06:14:46,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258859421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:46,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:46,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:14:46,780 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:46,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [695926616] [2022-04-15 06:14:46,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [695926616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:46,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:46,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:14:46,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723855968] [2022-04-15 06:14:46,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:46,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:14:46,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:46,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:46,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:46,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:14:46,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:46,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:14:46,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:14:46,818 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:46,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:46,909 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-15 06:14:46,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:14:46,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:14:46,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:46,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 06:14:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 06:14:46,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-15 06:14:47,005 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 06:14:47,013 INFO L225 Difference]: With dead ends: 35 [2022-04-15 06:14:47,013 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 06:14:47,016 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:14:47,021 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:47,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:14:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 06:14:47,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 06:14:47,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:47,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:47,052 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:47,053 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:47,058 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 06:14:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 06:14:47,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:47,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:47,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 06:14:47,060 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 06:14:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:47,063 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 06:14:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 06:14:47,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:47,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:47,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:47,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 06:14:47,075 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 14 [2022-04-15 06:14:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:47,076 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 06:14:47,076 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:47,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 06:14:47,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:47,096 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 06:14:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:14:47,097 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:47,097 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:47,097 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:14:47,098 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:47,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash -637283726, now seen corresponding path program 1 times [2022-04-15 06:14:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:47,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1082306556] [2022-04-15 06:14:47,103 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:14:47,103 INFO L85 PathProgramCache]: Analyzing trace with hash -637283726, now seen corresponding path program 2 times [2022-04-15 06:14:47,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:47,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799823121] [2022-04-15 06:14:47,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:47,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:47,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#(and (= |#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(9, 2); {163#true} is VALID [2022-04-15 06:14:47,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-15 06:14:47,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163#true} {163#true} #64#return; {163#true} is VALID [2022-04-15 06:14:47,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {163#true} call ULTIMATE.init(); {173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:47,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#(and (= |#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(9, 2); {163#true} is VALID [2022-04-15 06:14:47,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} assume true; {163#true} is VALID [2022-04-15 06:14:47,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} #64#return; {163#true} is VALID [2022-04-15 06:14:47,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} call #t~ret5 := main(); {163#true} is VALID [2022-04-15 06:14:47,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {163#true} is VALID [2022-04-15 06:14:47,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {163#true} is VALID [2022-04-15 06:14:47,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {168#(and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~i~0 0))))} is VALID [2022-04-15 06:14:47,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {168#(and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~i~0 0))))} assume !(0 != ~x~0); {169#(and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (= main_~i~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-15 06:14:47,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#(and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (= main_~i~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} assume ~i~0 == ~j~0; {170#(and (= main_~z~0 0) (<= main_~y~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-15 06:14:47,374 INFO L272 TraceCheckUtils]: 10: Hoare triple {170#(and (= main_~z~0 0) (<= main_~y~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {171#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:14:47,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {171#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {172#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:14:47,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {172#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {164#false} is VALID [2022-04-15 06:14:47,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-04-15 06:14:47,376 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 06:14:47,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:47,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799823121] [2022-04-15 06:14:47,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799823121] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:47,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:47,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:14:47,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:47,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1082306556] [2022-04-15 06:14:47,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1082306556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:47,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:47,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:14:47,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544594322] [2022-04-15 06:14:47,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:47,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:14:47,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:47,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:47,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:47,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:14:47,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:47,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:14:47,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:14:47,391 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:47,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:47,588 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 06:14:47,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:14:47,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:14:47,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 06:14:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 06:14:47,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-15 06:14:47,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:47,610 INFO L225 Difference]: With dead ends: 22 [2022-04-15 06:14:47,610 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 06:14:47,611 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:14:47,612 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:47,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:14:47,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 06:14:47,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 06:14:47,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:47,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:47,618 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:47,618 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:47,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:47,619 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 06:14:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 06:14:47,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:47,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:47,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 06:14:47,620 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 06:14:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:47,621 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 06:14:47,621 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 06:14:47,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:47,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:47,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:47,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 06:14:47,623 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-15 06:14:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:47,623 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 06:14:47,623 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:47,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-15 06:14:47,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 06:14:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:14:47,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:14:47,637 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:14:47,637 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:14:47,637 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:14:47,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:14:47,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1050868340, now seen corresponding path program 1 times [2022-04-15 06:14:47,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:47,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [942867322] [2022-04-15 06:14:47,790 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=2, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:14:47,792 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:14:47,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1893771691, now seen corresponding path program 1 times [2022-04-15 06:14:47,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:14:47,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683302450] [2022-04-15 06:14:47,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:14:47,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:14:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:47,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:14:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:14:47,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {305#(and (= |#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(9, 2); {294#true} is VALID [2022-04-15 06:14:47,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-15 06:14:47,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {294#true} {294#true} #64#return; {294#true} is VALID [2022-04-15 06:14:47,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:14:47,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#(and (= |#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(9, 2); {294#true} is VALID [2022-04-15 06:14:47,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-15 06:14:47,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #64#return; {294#true} is VALID [2022-04-15 06:14:47,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret5 := main(); {294#true} is VALID [2022-04-15 06:14:47,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} havoc ~i~0;havoc ~j~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~j~0 := #t~nondet2;havoc #t~nondet2; {294#true} is VALID [2022-04-15 06:14:47,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#true} assume !!(~i~0 >= 0 && ~i~0 <= 1000000); {294#true} is VALID [2022-04-15 06:14:47,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#true} assume !!(~j~0 >= 0);~x~0 := ~i~0;~y~0 := ~j~0;~z~0 := 0; {299#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= (+ main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= 0 main_~y~0) (not (<= main_~x~0 0))))} is VALID [2022-04-15 06:14:47,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {299#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= (+ main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= 0 main_~y~0) (not (<= main_~x~0 0))))} [68] L33-2-->L33-3_primed: Formula: (let ((.cse1 (= v_main_~z~0_7 v_main_~z~0_6)) (.cse2 (= |v_main_#t~post3_4| |v_main_#t~post3_3|)) (.cse3 (= v_main_~y~0_7 v_main_~y~0_6)) (.cse0 (= v_main_~x~0_6 0)) (.cse4 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and (or (not (<= 1 v_main_~x~0_6)) (not (<= (+ v_main_~x~0_6 v_main_~z~0_7 1) v_main_~z~0_6))) (not .cse0) (= (+ (* (- 1) v_main_~z~0_6) v_main_~x~0_6 v_main_~z~0_7) v_main_~x~0_5) (= v_main_~y~0_6 (+ (* (- 2) v_main_~z~0_6) v_main_~y~0_7 (* v_main_~z~0_7 2))) (< v_main_~z~0_7 v_main_~z~0_6)) (and .cse1 .cse2 .cse3 (= v_main_~x~0_6 v_main_~x~0_5) .cse4) (and .cse1 .cse2 .cse3 .cse0 (= v_main_~x~0_5 v_main_~x~0_6) .cse4))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_~y~0=v_main_~y~0_7, main_#t~post3=|v_main_#t~post3_4|, main_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_7} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_6, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {300#(or (<= 1 main_~x~0) (and (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0) (< 0 (+ main_~z~0 main_~y~0 1))) (and (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 0)))} is VALID [2022-04-15 06:14:47,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {300#(or (<= 1 main_~x~0) (and (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0) (< 0 (+ main_~z~0 main_~y~0 1))) (and (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 0)))} [67] L33-3_primed-->L33-3: Formula: (= v_main_~x~0_4 0) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {301#(or (and (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 0)) (and (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0) (< 0 (+ main_~z~0 main_~y~0 1))))} is VALID [2022-04-15 06:14:47,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {301#(or (and (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 0)) (and (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0) (< 0 (+ main_~z~0 main_~y~0 1))))} assume ~i~0 == ~j~0; {302#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-15 06:14:47,994 INFO L272 TraceCheckUtils]: 11: Hoare triple {302#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} call __VERIFIER_assert((if ~y~0 == -~z~0 then 1 else 0)); {303#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:14:47,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {303#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {304#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:14:47,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {304#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {295#false} is VALID [2022-04-15 06:14:47,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-04-15 06:14:47,995 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 06:14:47,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:14:47,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683302450] [2022-04-15 06:14:47,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683302450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:47,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:47,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:14:48,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:14:48,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [942867322] [2022-04-15 06:14:48,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [942867322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:14:48,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:14:48,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:14:48,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548000574] [2022-04-15 06:14:48,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:14:48,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:14:48,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:14:48,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:48,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:48,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:14:48,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:14:48,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:14:48,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:14:48,163 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:48,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:48,279 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 06:14:48,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:14:48,280 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:14:48,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:14:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2022-04-15 06:14:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2022-04-15 06:14:48,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 16 transitions. [2022-04-15 06:14:48,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:48,301 INFO L225 Difference]: With dead ends: 16 [2022-04-15 06:14:48,301 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 06:14:48,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:14:48,302 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:14:48,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 36 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-04-15 06:14:48,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 06:14:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 06:14:48,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:14:48,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:14:48,304 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:14:48,304 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:14:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:48,304 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:14:48,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:14:48,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:48,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:48,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 06:14:48,304 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 06:14:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:14:48,304 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:14:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:14:48,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:48,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:14:48,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:14:48,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:14:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 06:14:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 06:14:48,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-04-15 06:14:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:14:48,305 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 06:14:48,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:14:48,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 06:14:48,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:14:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:14:48,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:14:48,308 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 06:14:48,308 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:14:48,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 06:14:48,406 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-15 06:14:48,406 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-15 06:14:48,406 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-15 06:14:48,406 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-15 06:14:48,406 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-15 06:14:48,406 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-15 06:14:48,406 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-15 06:14:48,407 INFO L878 garLoopResultBuilder]: At program point L33-2(lines 33 37) the Hoare annotation is: (exists ((v_main_~y~0_11 Int)) (and (let ((.cse0 (= main_~z~0 0)) (.cse1 (= main_~i~0 main_~x~0)) (.cse2 (= v_main_~y~0_11 main_~y~0)) (.cse3 (= main_~i~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1 .cse2) (and (< 0 main_~z~0) (= main_~i~0 (+ main_~z~0 main_~x~0)) (= v_main_~y~0_11 (+ main_~y~0 (* main_~z~0 2))) (not .cse3) (or (not (<= (+ main_~i~0 1) main_~z~0)) (not (<= 1 main_~i~0)))))) (<= main_~j~0 v_main_~y~0_11) (or (not (<= main_~i~0 0)) (<= 0 v_main_~y~0_11)) (<= v_main_~y~0_11 main_~j~0))) [2022-04-15 06:14:48,407 INFO L878 garLoopResultBuilder]: At program point L33-3(lines 24 42) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 main_~z~0 main_~y~0))) (or (and (<= main_~j~0 .cse0) (<= (+ main_~z~0 main_~y~0) 0)) (and (<= .cse0 main_~j~0) (< 0 (+ main_~z~0 main_~y~0 1))))) [2022-04-15 06:14:48,407 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-15 06:14:48,407 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 42) the Hoare annotation is: true [2022-04-15 06:14:48,407 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 42) the Hoare annotation is: true [2022-04-15 06:14:48,407 INFO L885 garLoopResultBuilder]: At program point L38(lines 38 40) the Hoare annotation is: true [2022-04-15 06:14:48,407 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 42) the Hoare annotation is: true [2022-04-15 06:14:48,407 INFO L885 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-15 06:14:48,407 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) [2022-04-15 06:14:48,407 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:14:48,407 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 06:14:48,407 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:14:48,408 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:14:48,408 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 06:14:48,408 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 06:14:48,408 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:14:48,408 INFO L885 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-15 06:14:48,408 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-15 06:14:48,408 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-15 06:14:48,408 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 06:14:48,408 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 06:14:48,408 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 06:14:48,410 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-15 06:14:48,411 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 06:14:48,414 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:14:48,414 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:14:48,414 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 06:14:48,415 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-15 06:14:48,415 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 06:14:48,415 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 06:14:48,415 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 06:14:48,426 INFO L163 areAnnotationChecker]: CFG has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 06:14:48,430 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,430 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,430 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,430 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,430 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,431 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 06:14:48 BoogieIcfgContainer [2022-04-15 06:14:48,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 06:14:48,436 INFO L158 Benchmark]: Toolchain (without parser) took 2623.91ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 126.4MB in the beginning and 93.4MB in the end (delta: 33.1MB). Peak memory consumption was 94.8MB. Max. memory is 8.0GB. [2022-04-15 06:14:48,436 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory was 142.6MB in the beginning and 142.5MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:14:48,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.69ms. Allocated memory is still 176.2MB. Free memory was 126.3MB in the beginning and 152.7MB in the end (delta: -26.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 06:14:48,436 INFO L158 Benchmark]: Boogie Preprocessor took 55.88ms. Allocated memory is still 176.2MB. Free memory was 152.7MB in the beginning and 151.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 06:14:48,436 INFO L158 Benchmark]: RCFGBuilder took 257.08ms. Allocated memory is still 176.2MB. Free memory was 151.3MB in the beginning and 140.1MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 06:14:48,437 INFO L158 Benchmark]: TraceAbstraction took 1951.05ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 139.7MB in the beginning and 93.4MB in the end (delta: 46.4MB). Peak memory consumption was 107.6MB. Max. memory is 8.0GB. [2022-04-15 06:14:48,437 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory was 142.6MB in the beginning and 142.5MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 344.69ms. Allocated memory is still 176.2MB. Free memory was 126.3MB in the beginning and 152.7MB in the end (delta: -26.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.88ms. Allocated memory is still 176.2MB. Free memory was 152.7MB in the beginning and 151.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 257.08ms. Allocated memory is still 176.2MB. Free memory was 151.3MB in the beginning and 140.1MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1951.05ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 139.7MB in the beginning and 93.4MB in the end (delta: 46.4MB). Peak memory consumption was 107.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 44 mSDtfsCounter, 79 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 34 PreInvPairs, 48 NumberOfFragments, 145 HoareAnnotationTreeSize, 34 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 177 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant [2022-04-15 06:14:48,441 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] [2022-04-15 06:14:48,442 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_11,QUANTIFIED] Derived loop invariant: (\exists v_main_~y~0_11 : int :: ((((((z == 0 && i == x) && v_main_~y~0_11 == y) || (((z == 0 && i == 0) && i == x) && v_main_~y~0_11 == y)) || ((((0 < z && i == z + x) && v_main_~y~0_11 == y + z * 2) && !(i == 0)) && (!(i + 1 <= z) || !(1 <= i)))) && j <= v_main_~y~0_11) && (!(i <= 0) || 0 <= v_main_~y~0_11)) && v_main_~y~0_11 <= j) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 06:14:48,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...