/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/mono-crafted_12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:01:14,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:01:14,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:01:14,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:01:14,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:01:14,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:01:14,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:01:14,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:01:14,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:01:14,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:01:14,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:01:14,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:01:14,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:01:14,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:01:14,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:01:14,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:01:14,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:01:14,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:01:14,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:01:14,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:01:14,651 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:01:14,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:01:14,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:01:14,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:01:14,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:01:14,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:01:14,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:01:14,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:01:14,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:01:14,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:01:14,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:01:14,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:01:14,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:01:14,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:01:14,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:01:14,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:01:14,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:01:14,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:01:14,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:01:14,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:01:14,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:01:14,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:01:14,668 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:01:14,678 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:01:14,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:01:14,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:01:14,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:01:14,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:01:14,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:01:14,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:01:14,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:01:14,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:01:14,681 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:01:14,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:01:14,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:01:14,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:01:14,681 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:01:14,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:01:14,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:01:14,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:01:14,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:01:14,682 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:01:14,682 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:01:14,682 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:01:14,682 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:01:14,682 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:01:14,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:01:14,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:01:14,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:01:14,929 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:01:14,930 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:01:14,931 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2022-04-15 13:01:14,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd31533e/56c46c8e578a40ecae1d20115669932d/FLAGdaa996846 [2022-04-15 13:01:15,387 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:01:15,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2022-04-15 13:01:15,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd31533e/56c46c8e578a40ecae1d20115669932d/FLAGdaa996846 [2022-04-15 13:01:15,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd31533e/56c46c8e578a40ecae1d20115669932d [2022-04-15 13:01:15,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:01:15,800 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:01:15,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:01:15,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:01:15,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:01:15,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:01:15" (1/1) ... [2022-04-15 13:01:15,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23235fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:15, skipping insertion in model container [2022-04-15 13:01:15,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:01:15" (1/1) ... [2022-04-15 13:01:15,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:01:15,825 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:01:15,964 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/mono-crafted_12.c[319,332] [2022-04-15 13:01:15,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:01:15,995 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:01:16,010 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/mono-crafted_12.c[319,332] [2022-04-15 13:01:16,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:01:16,034 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:01:16,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:16 WrapperNode [2022-04-15 13:01:16,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:01:16,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:01:16,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:01:16,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:01:16,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:16" (1/1) ... [2022-04-15 13:01:16,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:16" (1/1) ... [2022-04-15 13:01:16,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:16" (1/1) ... [2022-04-15 13:01:16,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:16" (1/1) ... [2022-04-15 13:01:16,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:16" (1/1) ... [2022-04-15 13:01:16,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:16" (1/1) ... [2022-04-15 13:01:16,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:16" (1/1) ... [2022-04-15 13:01:16,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:01:16,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:01:16,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:01:16,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:01:16,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:16" (1/1) ... [2022-04-15 13:01:16,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:01:16,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:16,105 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:01:16,126 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:01:16,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:01:16,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:01:16,141 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:01:16,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:01:16,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:01:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:01:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:01:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:01:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:01:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:01:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:01:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:01:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:01:16,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:01:16,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:01:16,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:01:16,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:01:16,203 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:01:16,205 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:01:16,376 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:01:16,382 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:01:16,382 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:01:16,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:01:16 BoogieIcfgContainer [2022-04-15 13:01:16,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:01:16,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:01:16,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:01:16,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:01:16,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:01:15" (1/3) ... [2022-04-15 13:01:16,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a93e51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:01:16, skipping insertion in model container [2022-04-15 13:01:16,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:16" (2/3) ... [2022-04-15 13:01:16,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a93e51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:01:16, skipping insertion in model container [2022-04-15 13:01:16,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:01:16" (3/3) ... [2022-04-15 13:01:16,407 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_12.c [2022-04-15 13:01:16,411 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:01:16,411 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:01:16,463 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:01:16,468 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:01:16,469 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:01:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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:01:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:01:16,507 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:16,507 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:16,509 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:16,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:16,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 1 times [2022-04-15 13:01:16,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:16,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [58069775] [2022-04-15 13:01:16,532 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:01:16,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 2 times [2022-04-15 13:01:16,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:16,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734901049] [2022-04-15 13:01:16,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:16,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:16,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:16,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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(18, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 13:01:16,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 13:01:16,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-15 13:01:16,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:16,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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(18, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 13:01:16,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 13:01:16,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-15 13:01:16,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-15 13:01:16,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 0; {24#true} is VALID [2022-04-15 13:01:16,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-15 13:01:16,724 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 2 then ~z~0 % 4294967296 % 2 - 2 else ~z~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {25#false} is VALID [2022-04-15 13:01:16,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-15 13:01:16,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-15 13:01:16,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 13:01:16,725 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:01:16,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:16,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734901049] [2022-04-15 13:01:16,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734901049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:16,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:16,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:01:16,731 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:16,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [58069775] [2022-04-15 13:01:16,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [58069775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:16,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:16,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:01:16,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806871216] [2022-04-15 13:01:16,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:16,738 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 13:01:16,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:16,742 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 13:01:16,767 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 13:01:16,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:01:16,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:16,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:01:16,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:01:16,796 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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 13:01:16,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:16,875 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 13:01:16,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:01:16,876 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 13:01:16,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:16,877 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 13:01:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 13:01:16,886 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 13:01:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 13:01:16,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-15 13:01:16,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:16,963 INFO L225 Difference]: With dead ends: 33 [2022-04-15 13:01:16,963 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 13:01:16,965 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:01:16,968 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 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 13:01:16,969 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:01:16,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 13:01:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 13:01:16,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:16,995 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 13:01:16,995 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 13:01:16,996 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 13:01:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:16,998 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 13:01:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 13:01:16,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:16,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:16,999 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 13:01:16,999 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 13:01:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:17,002 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 13:01:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 13:01:17,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:17,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:17,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:17,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:17,003 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 13:01:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 13:01:17,006 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 13:01:17,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:17,007 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 13:01:17,007 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 13:01:17,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-15 13:01:17,025 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 13:01:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 13:01:17,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:01:17,026 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:17,026 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:17,026 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:01:17,027 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:17,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:17,027 INFO L85 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 1 times [2022-04-15 13:01:17,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:17,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2109698896] [2022-04-15 13:01:17,028 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:01:17,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 2 times [2022-04-15 13:01:17,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:17,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770457591] [2022-04-15 13:01:17,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:17,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:17,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#(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(18, 2);call #Ultimate.allocInit(12, 3); {154#true} is VALID [2022-04-15 13:01:17,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-15 13:01:17,124 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #42#return; {154#true} is VALID [2022-04-15 13:01:17,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:17,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#(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(18, 2);call #Ultimate.allocInit(12, 3); {154#true} is VALID [2022-04-15 13:01:17,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-15 13:01:17,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #42#return; {154#true} is VALID [2022-04-15 13:01:17,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret5 := main(); {154#true} is VALID [2022-04-15 13:01:17,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 0; {159#(= main_~z~0 0)} is VALID [2022-04-15 13:01:17,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(= main_~z~0 0)} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {159#(= main_~z~0 0)} is VALID [2022-04-15 13:01:17,127 INFO L272 TraceCheckUtils]: 7: Hoare triple {159#(= main_~z~0 0)} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 2 then ~z~0 % 4294967296 % 2 - 2 else ~z~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {160#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:01:17,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {160#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {161#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:01:17,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {161#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {155#false} is VALID [2022-04-15 13:01:17,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-15 13:01:17,129 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:01:17,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:17,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770457591] [2022-04-15 13:01:17,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770457591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:17,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:17,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:01:17,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:17,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2109698896] [2022-04-15 13:01:17,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2109698896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:17,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:17,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:01:17,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139940205] [2022-04-15 13:01:17,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:17,132 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 13:01:17,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:17,132 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 13:01:17,158 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 13:01:17,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:01:17,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:17,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:01:17,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:01:17,159 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 13:01:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:17,313 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 13:01:17,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:01:17,313 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 13:01:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:17,313 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 13:01:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-15 13:01:17,315 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 13:01:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-15 13:01:17,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-15 13:01:17,352 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 13:01:17,354 INFO L225 Difference]: With dead ends: 22 [2022-04-15 13:01:17,354 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 13:01:17,354 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 13:01:17,356 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:17,356 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 31 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:01:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 13:01:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 13:01:17,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:17,362 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:01:17,362 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:01:17,363 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:01:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:17,365 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 13:01:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:01:17,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:17,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:17,372 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:01:17,372 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:01:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:17,374 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 13:01:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:01:17,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:17,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:17,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:17,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:17,376 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:01:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 13:01:17,378 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-15 13:01:17,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:17,378 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 13:01:17,378 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 13:01:17,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 13:01:17,400 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:01:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 13:01:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 13:01:17,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:17,401 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:17,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:01:17,402 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:17,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:17,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1854346422, now seen corresponding path program 1 times [2022-04-15 13:01:17,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:17,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1552759093] [2022-04-15 13:01:17,651 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:01:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1115131409, now seen corresponding path program 1 times [2022-04-15 13:01:17,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:17,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174281845] [2022-04-15 13:01:17,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:17,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:17,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {292#(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(18, 2);call #Ultimate.allocInit(12, 3); {283#true} is VALID [2022-04-15 13:01:17,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#true} assume true; {283#true} is VALID [2022-04-15 13:01:17,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {283#true} {283#true} #42#return; {283#true} is VALID [2022-04-15 13:01:17,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {283#true} call ULTIMATE.init(); {292#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:17,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#(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(18, 2);call #Ultimate.allocInit(12, 3); {283#true} is VALID [2022-04-15 13:01:17,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#true} assume true; {283#true} is VALID [2022-04-15 13:01:17,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {283#true} {283#true} #42#return; {283#true} is VALID [2022-04-15 13:01:17,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {283#true} call #t~ret5 := main(); {283#true} is VALID [2022-04-15 13:01:17,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {283#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 0; {288#(and (= main_~z~0 0) (<= 10000000 main_~y~0))} is VALID [2022-04-15 13:01:17,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {288#(and (= main_~z~0 0) (<= 10000000 main_~y~0))} [48] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~z~0_In_1 v_main_~z~0_Out_2) (= v_main_~y~0_In_1 v_main_~y~0_In_1) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (let ((.cse0 (mod (+ v_main_~x~0_Out_2 4294967295) 4294967296))) (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (<= 5000000 .cse0) (= |v_main_#t~post4_Out_2| 0) (= (+ v_main_~z~0_Out_2 (* v_main_~x~0_Out_2 (- 2))) (+ v_main_~z~0_In_1 (* (- 2) v_main_~x~0_In_1))) (< .cse0 (mod v_main_~y~0_In_1 4294967296)) (= v_main_~y~0_In_1 0)))) InVars {main_~y~0=v_main_~y~0_In_1, main_~x~0=v_main_~x~0_In_1, main_~z~0=v_main_~z~0_In_1} OutVars{main_#t~post4=|v_main_#t~post4_Out_2|, main_~y~0=v_main_~y~0_In_1, main_~x~0=v_main_~x~0_Out_2, main_~z~0=v_main_~z~0_Out_2} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4] {289#(= main_~z~0 0)} is VALID [2022-04-15 13:01:17,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {289#(= main_~z~0 0)} [47] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {289#(= main_~z~0 0)} is VALID [2022-04-15 13:01:17,758 INFO L272 TraceCheckUtils]: 8: Hoare triple {289#(= main_~z~0 0)} call __VERIFIER_assert((if 0 == (if ~z~0 % 4294967296 < 0 && 0 != ~z~0 % 4294967296 % 2 then ~z~0 % 4294967296 % 2 - 2 else ~z~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {290#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:01:17,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {290#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {291#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:01:17,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {291#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {284#false} is VALID [2022-04-15 13:01:17,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {284#false} assume !false; {284#false} is VALID [2022-04-15 13:01:17,760 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:01:17,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:17,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174281845] [2022-04-15 13:01:17,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174281845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:17,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:17,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:01:17,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:17,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1552759093] [2022-04-15 13:01:17,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1552759093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:17,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:17,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 13:01:17,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365364906] [2022-04-15 13:01:17,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:17,886 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 13:01:17,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:17,886 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 13:01:17,903 WARN L143 InductivityCheck]: Transition 295#(and (< (mod (+ main_~x~0 4294967295) 4294967296) (mod main_~y~0 4294967296)) (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)) (<= 10000000 main_~y~0) (= main_~z~0 2)) ( _ , assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); , 289#(= main_~z~0 0) ) not inductive [2022-04-15 13:01:17,904 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:01:17,904 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:01:17,908 INFO L158 Benchmark]: Toolchain (without parser) took 2107.34ms. Allocated memory was 172.0MB in the beginning and 217.1MB in the end (delta: 45.1MB). Free memory was 116.7MB in the beginning and 160.0MB in the end (delta: -43.4MB). Peak memory consumption was 2.9MB. Max. memory is 8.0GB. [2022-04-15 13:01:17,908 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 172.0MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:01:17,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.67ms. Allocated memory is still 172.0MB. Free memory was 116.4MB in the beginning and 143.6MB in the end (delta: -27.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 13:01:17,909 INFO L158 Benchmark]: Boogie Preprocessor took 35.50ms. Allocated memory is still 172.0MB. Free memory was 143.6MB in the beginning and 141.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 13:01:17,910 INFO L158 Benchmark]: RCFGBuilder took 327.96ms. Allocated memory is still 172.0MB. Free memory was 141.9MB in the beginning and 131.7MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 13:01:17,910 INFO L158 Benchmark]: TraceAbstraction took 1504.97ms. Allocated memory was 172.0MB in the beginning and 217.1MB in the end (delta: 45.1MB). Free memory was 131.1MB in the beginning and 160.0MB in the end (delta: -28.9MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2022-04-15 13:01:17,912 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.17ms. Allocated memory is still 172.0MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.67ms. Allocated memory is still 172.0MB. Free memory was 116.4MB in the beginning and 143.6MB in the end (delta: -27.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.50ms. Allocated memory is still 172.0MB. Free memory was 143.6MB in the beginning and 141.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 327.96ms. Allocated memory is still 172.0MB. Free memory was 141.9MB in the beginning and 131.7MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1504.97ms. Allocated memory was 172.0MB in the beginning and 217.1MB in the end (delta: 45.1MB). Free memory was 131.1MB in the beginning and 160.0MB in the end (delta: -28.9MB). Peak memory consumption was 17.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:01:17,932 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...