/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/loops/sum01_bug02_sum01_bug02_base.case.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:42:44,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:42:44,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:42:44,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:42:44,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:42:44,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:42:44,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:42:44,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:42:44,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:42:44,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:42:44,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:42:44,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:42:44,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:42:44,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:42:44,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:42:44,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:42:44,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:42:44,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:42:44,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:42:44,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:42:44,381 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:42:44,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:42:44,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:42:44,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:42:44,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:42:44,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:42:44,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:42:44,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:42:44,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:42:44,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:42:44,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:42:44,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:42:44,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:42:44,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:42:44,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:42:44,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:42:44,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:42:44,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:42:44,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:42:44,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:42:44,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:42:44,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:42:44,396 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 05:42:44,404 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:42:44,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:42:44,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:42:44,405 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:42:44,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:42:44,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:42:44,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:42:44,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:42:44,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:42:44,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:42:44,407 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:42:44,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:42:44,407 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:42:44,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:42:44,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:42:44,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:42:44,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:42:44,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:42:44,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:42:44,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:42:44,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:42:44,408 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:42:44,408 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:42:44,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:42:44,408 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:42:44,408 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 05:42:44,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:42:44,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:42:44,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:42:44,586 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:42:44,587 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:42:44,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2022-04-15 05:42:44,635 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3cb234a1/a0177b9e92cf4d5faf97e550c2b3c888/FLAG1d6cbec7d [2022-04-15 05:42:44,937 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:42:44,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2022-04-15 05:42:44,942 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3cb234a1/a0177b9e92cf4d5faf97e550c2b3c888/FLAG1d6cbec7d [2022-04-15 05:42:45,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3cb234a1/a0177b9e92cf4d5faf97e550c2b3c888 [2022-04-15 05:42:45,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:42:45,373 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:42:45,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:42:45,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:42:45,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:42:45,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:42:45" (1/1) ... [2022-04-15 05:42:45,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a1d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:45, skipping insertion in model container [2022-04-15 05:42:45,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:42:45" (1/1) ... [2022-04-15 05:42:45,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:42:45,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:42:45,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i[834,847] [2022-04-15 05:42:45,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:42:45,582 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:42:45,591 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i[834,847] [2022-04-15 05:42:45,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:42:45,618 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:42:45,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:45 WrapperNode [2022-04-15 05:42:45,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:42:45,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:42:45,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:42:45,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:42:45,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:45" (1/1) ... [2022-04-15 05:42:45,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:45" (1/1) ... [2022-04-15 05:42:45,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:45" (1/1) ... [2022-04-15 05:42:45,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:45" (1/1) ... [2022-04-15 05:42:45,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:45" (1/1) ... [2022-04-15 05:42:45,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:45" (1/1) ... [2022-04-15 05:42:45,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:45" (1/1) ... [2022-04-15 05:42:45,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:42:45,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:42:45,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:42:45,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:42:45,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:45" (1/1) ... [2022-04-15 05:42:45,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:42:45,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:45,735 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 05:42:45,752 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 05:42:45,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:42:45,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:42:45,767 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:42:45,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:42:45,767 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:42:45,767 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:42:45,768 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:42:45,768 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 05:42:45,768 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 05:42:45,768 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:42:45,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:42:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:42:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 05:42:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:42:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:42:45,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:42:45,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:42:45,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:42:45,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:42:45,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:42:45,817 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:42:45,818 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:42:45,952 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:42:45,970 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:42:45,970 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 05:42:45,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:42:45 BoogieIcfgContainer [2022-04-15 05:42:45,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:42:45,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:42:45,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:42:45,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:42:45,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:42:45" (1/3) ... [2022-04-15 05:42:45,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b22f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:42:45, skipping insertion in model container [2022-04-15 05:42:45,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:45" (2/3) ... [2022-04-15 05:42:45,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b22f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:42:45, skipping insertion in model container [2022-04-15 05:42:45,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:42:45" (3/3) ... [2022-04-15 05:42:45,977 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case.i [2022-04-15 05:42:45,979 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:42:45,980 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:42:46,041 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:42:46,060 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 05:42:46,060 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:42:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 05:42:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 05:42:46,092 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:46,092 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:46,093 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:46,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:46,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 1 times [2022-04-15 05:42:46,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:46,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [850131735] [2022-04-15 05:42:46,110 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:42:46,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 2 times [2022-04-15 05:42:46,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:46,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352445463] [2022-04-15 05:42:46,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:46,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:46,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:46,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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(36, 2); {23#true} is VALID [2022-04-15 05:42:46,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 05:42:46,276 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-15 05:42:46,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:46,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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(36, 2); {23#true} is VALID [2022-04-15 05:42:46,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 05:42:46,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-15 05:42:46,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-15 05:42:46,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {23#true} is VALID [2022-04-15 05:42:46,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-15 05:42:46,279 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {24#false} is VALID [2022-04-15 05:42:46,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-15 05:42:46,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-15 05:42:46,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 05:42:46,280 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 05:42:46,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:46,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352445463] [2022-04-15 05:42:46,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352445463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:46,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:46,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:42:46,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:46,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [850131735] [2022-04-15 05:42:46,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [850131735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:46,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:46,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:42:46,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826754652] [2022-04-15 05:42:46,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:46,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 05:42:46,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:46,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 05:42:46,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:46,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:42:46,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:46,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:42:46,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:42:46,332 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 05:42:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:46,398 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 05:42:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:42:46,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 05:42:46,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 05:42:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 05:42:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 05:42:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 05:42:46,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-15 05:42:46,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:46,441 INFO L225 Difference]: With dead ends: 31 [2022-04-15 05:42:46,442 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 05:42:46,443 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 05:42:46,446 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 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 05:42:46,446 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:42:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 05:42:46,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 05:42:46,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:46,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 05:42:46,464 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 05:42:46,464 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 05:42:46,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:46,466 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 05:42:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 05:42:46,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:46,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:46,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 14 states. [2022-04-15 05:42:46,467 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 14 states. [2022-04-15 05:42:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:46,468 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 05:42:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 05:42:46,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:46,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:46,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:46,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 05:42:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 05:42:46,471 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 05:42:46,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:46,471 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 05:42:46,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 05:42:46,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-15 05:42:46,485 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 05:42:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 05:42:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 05:42:46,485 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:46,486 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:46,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:42:46,486 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:46,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:46,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 1 times [2022-04-15 05:42:46,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:46,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1615673493] [2022-04-15 05:42:46,487 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:42:46,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 2 times [2022-04-15 05:42:46,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:46,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625366582] [2022-04-15 05:42:46,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:46,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:46,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:46,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {157#(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(36, 2); {149#true} is VALID [2022-04-15 05:42:46,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-15 05:42:46,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-15 05:42:46,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:46,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#(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(36, 2); {149#true} is VALID [2022-04-15 05:42:46,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-15 05:42:46,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-15 05:42:46,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret3 := main(); {149#true} is VALID [2022-04-15 05:42:46,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 05:42:46,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 05:42:46,560 INFO L272 TraceCheckUtils]: 7: Hoare triple {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {155#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:42:46,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {156#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:42:46,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {150#false} is VALID [2022-04-15 05:42:46,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-15 05:42:46,561 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 05:42:46,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:46,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625366582] [2022-04-15 05:42:46,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625366582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:46,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:46,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:42:46,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:46,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1615673493] [2022-04-15 05:42:46,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1615673493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:46,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:46,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:42:46,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194297922] [2022-04-15 05:42:46,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:46,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-15 05:42:46,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:46,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 05:42:46,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:46,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:42:46,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:46,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:42:46,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 05:42:46,573 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 05:42:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:46,663 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-15 05:42:46,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:42:46,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-15 05:42:46,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 05:42:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-15 05:42:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 05:42:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-15 05:42:46,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 21 transitions. [2022-04-15 05:42:46,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:46,683 INFO L225 Difference]: With dead ends: 20 [2022-04-15 05:42:46,683 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 05:42:46,683 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 05:42:46,684 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:46,685 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 29 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:42:46,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 05:42:46,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 05:42:46,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:46,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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 05:42:46,688 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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 05:42:46,688 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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 05:42:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:46,689 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 05:42:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 05:42:46,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:46,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:46,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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 15 states. [2022-04-15 05:42:46,690 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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 15 states. [2022-04-15 05:42:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:46,691 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 05:42:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 05:42:46,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:46,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:46,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:46,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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 05:42:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 05:42:46,692 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-15 05:42:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:46,693 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 05:42:46,693 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 05:42:46,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 05:42:46,705 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 05:42:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 05:42:46,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 05:42:46,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:46,706 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:46,706 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:42:46,706 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:46,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:46,707 INFO L85 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 1 times [2022-04-15 05:42:46,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:46,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2025912537] [2022-04-15 05:42:47,089 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:42:47,090 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:42:47,092 INFO L85 PathProgramCache]: Analyzing trace with hash -994786162, now seen corresponding path program 1 times [2022-04-15 05:42:47,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:47,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055903763] [2022-04-15 05:42:47,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:47,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:47,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:47,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#(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(36, 2); {266#true} is VALID [2022-04-15 05:42:47,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume true; {266#true} is VALID [2022-04-15 05:42:47,167 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {266#true} {266#true} #47#return; {266#true} is VALID [2022-04-15 05:42:47,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:47,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#(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(36, 2); {266#true} is VALID [2022-04-15 05:42:47,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2022-04-15 05:42:47,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #47#return; {266#true} is VALID [2022-04-15 05:42:47,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret3 := main(); {266#true} is VALID [2022-04-15 05:42:47,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {266#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {271#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 05:42:47,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {271#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [51] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_11 v_main_~i~0_10)) (.cse1 (= |v_main_#t~post2_4| |v_main_#t~post2_3|)) (.cse2 (<= v_main_~i~0_11 v_main_~n~0_6)) (.cse3 (= v_main_~i~0_11 4))) (or (and (= v_main_~n~0_6 v_main_~n~0_6) .cse0 .cse1 (= v_main_~sn~0_10 v_main_~sn~0_7)) (and (= v_main_~sn~0_7 v_main_~sn~0_10) .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse2 (<= v_main_~i~0_10 5) (< v_main_~i~0_11 v_main_~i~0_10) (= (+ v_main_~sn~0_7 10) 0) .cse3))) InVars {main_~i~0=v_main_~i~0_11, main_#t~post2=|v_main_#t~post2_4|, main_~n~0=v_main_~n~0_6, main_~sn~0=v_main_~sn~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_6, main_~sn~0=v_main_~sn~0_7} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {272#(= main_~sn~0 0)} is VALID [2022-04-15 05:42:47,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {272#(= main_~sn~0 0)} [50] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {272#(= main_~sn~0 0)} is VALID [2022-04-15 05:42:47,171 INFO L272 TraceCheckUtils]: 8: Hoare triple {272#(= main_~sn~0 0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:42:47,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {274#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:42:47,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {274#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {267#false} is VALID [2022-04-15 05:42:47,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-04-15 05:42:47,172 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 05:42:47,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:47,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055903763] [2022-04-15 05:42:47,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055903763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:47,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:47,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:42:47,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:47,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2025912537] [2022-04-15 05:42:47,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2025912537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:47,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:47,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:42:47,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486852117] [2022-04-15 05:42:47,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:47,199 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 05:42:47,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:47,200 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 05:42:47,209 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 05:42:47,209 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:42:47,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:47,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:42:47,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:42:47,210 INFO L87 Difference]: Start difference. First operand 15 states and 16 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 05:42:47,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:47,321 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 05:42:47,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:42:47,322 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 05:42:47,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:47,322 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 05:42:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-15 05:42:47,323 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 05:42:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-15 05:42:47,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-15 05:42:47,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:47,347 INFO L225 Difference]: With dead ends: 25 [2022-04-15 05:42:47,347 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 05:42:47,347 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:42:47,348 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:47,348 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 39 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:42:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 05:42:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-15 05:42:47,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:47,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 05:42:47,352 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 05:42:47,352 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 05:42:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:47,353 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 05:42:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 05:42:47,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:47,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:47,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 17 states. [2022-04-15 05:42:47,354 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 17 states. [2022-04-15 05:42:47,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:47,354 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 05:42:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 05:42:47,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:47,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:47,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:47,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 05:42:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 05:42:47,356 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-04-15 05:42:47,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:47,356 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 05:42:47,356 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 05:42:47,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-15 05:42:47,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 05:42:47,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 05:42:47,370 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:47,370 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:47,370 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 05:42:47,370 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:47,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:47,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1968158987, now seen corresponding path program 1 times [2022-04-15 05:42:47,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:47,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [204497152] [2022-04-15 05:42:50,737 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 05:42:50,875 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:42:50,877 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:42:50,880 INFO L85 PathProgramCache]: Analyzing trace with hash -935680818, now seen corresponding path program 1 times [2022-04-15 05:42:50,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:50,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320950409] [2022-04-15 05:42:50,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:50,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:50,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:50,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {409#(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(36, 2); {399#true} is VALID [2022-04-15 05:42:50,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {399#true} assume true; {399#true} is VALID [2022-04-15 05:42:50,983 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {399#true} {399#true} #47#return; {399#true} is VALID [2022-04-15 05:42:50,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {399#true} call ULTIMATE.init(); {409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:50,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {409#(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(36, 2); {399#true} is VALID [2022-04-15 05:42:50,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {399#true} assume true; {399#true} is VALID [2022-04-15 05:42:50,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {399#true} {399#true} #47#return; {399#true} is VALID [2022-04-15 05:42:50,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {399#true} call #t~ret3 := main(); {399#true} is VALID [2022-04-15 05:42:50,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {399#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {404#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 05:42:50,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {404#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [53] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_9| |v_main_#t~post2_8|)) (.cse1 (= v_main_~i~0_17 v_main_~i~0_16)) (.cse2 (= v_main_~sn~0_17 v_main_~sn~0_16)) (.cse3 (= v_main_~i~0_17 4))) (or (and .cse0 .cse1 (= v_main_~n~0_8 v_main_~n~0_8) .cse2) (and .cse0 .cse1 (or (not (<= v_main_~i~0_17 v_main_~n~0_8)) .cse3) .cse2) (and (or (not (<= 5 v_main_~i~0_16)) (not (<= v_main_~i~0_17 3))) (not .cse3) (<= v_main_~i~0_16 (+ v_main_~n~0_8 1)) (< v_main_~i~0_17 v_main_~i~0_16) (= (+ (* v_main_~i~0_16 2) v_main_~sn~0_17) (+ (* v_main_~i~0_17 2) v_main_~sn~0_16))))) InVars {main_~i~0=v_main_~i~0_17, main_#t~post2=|v_main_#t~post2_9|, main_~n~0=v_main_~n~0_8, main_~sn~0=v_main_~sn~0_17} OutVars{main_~i~0=v_main_~i~0_16, main_#t~post2=|v_main_#t~post2_8|, main_~n~0=v_main_~n~0_8, main_~sn~0=v_main_~sn~0_16} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {405#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} is VALID [2022-04-15 05:42:50,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} [52] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {406#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} is VALID [2022-04-15 05:42:50,987 INFO L272 TraceCheckUtils]: 8: Hoare triple {406#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {407#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:42:50,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {407#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {408#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:42:50,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {408#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {400#false} is VALID [2022-04-15 05:42:50,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {400#false} assume !false; {400#false} is VALID [2022-04-15 05:42:50,988 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 05:42:50,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:50,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320950409] [2022-04-15 05:42:50,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320950409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:50,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:50,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:42:51,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:51,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [204497152] [2022-04-15 05:42:51,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [204497152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:51,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:51,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 05:42:51,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784998668] [2022-04-15 05:42:51,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:51,141 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 05:42:51,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:51,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 05:42:51,153 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 05:42:51,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 05:42:51,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:51,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 05:42:51,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:42:51,154 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 05:42:51,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:51,502 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 05:42:51,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:42:51,502 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 05:42:51,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 05:42:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2022-04-15 05:42:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 05:42:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2022-04-15 05:42:51,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 26 transitions. [2022-04-15 05:42:51,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:51,528 INFO L225 Difference]: With dead ends: 24 [2022-04-15 05:42:51,528 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 05:42:51,528 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-04-15 05:42:51,529 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:51,529 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 41 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:42:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 05:42:51,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 05:42:51,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:51,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 05:42:51,541 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 05:42:51,541 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 05:42:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:51,542 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 05:42:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 05:42:51,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:51,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:51,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 19 states. [2022-04-15 05:42:51,542 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 19 states. [2022-04-15 05:42:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:51,543 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 05:42:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 05:42:51,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:51,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:51,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:51,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 05:42:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 05:42:51,544 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2022-04-15 05:42:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:51,545 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 05:42:51,545 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 05:42:51,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 05:42:51,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 05:42:51,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:42:51,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:51,581 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:51,581 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 05:42:51,581 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:51,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:51,581 INFO L85 PathProgramCache]: Analyzing trace with hash 80268138, now seen corresponding path program 1 times [2022-04-15 05:42:51,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:51,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118275198] [2022-04-15 05:42:53,875 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:42:54,137 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:42:54,138 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:42:54,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1591374445, now seen corresponding path program 1 times [2022-04-15 05:42:54,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:54,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014536173] [2022-04-15 05:42:54,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:54,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:42:54,169 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:42:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:42:54,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:42:54,213 INFO L85 PathProgramCache]: Analyzing trace with hash 80268138, now seen corresponding path program 2 times [2022-04-15 05:42:54,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:54,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253142593] [2022-04-15 05:42:54,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:54,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:54,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:54,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {561#(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(36, 2); {554#true} is VALID [2022-04-15 05:42:54,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-15 05:42:54,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {554#true} {554#true} #47#return; {554#true} is VALID [2022-04-15 05:42:54,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:54,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {561#(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(36, 2); {554#true} is VALID [2022-04-15 05:42:54,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-15 05:42:54,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #47#return; {554#true} is VALID [2022-04-15 05:42:54,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret3 := main(); {554#true} is VALID [2022-04-15 05:42:54,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {559#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 05:42:54,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {559#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {559#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 05:42:54,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {559#(= (+ (- 1) main_~i~0) 0)} assume !(4 == ~i~0); {559#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 05:42:54,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {559#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {560#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:54,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {560#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {560#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:54,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {560#(<= main_~i~0 2)} assume 4 == ~i~0;~sn~0 := -10; {555#false} is VALID [2022-04-15 05:42:54,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {555#false} is VALID [2022-04-15 05:42:54,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {555#false} assume !(~i~0 <= ~n~0); {555#false} is VALID [2022-04-15 05:42:54,250 INFO L272 TraceCheckUtils]: 13: Hoare triple {555#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {555#false} is VALID [2022-04-15 05:42:54,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#false} ~cond := #in~cond; {555#false} is VALID [2022-04-15 05:42:54,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {555#false} assume 0 == ~cond; {555#false} is VALID [2022-04-15 05:42:54,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-15 05:42:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:42:54,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:54,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253142593] [2022-04-15 05:42:54,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253142593] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:54,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121432639] [2022-04-15 05:42:54,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:54,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:54,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:54,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:54,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 05:42:54,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:54,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:54,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 05:42:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:54,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:54,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-15 05:42:54,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} #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(36, 2); {554#true} is VALID [2022-04-15 05:42:54,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-15 05:42:54,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #47#return; {554#true} is VALID [2022-04-15 05:42:54,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret3 := main(); {554#true} is VALID [2022-04-15 05:42:54,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {580#(<= main_~i~0 1)} is VALID [2022-04-15 05:42:54,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {580#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {580#(<= main_~i~0 1)} is VALID [2022-04-15 05:42:54,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {580#(<= main_~i~0 1)} assume !(4 == ~i~0); {580#(<= main_~i~0 1)} is VALID [2022-04-15 05:42:54,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {560#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:54,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {560#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {560#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:54,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {560#(<= main_~i~0 2)} assume 4 == ~i~0;~sn~0 := -10; {555#false} is VALID [2022-04-15 05:42:54,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {555#false} is VALID [2022-04-15 05:42:54,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {555#false} assume !(~i~0 <= ~n~0); {555#false} is VALID [2022-04-15 05:42:54,356 INFO L272 TraceCheckUtils]: 13: Hoare triple {555#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {555#false} is VALID [2022-04-15 05:42:54,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#false} ~cond := #in~cond; {555#false} is VALID [2022-04-15 05:42:54,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {555#false} assume 0 == ~cond; {555#false} is VALID [2022-04-15 05:42:54,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-15 05:42:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:42:54,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:54,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-15 05:42:54,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {555#false} assume 0 == ~cond; {555#false} is VALID [2022-04-15 05:42:54,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#false} ~cond := #in~cond; {555#false} is VALID [2022-04-15 05:42:54,414 INFO L272 TraceCheckUtils]: 13: Hoare triple {555#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {555#false} is VALID [2022-04-15 05:42:54,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {555#false} assume !(~i~0 <= ~n~0); {555#false} is VALID [2022-04-15 05:42:54,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {555#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {555#false} is VALID [2022-04-15 05:42:54,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {632#(not (<= 4 main_~i~0))} assume 4 == ~i~0;~sn~0 := -10; {555#false} is VALID [2022-04-15 05:42:54,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {632#(not (<= 4 main_~i~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {632#(not (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:54,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {560#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {632#(not (<= 4 main_~i~0))} is VALID [2022-04-15 05:42:54,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {560#(<= main_~i~0 2)} assume !(4 == ~i~0); {560#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:54,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {560#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {560#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:54,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {560#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:54,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret3 := main(); {554#true} is VALID [2022-04-15 05:42:54,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #47#return; {554#true} is VALID [2022-04-15 05:42:54,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-15 05:42:54,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} #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(36, 2); {554#true} is VALID [2022-04-15 05:42:54,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-15 05:42:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:42:54,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121432639] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:54,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:54,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-15 05:42:54,419 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:54,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1118275198] [2022-04-15 05:42:54,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1118275198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:54,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:54,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:42:54,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512370545] [2022-04-15 05:42:54,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:54,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-15 05:42:54,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:54,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 05:42:54,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:54,430 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:42:54,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:54,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:42:54,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-15 05:42:54,431 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 05:42:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:54,498 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 05:42:54,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:42:54,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-15 05:42:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 05:42:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 05:42:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 05:42:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 05:42:54,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-15 05:42:54,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:54,525 INFO L225 Difference]: With dead ends: 31 [2022-04-15 05:42:54,525 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 05:42:54,525 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 05:42:54,526 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:54,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 19 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:42:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 05:42:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-15 05:42:54,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:54,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 05:42:54,545 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 05:42:54,545 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 05:42:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:54,546 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 05:42:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 05:42:54,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:54,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:54,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 23 states. [2022-04-15 05:42:54,547 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 23 states. [2022-04-15 05:42:54,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:54,547 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 05:42:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 05:42:54,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:54,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:54,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:54,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 05:42:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-15 05:42:54,548 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2022-04-15 05:42:54,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:54,549 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-15 05:42:54,549 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 05:42:54,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2022-04-15 05:42:54,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 05:42:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:42:54,570 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:54,570 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:54,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 05:42:54,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-15 05:42:54,786 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:54,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:54,787 INFO L85 PathProgramCache]: Analyzing trace with hash 127699689, now seen corresponding path program 3 times [2022-04-15 05:42:54,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:54,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [18559552] [2022-04-15 05:42:58,949 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 05:42:59,087 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:42:59,359 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:42:59,360 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:42:59,363 INFO L85 PathProgramCache]: Analyzing trace with hash -654060691, now seen corresponding path program 1 times [2022-04-15 05:42:59,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:59,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577500980] [2022-04-15 05:42:59,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:59,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:42:59,385 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:42:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:42:59,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:42:59,401 INFO L85 PathProgramCache]: Analyzing trace with hash 127699689, now seen corresponding path program 4 times [2022-04-15 05:42:59,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:59,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789283358] [2022-04-15 05:42:59,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:59,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:59,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:59,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {829#(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(36, 2); {821#true} is VALID [2022-04-15 05:42:59,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {821#true} assume true; {821#true} is VALID [2022-04-15 05:42:59,435 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {821#true} {821#true} #47#return; {821#true} is VALID [2022-04-15 05:42:59,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:59,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {829#(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(36, 2); {821#true} is VALID [2022-04-15 05:42:59,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2022-04-15 05:42:59,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #47#return; {821#true} is VALID [2022-04-15 05:42:59,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret3 := main(); {821#true} is VALID [2022-04-15 05:42:59,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {821#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {826#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 05:42:59,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {826#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {826#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 05:42:59,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {826#(= (+ (- 1) main_~i~0) 0)} assume !(4 == ~i~0); {826#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 05:42:59,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {826#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {827#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:59,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {827#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {827#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:59,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {827#(<= main_~i~0 2)} assume !(4 == ~i~0); {827#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:59,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {827#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {828#(<= main_~i~0 3)} is VALID [2022-04-15 05:42:59,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {828#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {828#(<= main_~i~0 3)} is VALID [2022-04-15 05:42:59,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {828#(<= main_~i~0 3)} assume 4 == ~i~0;~sn~0 := -10; {822#false} is VALID [2022-04-15 05:42:59,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {822#false} is VALID [2022-04-15 05:42:59,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#false} assume !(~i~0 <= ~n~0); {822#false} is VALID [2022-04-15 05:42:59,440 INFO L272 TraceCheckUtils]: 16: Hoare triple {822#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {822#false} is VALID [2022-04-15 05:42:59,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {822#false} ~cond := #in~cond; {822#false} is VALID [2022-04-15 05:42:59,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {822#false} assume 0 == ~cond; {822#false} is VALID [2022-04-15 05:42:59,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {822#false} assume !false; {822#false} is VALID [2022-04-15 05:42:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:42:59,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:59,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789283358] [2022-04-15 05:42:59,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789283358] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:59,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474172328] [2022-04-15 05:42:59,441 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:42:59,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:59,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:59,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:42:59,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 05:42:59,499 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:42:59,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:59,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:42:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:59,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:59,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2022-04-15 05:42:59,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {821#true} #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(36, 2); {821#true} is VALID [2022-04-15 05:42:59,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2022-04-15 05:42:59,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #47#return; {821#true} is VALID [2022-04-15 05:42:59,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret3 := main(); {821#true} is VALID [2022-04-15 05:42:59,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {821#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {848#(<= main_~i~0 1)} is VALID [2022-04-15 05:42:59,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {848#(<= main_~i~0 1)} is VALID [2022-04-15 05:42:59,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {848#(<= main_~i~0 1)} assume !(4 == ~i~0); {848#(<= main_~i~0 1)} is VALID [2022-04-15 05:42:59,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {848#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {827#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:59,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {827#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {827#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:59,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {827#(<= main_~i~0 2)} assume !(4 == ~i~0); {827#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:59,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {827#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {828#(<= main_~i~0 3)} is VALID [2022-04-15 05:42:59,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {828#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {828#(<= main_~i~0 3)} is VALID [2022-04-15 05:42:59,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {828#(<= main_~i~0 3)} assume 4 == ~i~0;~sn~0 := -10; {822#false} is VALID [2022-04-15 05:42:59,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {822#false} is VALID [2022-04-15 05:42:59,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#false} assume !(~i~0 <= ~n~0); {822#false} is VALID [2022-04-15 05:42:59,577 INFO L272 TraceCheckUtils]: 16: Hoare triple {822#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {822#false} is VALID [2022-04-15 05:42:59,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {822#false} ~cond := #in~cond; {822#false} is VALID [2022-04-15 05:42:59,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {822#false} assume 0 == ~cond; {822#false} is VALID [2022-04-15 05:42:59,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {822#false} assume !false; {822#false} is VALID [2022-04-15 05:42:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:42:59,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:59,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {822#false} assume !false; {822#false} is VALID [2022-04-15 05:42:59,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {822#false} assume 0 == ~cond; {822#false} is VALID [2022-04-15 05:42:59,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {822#false} ~cond := #in~cond; {822#false} is VALID [2022-04-15 05:42:59,647 INFO L272 TraceCheckUtils]: 16: Hoare triple {822#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {822#false} is VALID [2022-04-15 05:42:59,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#false} assume !(~i~0 <= ~n~0); {822#false} is VALID [2022-04-15 05:42:59,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {822#false} is VALID [2022-04-15 05:42:59,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {828#(<= main_~i~0 3)} assume 4 == ~i~0;~sn~0 := -10; {822#false} is VALID [2022-04-15 05:42:59,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {828#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {828#(<= main_~i~0 3)} is VALID [2022-04-15 05:42:59,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {827#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {828#(<= main_~i~0 3)} is VALID [2022-04-15 05:42:59,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {827#(<= main_~i~0 2)} assume !(4 == ~i~0); {827#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:59,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {827#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {827#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:59,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {848#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {827#(<= main_~i~0 2)} is VALID [2022-04-15 05:42:59,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {848#(<= main_~i~0 1)} assume !(4 == ~i~0); {848#(<= main_~i~0 1)} is VALID [2022-04-15 05:42:59,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {848#(<= main_~i~0 1)} is VALID [2022-04-15 05:42:59,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {821#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {848#(<= main_~i~0 1)} is VALID [2022-04-15 05:42:59,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {821#true} call #t~ret3 := main(); {821#true} is VALID [2022-04-15 05:42:59,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {821#true} {821#true} #47#return; {821#true} is VALID [2022-04-15 05:42:59,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2022-04-15 05:42:59,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {821#true} #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(36, 2); {821#true} is VALID [2022-04-15 05:42:59,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {821#true} is VALID [2022-04-15 05:42:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:42:59,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474172328] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:59,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:59,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-15 05:42:59,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:59,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [18559552] [2022-04-15 05:42:59,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [18559552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:59,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:59,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:42:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853872650] [2022-04-15 05:42:59,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:59,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 20 [2022-04-15 05:42:59,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:59,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 05:42:59,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:59,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:42:59,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:59,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:42:59,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-15 05:42:59,678 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 05:42:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:59,766 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 05:42:59,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:42:59,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 20 [2022-04-15 05:42:59,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 05:42:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-15 05:42:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 05:42:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-15 05:42:59,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-04-15 05:42:59,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:59,791 INFO L225 Difference]: With dead ends: 34 [2022-04-15 05:42:59,791 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 05:42:59,792 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:42:59,793 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:59,793 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:42:59,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 05:42:59,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 05:42:59,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:59,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 05:42:59,816 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 05:42:59,816 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 05:42:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:59,817 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 05:42:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 05:42:59,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:59,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:59,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 26 states. [2022-04-15 05:42:59,818 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 26 states. [2022-04-15 05:42:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:59,820 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 05:42:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 05:42:59,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:59,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:59,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:59,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 05:42:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 05:42:59,822 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2022-04-15 05:42:59,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:59,822 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 05:42:59,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 05:42:59,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-15 05:42:59,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 05:42:59,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:42:59,847 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:59,847 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:42:59,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 05:43:00,066 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6 [2022-04-15 05:43:00,067 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:00,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:00,067 INFO L85 PathProgramCache]: Analyzing trace with hash 116795146, now seen corresponding path program 5 times [2022-04-15 05:43:00,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:00,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [700201031] [2022-04-15 05:43:03,590 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 05:43:03,702 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:03,916 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:03,917 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:43:03,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1395471469, now seen corresponding path program 1 times [2022-04-15 05:43:03,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:03,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300023107] [2022-04-15 05:43:03,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:03,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:43:03,937 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:43:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:43:03,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:43:03,957 INFO L85 PathProgramCache]: Analyzing trace with hash 116795146, now seen corresponding path program 6 times [2022-04-15 05:43:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:03,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576381669] [2022-04-15 05:43:03,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:03,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:43:03,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:43:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:43:03,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:43:03,994 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 05:43:03,995 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 05:43:04,006 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 05:43:04,007 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable9 [2022-04-15 05:43:04,009 INFO L719 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:04,011 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 05:43:04,017 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 05:43:04,018 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-15 05:43:04,018 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-15 05:43:04,018 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 05:43:04,018 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 05:43:04,018 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 05:43:04,018 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 05:43:04,018 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 05:43:04,018 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 05:43:04,018 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-15 05:43:04,018 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 05:43:04,018 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 05:43:04,018 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 05:43:04,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:43:04 BoogieIcfgContainer [2022-04-15 05:43:04,019 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 05:43:04,020 INFO L158 Benchmark]: Toolchain (without parser) took 18647.22ms. Allocated memory was 165.7MB in the beginning and 260.0MB in the end (delta: 94.4MB). Free memory was 109.5MB in the beginning and 107.9MB in the end (delta: 1.6MB). Peak memory consumption was 96.0MB. Max. memory is 8.0GB. [2022-04-15 05:43:04,020 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 165.7MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:43:04,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.64ms. Allocated memory was 165.7MB in the beginning and 260.0MB in the end (delta: 94.4MB). Free memory was 109.4MB in the beginning and 232.4MB in the end (delta: -123.1MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-15 05:43:04,021 INFO L158 Benchmark]: Boogie Preprocessor took 52.19ms. Allocated memory is still 260.0MB. Free memory was 232.4MB in the beginning and 230.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 05:43:04,021 INFO L158 Benchmark]: RCFGBuilder took 285.76ms. Allocated memory is still 260.0MB. Free memory was 230.9MB in the beginning and 220.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 05:43:04,021 INFO L158 Benchmark]: TraceAbstraction took 18046.13ms. Allocated memory is still 260.0MB. Free memory was 219.8MB in the beginning and 107.9MB in the end (delta: 111.9MB). Peak memory consumption was 112.4MB. Max. memory is 8.0GB. [2022-04-15 05:43:04,022 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.11ms. Allocated memory is still 165.7MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.64ms. Allocated memory was 165.7MB in the beginning and 260.0MB in the end (delta: 94.4MB). Free memory was 109.4MB in the beginning and 232.4MB in the end (delta: -123.1MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.19ms. Allocated memory is still 260.0MB. Free memory was 232.4MB in the beginning and 230.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 285.76ms. Allocated memory is still 260.0MB. Free memory was 230.9MB in the beginning and 220.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 18046.13ms. Allocated memory is still 260.0MB. Free memory was 219.8MB in the beginning and 107.9MB in the end (delta: 111.9MB). Peak memory consumption was 112.4MB. Max. memory is 8.0GB. * 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L24] i=1 [L24] COND TRUE i<=n [L25] sn = sn + (2) [L26] COND FALSE !(i==4) [L24] i++ [L24] COND TRUE i<=n [L25] sn = sn + (2) [L26] COND FALSE !(i==4) [L24] i++ [L24] COND TRUE i<=n [L25] sn = sn + (2) [L26] COND FALSE !(i==4) [L24] i++ [L24] COND TRUE i<=n [L25] sn = sn + (2) [L26] COND TRUE i==4 [L26] sn=-10 [L24] i++ [L24] COND FALSE !(i<=n) [L28] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.0s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 175 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 201 IncrementalHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 77 mSDtfsCounter, 201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=6, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-15 05:43:04,040 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...