/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sum_by_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:06:19,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:06:19,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:06:19,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:06:19,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:06:19,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:06:19,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:06:19,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:06:19,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:06:19,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:06:19,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:06:19,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:06:19,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:06:19,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:06:19,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:06:19,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:06:19,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:06:19,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:06:19,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:06:19,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:06:19,253 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:06:19,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:06:19,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:06:19,273 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:06:19,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:06:19,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:06:19,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:06:19,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:06:19,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:06:19,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:06:19,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:06:19,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:06:19,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:06:19,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:06:19,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:06:19,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:06:19,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:06:19,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:06:19,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:06:19,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:06:19,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:06:19,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:06:19,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:06:19,296 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:06:19,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:06:19,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:06:19,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:06:19,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:06:19,297 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:06:19,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:06:19,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:06:19,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:06:19,298 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:06:19,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:06:19,298 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:06:19,298 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:06:19,298 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:06:19,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:06:19,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:06:19,299 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:06:19,299 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:06:19,299 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:06:19,299 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:06:19,300 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:06:19,300 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:06:19,300 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 13:06:19,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:06:19,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:06:19,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:06:19,528 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:06:19,529 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:06:19,531 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-04-15 13:06:19,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bdb3437e/d02a74e8b84840b59d1c269cec900112/FLAGae9dec6ba [2022-04-15 13:06:19,979 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:06:19,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-04-15 13:06:19,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bdb3437e/d02a74e8b84840b59d1c269cec900112/FLAGae9dec6ba [2022-04-15 13:06:20,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bdb3437e/d02a74e8b84840b59d1c269cec900112 [2022-04-15 13:06:20,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:06:20,418 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:06:20,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:06:20,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:06:20,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:06:20,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:06:20" (1/1) ... [2022-04-15 13:06:20,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262e476d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:20, skipping insertion in model container [2022-04-15 13:06:20,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:06:20" (1/1) ... [2022-04-15 13:06:20,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:06:20,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:06:20,576 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-crafted-1/sum_by_3.c[406,419] [2022-04-15 13:06:20,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:06:20,597 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:06:20,607 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-crafted-1/sum_by_3.c[406,419] [2022-04-15 13:06:20,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:06:20,624 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:06:20,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:20 WrapperNode [2022-04-15 13:06:20,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:06:20,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:06:20,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:06:20,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:06:20,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:20" (1/1) ... [2022-04-15 13:06:20,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:20" (1/1) ... [2022-04-15 13:06:20,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:20" (1/1) ... [2022-04-15 13:06:20,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:20" (1/1) ... [2022-04-15 13:06:20,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:20" (1/1) ... [2022-04-15 13:06:20,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:20" (1/1) ... [2022-04-15 13:06:20,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:20" (1/1) ... [2022-04-15 13:06:20,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:06:20,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:06:20,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:06:20,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:06:20,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:20" (1/1) ... [2022-04-15 13:06:20,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:06:20,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:06:20,702 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 13:06:20,703 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 13:06:20,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:06:20,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:06:20,734 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:06:20,734 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:06:20,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:06:20,735 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:06:20,735 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:06:20,735 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:06:20,735 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:06:20,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:06:20,735 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:06:20,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:06:20,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 13:06:20,736 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:06:20,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:06:20,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:06:20,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:06:20,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:06:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:06:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:06:20,787 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:06:20,788 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:06:20,968 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:06:20,977 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:06:20,977 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 13:06:20,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:06:20 BoogieIcfgContainer [2022-04-15 13:06:20,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:06:20,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:06:20,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:06:20,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:06:20,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:06:20" (1/3) ... [2022-04-15 13:06:20,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89c403b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:06:20, skipping insertion in model container [2022-04-15 13:06:20,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:20" (2/3) ... [2022-04-15 13:06:20,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89c403b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:06:20, skipping insertion in model container [2022-04-15 13:06:20,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:06:20" (3/3) ... [2022-04-15 13:06:20,996 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_by_3.c [2022-04-15 13:06:21,001 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:06:21,001 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:06:21,059 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:06:21,065 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 13:06:21,065 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:06:21,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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 13:06:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 13:06:21,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:21,093 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:21,093 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:21,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash 963326671, now seen corresponding path program 1 times [2022-04-15 13:06:21,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:21,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [803214447] [2022-04-15 13:06:21,111 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:06:21,111 INFO L85 PathProgramCache]: Analyzing trace with hash 963326671, now seen corresponding path program 2 times [2022-04-15 13:06:21,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:21,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613934652] [2022-04-15 13:06:21,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:21,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:21,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:21,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {27#true} is VALID [2022-04-15 13:06:21,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 13:06:21,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #75#return; {27#true} is VALID [2022-04-15 13:06:21,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:21,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {27#true} is VALID [2022-04-15 13:06:21,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 13:06:21,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #75#return; {27#true} is VALID [2022-04-15 13:06:21,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-15 13:06:21,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {27#true} is VALID [2022-04-15 13:06:21,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {27#true} is VALID [2022-04-15 13:06:21,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {27#true} is VALID [2022-04-15 13:06:21,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {27#true} is VALID [2022-04-15 13:06:21,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {27#true} is VALID [2022-04-15 13:06:21,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} ~k~0 := ~j~0; {27#true} is VALID [2022-04-15 13:06:21,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-15 13:06:21,353 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-15 13:06:21,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-15 13:06:21,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-15 13:06:21,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 13:06:21,354 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 13:06:21,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:21,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613934652] [2022-04-15 13:06:21,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613934652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:21,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:21,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:06:21,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:21,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [803214447] [2022-04-15 13:06:21,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [803214447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:21,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:21,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:06:21,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032224700] [2022-04-15 13:06:21,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:21,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 16 [2022-04-15 13:06:21,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:21,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 13:06:21,408 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 13:06:21,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:06:21,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:21,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:06:21,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:06:21,435 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 13:06:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:21,553 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-04-15 13:06:21,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:06:21,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 16 [2022-04-15 13:06:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 13:06:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-15 13:06:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 13:06:21,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-15 13:06:21,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-15 13:06:21,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:21,671 INFO L225 Difference]: With dead ends: 40 [2022-04-15 13:06:21,671 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 13:06:21,674 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 13:06:21,678 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:21,680 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:06:21,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 13:06:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 13:06:21,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:21,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 13:06:21,721 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 13:06:21,722 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 13:06:21,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:21,729 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 13:06:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:06:21,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:21,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:21,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 13:06:21,730 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 13:06:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:21,732 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 13:06:21,732 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:06:21,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:21,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:21,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:21,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 13:06:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 13:06:21,735 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-04-15 13:06:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:21,736 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 13:06:21,736 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 13:06:21,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 13:06:21,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:06:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 13:06:21,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:21,770 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:21,771 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:06:21,771 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:21,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash 959632587, now seen corresponding path program 1 times [2022-04-15 13:06:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:21,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [586452649] [2022-04-15 13:06:21,774 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:06:21,774 INFO L85 PathProgramCache]: Analyzing trace with hash 959632587, now seen corresponding path program 2 times [2022-04-15 13:06:21,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:21,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642562714] [2022-04-15 13:06:21,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:21,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:22,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:22,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {194#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:06:22,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:06:22,405 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {183#true} #75#return; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:06:22,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {194#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:22,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:06:22,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:06:22,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {183#true} #75#return; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:06:22,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} call #t~ret5 := main(); {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:06:22,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:06:22,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {188#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {189#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-15 13:06:22,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {189#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {189#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-15 13:06:22,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {189#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {190#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-15 13:06:22,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {190#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-15 13:06:22,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} ~k~0 := ~j~0; {191#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} is VALID [2022-04-15 13:06:22,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); {191#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} is VALID [2022-04-15 13:06:22,419 INFO L272 TraceCheckUtils]: 12: Hoare triple {191#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {192#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:06:22,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {192#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {193#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:06:22,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {193#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {184#false} is VALID [2022-04-15 13:06:22,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {184#false} assume !false; {184#false} is VALID [2022-04-15 13:06:22,421 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 13:06:22,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:22,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642562714] [2022-04-15 13:06:22,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642562714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:22,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:22,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:06:22,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:22,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [586452649] [2022-04-15 13:06:22,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [586452649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:22,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:22,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:06:22,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703345646] [2022-04-15 13:06:22,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:22,425 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 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) Word has length 16 [2022-04-15 13:06:22,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:22,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 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 13:06:24,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:24,543 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:06:24,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:24,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:06:24,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:06:24,544 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 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 13:06:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:25,120 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-15 13:06:25,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 13:06:25,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 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) Word has length 16 [2022-04-15 13:06:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 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 13:06:25,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-15 13:06:25,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 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 13:06:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-15 13:06:25,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-04-15 13:06:25,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:25,187 INFO L225 Difference]: With dead ends: 33 [2022-04-15 13:06:25,188 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 13:06:25,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:06:25,189 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 67 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:25,190 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 23 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:06:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 13:06:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-04-15 13:06:25,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:25,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 13:06:25,218 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 13:06:25,218 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 13:06:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:25,220 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-15 13:06:25,220 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-15 13:06:25,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:25,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:25,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 28 states. [2022-04-15 13:06:25,221 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 28 states. [2022-04-15 13:06:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:25,223 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-15 13:06:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-15 13:06:25,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:25,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:25,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:25,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 13:06:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-15 13:06:25,225 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2022-04-15 13:06:25,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:25,226 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-15 13:06:25,226 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 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 13:06:25,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 26 transitions. [2022-04-15 13:06:25,259 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 13:06:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 13:06:25,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:06:25,260 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:25,260 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:25,261 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:06:25,261 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:25,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:25,261 INFO L85 PathProgramCache]: Analyzing trace with hash -281665776, now seen corresponding path program 1 times [2022-04-15 13:06:25,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:25,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825839370] [2022-04-15 13:06:25,358 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:25,362 INFO L85 PathProgramCache]: Analyzing trace with hash 605837905, now seen corresponding path program 1 times [2022-04-15 13:06:25,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:25,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411688897] [2022-04-15 13:06:25,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:25,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:27,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:06:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:27,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {388#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {389#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:06:27,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {389#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:06:27,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {389#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {375#true} #75#return; {380#(and (<= 20000001 ~SIZE~0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-15 13:06:27,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {388#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:06:27,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {388#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {389#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:06:27,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {389#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {389#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:06:27,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {389#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {375#true} #75#return; {380#(and (<= 20000001 ~SIZE~0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-15 13:06:27,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {380#(and (<= 20000001 ~SIZE~0) (<= (div ~SIZE~0 4294967296) 0))} call #t~ret5 := main(); {380#(and (<= 20000001 ~SIZE~0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-15 13:06:27,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {380#(and (<= 20000001 ~SIZE~0) (<= (div ~SIZE~0 4294967296) 0))} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {380#(and (<= 20000001 ~SIZE~0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-15 13:06:27,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {380#(and (<= 20000001 ~SIZE~0) (<= (div ~SIZE~0 4294967296) 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0; {381#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-15 13:06:27,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {381#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {382#(and (<= 20000001 ~SIZE~0) (or (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (not (<= (+ (div main_~n~0 4294967296) 1) 0))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-15 13:06:27,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {382#(and (<= 20000001 ~SIZE~0) (or (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (not (<= (+ (div main_~n~0 4294967296) 1) 0))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} ~j~0 := (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296); {383#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (or (<= main_~n~0 (+ 2147483647 (* (div main_~n~0 4294967296) 4294967296))) (not (<= (+ (div main_~n~0 4294967296) 1) 0))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-15 13:06:27,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {383#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (or (<= main_~n~0 (+ 2147483647 (* (div main_~n~0 4294967296) 4294967296))) (not (<= (+ (div main_~n~0 4294967296) 1) 0))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} assume !(~j~0 % 4294967296 < ~n~0 % 4294967296); {383#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (or (<= main_~n~0 (+ 2147483647 (* (div main_~n~0 4294967296) 4294967296))) (not (<= (+ (div main_~n~0 4294967296) 1) 0))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-15 13:06:27,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {383#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (or (<= main_~n~0 (+ 2147483647 (* (div main_~n~0 4294967296) 4294967296))) (not (<= (+ (div main_~n~0 4294967296) 1) 0))) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} ~k~0 := ~j~0; {384#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (or (<= main_~n~0 (+ 2147483647 (* (div main_~n~0 4294967296) 4294967296))) (not (<= (+ (div main_~n~0 4294967296) 1) 0))) (= main_~i~0 0) (= (+ (* (- 1) main_~k~0) main_~j~0) 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-15 13:06:27,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {384#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (or (<= main_~n~0 (+ 2147483647 (* (div main_~n~0 4294967296) 4294967296))) (not (<= (+ (div main_~n~0 4294967296) 1) 0))) (= main_~i~0 0) (= (+ (* (- 1) main_~k~0) main_~j~0) 0) (<= (div ~SIZE~0 4294967296) 0))} [79] L29-2-->L29-3_primed: Formula: (or (and (= v_main_~n~0_In_1 0) (<= v_main_~k~0_In_1 v_main_~k~0_Out_2) (< (mod (+ 4294967295 v_main_~k~0_Out_2) 4294967296) (mod v_main_~n~0_In_1 4294967296))) (and (= v_main_~n~0_In_1 v_main_~n~0_In_1) (= v_main_~k~0_In_1 v_main_~k~0_Out_2))) InVars {main_~k~0=v_main_~k~0_In_1, main_~n~0=v_main_~n~0_In_1} OutVars{main_~k~0=v_main_~k~0_Out_2, main_~n~0=v_main_~n~0_In_1} AuxVars[] AssignedVars[main_~k~0] {385#(and (not (<= (+ (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) main_~j~0 1) (+ (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) (* 1431655766 (div main_~j~0 4294967296)) (* 1431655765 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))) (<= (+ main_~k~0 60000003) (+ main_~j~0 (* ~SIZE~0 3))) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0) (<= (* main_~j~0 1431655765) (* main_~k~0 1431655765)))} is VALID [2022-04-15 13:06:27,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {385#(and (not (<= (+ (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) main_~j~0 1) (+ (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) (* 1431655766 (div main_~j~0 4294967296)) (* 1431655765 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))) (<= (+ main_~k~0 60000003) (+ main_~j~0 (* ~SIZE~0 3))) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0) (<= (* main_~j~0 1431655765) (* main_~k~0 1431655765)))} [78] L29-3_primed-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {385#(and (not (<= (+ (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) main_~j~0 1) (+ (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) (* 1431655766 (div main_~j~0 4294967296)) (* 1431655765 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))) (<= (+ main_~k~0 60000003) (+ main_~j~0 (* ~SIZE~0 3))) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0) (<= (* main_~j~0 1431655765) (* main_~k~0 1431655765)))} is VALID [2022-04-15 13:06:27,103 INFO L272 TraceCheckUtils]: 13: Hoare triple {385#(and (not (<= (+ (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) main_~j~0 1) (+ (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) (* 1431655766 (div main_~j~0 4294967296)) (* 1431655765 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))) (<= (+ main_~k~0 60000003) (+ main_~j~0 (* ~SIZE~0 3))) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0) (<= (* main_~j~0 1431655765) (* main_~k~0 1431655765)))} call __VERIFIER_assert((if (if (~i~0 + ~j~0 + ~k~0) % 4294967296 < 0 && 0 != (~i~0 + ~j~0 + ~k~0) % 4294967296 % 3 then 1 + (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3 else (~i~0 + ~j~0 + ~k~0) % 4294967296 / 3) % 4294967296 <= ~SIZE~0 % 4294967296 then 1 else 0)); {386#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:06:27,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {387#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:06:27,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {387#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {376#false} is VALID [2022-04-15 13:06:27,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {376#false} assume !false; {376#false} is VALID [2022-04-15 13:06:27,105 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 13:06:27,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:27,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411688897] [2022-04-15 13:06:27,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411688897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:27,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:27,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 13:06:27,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:27,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825839370] [2022-04-15 13:06:27,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825839370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:27,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:27,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:06:27,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835893131] [2022-04-15 13:06:27,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:27,241 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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) Word has length 17 [2022-04-15 13:06:27,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:27,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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 13:06:29,344 WARN L143 InductivityCheck]: Transition 390#(and (<= 60000003 (* ~SIZE~0 3)) (= main_~k~0 (+ main_~j~0 1)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (or (<= main_~n~0 (+ 2147483647 (* (div main_~n~0 4294967296) 4294967296))) (not (<= (+ (div main_~n~0 4294967296) 1) 0))) (< (mod main_~j~0 4294967296) (mod main_~n~0 4294967296)) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0)) ( _ , assume !(~k~0 % 4294967296 < ~n~0 % 4294967296); , 385#(and (not (<= (+ (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) main_~j~0 1) (+ (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) (* 1431655766 (div main_~j~0 4294967296)) (* 1431655765 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))) (<= (+ main_~k~0 60000003) (+ main_~j~0 (* ~SIZE~0 3))) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0) (<= (* main_~j~0 1431655765) (* main_~k~0 1431655765))) ) not inductive [2022-04-15 13:06:29,345 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:06:29,345 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 13:06:29,348 INFO L158 Benchmark]: Toolchain (without parser) took 8930.83ms. Allocated memory was 173.0MB in the beginning and 224.4MB in the end (delta: 51.4MB). Free memory was 117.1MB in the beginning and 158.8MB in the end (delta: -41.6MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-15 13:06:29,349 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 173.0MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:06:29,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.49ms. Allocated memory is still 173.0MB. Free memory was 116.8MB in the beginning and 148.7MB in the end (delta: -31.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-15 13:06:29,349 INFO L158 Benchmark]: Boogie Preprocessor took 47.38ms. Allocated memory is still 173.0MB. Free memory was 148.7MB in the beginning and 147.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 13:06:29,349 INFO L158 Benchmark]: RCFGBuilder took 312.70ms. Allocated memory is still 173.0MB. Free memory was 147.1MB in the beginning and 136.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 13:06:29,350 INFO L158 Benchmark]: TraceAbstraction took 8359.08ms. Allocated memory was 173.0MB in the beginning and 224.4MB in the end (delta: 51.4MB). Free memory was 135.6MB in the beginning and 158.8MB in the end (delta: -23.2MB). Peak memory consumption was 28.6MB. Max. memory is 8.0GB. [2022-04-15 13:06:29,351 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.18ms. Allocated memory is still 173.0MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.49ms. Allocated memory is still 173.0MB. Free memory was 116.8MB in the beginning and 148.7MB in the end (delta: -31.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.38ms. Allocated memory is still 173.0MB. Free memory was 148.7MB in the beginning and 147.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 312.70ms. Allocated memory is still 173.0MB. Free memory was 147.1MB in the beginning and 136.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8359.08ms. Allocated memory was 173.0MB in the beginning and 224.4MB in the end (delta: 51.4MB). Free memory was 135.6MB in the beginning and 158.8MB in the end (delta: -23.2MB). Peak memory consumption was 28.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 13:06:29,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...