/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-fb4f59a-m [2022-04-28 10:14:20,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:14:20,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:14:20,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:14:20,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:14:20,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:14:20,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:14:20,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:14:20,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:14:20,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:14:20,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:14:20,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:14:20,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:14:20,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:14:20,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:14:20,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:14:20,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:14:20,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:14:20,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:14:20,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:14:20,536 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:14:20,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:14:20,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:14:20,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:14:20,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:14:20,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:14:20,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:14:20,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:14:20,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:14:20,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:14:20,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:14:20,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:14:20,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:14:20,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:14:20,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:14:20,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:14:20,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:14:20,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:14:20,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:14:20,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:14:20,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:14:20,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:14:20,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:14:20,565 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:14:20,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:14:20,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:14:20,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:14:20,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:14:20,566 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:14:20,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:14:20,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:14:20,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:14:20,566 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:14:20,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:14:20,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:14:20,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:14:20,566 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:14:20,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:14:20,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:14:20,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:14:20,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:14:20,568 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:14:20,568 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:14:20,568 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:14:20,568 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:14:20,568 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-28 10:14:20,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:14:20,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:14:20,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:14:20,765 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:14:20,765 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:14:20,766 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-28 10:14:20,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/202409bfc/ebdd797c4aa347b683b0688ebe250dec/FLAGa910ab429 [2022-04-28 10:14:21,235 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:14:21,235 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2022-04-28 10:14:21,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/202409bfc/ebdd797c4aa347b683b0688ebe250dec/FLAGa910ab429 [2022-04-28 10:14:21,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/202409bfc/ebdd797c4aa347b683b0688ebe250dec [2022-04-28 10:14:21,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:14:21,255 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:14:21,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:14:21,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:14:21,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:14:21,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:14:21" (1/1) ... [2022-04-28 10:14:21,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef0851d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:21, skipping insertion in model container [2022-04-28 10:14:21,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:14:21" (1/1) ... [2022-04-28 10:14:21,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:14:21,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:14:21,363 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-28 10:14:21,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:14:21,396 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:14:21,404 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-28 10:14:21,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:14:21,420 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:14:21,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:21 WrapperNode [2022-04-28 10:14:21,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:14:21,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:14:21,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:14:21,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:14:21,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:21" (1/1) ... [2022-04-28 10:14:21,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:21" (1/1) ... [2022-04-28 10:14:21,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:21" (1/1) ... [2022-04-28 10:14:21,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:21" (1/1) ... [2022-04-28 10:14:21,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:21" (1/1) ... [2022-04-28 10:14:21,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:21" (1/1) ... [2022-04-28 10:14:21,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:21" (1/1) ... [2022-04-28 10:14:21,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:14:21,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:14:21,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:14:21,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:14:21,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:21" (1/1) ... [2022-04-28 10:14:21,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:14:21,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:21,470 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-28 10:14:21,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:14:21,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:14:21,496 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:14:21,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:14:21,496 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:14:21,496 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:14:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:14:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:14:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:14:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:14:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:14:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:14:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:14:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:14:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:14:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:14:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:14:21,486 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-28 10:14:21,535 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:14:21,536 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:14:21,660 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:14:21,665 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:14:21,665 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:14:21,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:14:21 BoogieIcfgContainer [2022-04-28 10:14:21,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:14:21,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:14:21,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:14:21,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:14:21,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:14:21" (1/3) ... [2022-04-28 10:14:21,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1273d260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:14:21, skipping insertion in model container [2022-04-28 10:14:21,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:14:21" (2/3) ... [2022-04-28 10:14:21,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1273d260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:14:21, skipping insertion in model container [2022-04-28 10:14:21,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:14:21" (3/3) ... [2022-04-28 10:14:21,688 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_12.c [2022-04-28 10:14:21,698 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:14:21,698 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:14:21,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:14:21,780 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@423d388e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d35d72b [2022-04-28 10:14:21,781 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:14:21,787 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-28 10:14:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 10:14:21,791 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:21,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:21,791 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:21,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:21,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 1 times [2022-04-28 10:14:21,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:21,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1629199573] [2022-04-28 10:14:21,820 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:14:21,820 INFO L85 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 2 times [2022-04-28 10:14:21,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:21,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535466346] [2022-04-28 10:14:21,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:21,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:21,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:21,974 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-28 10:14:21,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 10:14:21,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-28 10:14:21,976 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-28 10:14:21,976 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-28 10:14:21,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 10:14:21,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-28 10:14:21,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-28 10:14:21,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 0; {24#true} is VALID [2022-04-28 10:14:21,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-28 10:14:21,978 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-28 10:14:21,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 10:14:21,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 10:14:21,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 10:14:21,979 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-28 10:14:21,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:21,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535466346] [2022-04-28 10:14:21,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535466346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:21,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:21,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:14:21,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:21,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1629199573] [2022-04-28 10:14:21,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1629199573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:21,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:21,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:14:21,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139517863] [2022-04-28 10:14:21,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:21,989 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-28 10:14:21,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:21,991 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-28 10:14:22,006 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-28 10:14:22,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:14:22,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:22,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:14:22,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:14:22,027 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-28 10:14:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,100 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-28 10:14:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:14:22,100 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-28 10:14:22,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:22,101 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-28 10:14:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-28 10:14:22,109 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-28 10:14:22,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-28 10:14:22,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-28 10:14:22,158 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-28 10:14:22,163 INFO L225 Difference]: With dead ends: 33 [2022-04-28 10:14:22,163 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 10:14:22,166 INFO L412 NwaCegarLoop]: 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-28 10:14:22,168 INFO L413 NwaCegarLoop]: 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-28 10:14:22,169 INFO L414 NwaCegarLoop]: 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-28 10:14:22,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 10:14:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 10:14:22,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:22,194 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-28 10:14:22,195 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-28 10:14:22,195 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-28 10:14:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,200 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-28 10:14:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 10:14:22,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:22,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:22,201 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-28 10:14:22,201 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-28 10:14:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,204 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-28 10:14:22,204 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 10:14:22,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:22,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:22,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:22,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:22,205 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-28 10:14:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-28 10:14:22,207 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-28 10:14:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:22,207 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-28 10:14:22,207 INFO L496 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-28 10:14:22,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-28 10:14:22,230 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-28 10:14:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 10:14:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 10:14:22,231 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:22,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:22,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:14:22,234 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:22,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:22,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 1 times [2022-04-28 10:14:22,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:22,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1728484756] [2022-04-28 10:14:22,242 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:14:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 2 times [2022-04-28 10:14:22,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:22,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812711554] [2022-04-28 10:14:22,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:22,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:22,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:22,360 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-28 10:14:22,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-28 10:14:22,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #42#return; {154#true} is VALID [2022-04-28 10:14:22,362 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-28 10:14:22,362 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-28 10:14:22,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-28 10:14:22,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #42#return; {154#true} is VALID [2022-04-28 10:14:22,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret5 := main(); {154#true} is VALID [2022-04-28 10:14:22,363 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-28 10:14:22,364 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-28 10:14:22,364 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-28 10:14:22,366 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-28 10:14:22,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {161#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {155#false} is VALID [2022-04-28 10:14:22,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-28 10:14:22,367 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-28 10:14:22,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:22,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812711554] [2022-04-28 10:14:22,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812711554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:22,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:22,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:14:22,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:22,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1728484756] [2022-04-28 10:14:22,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1728484756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:22,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:22,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:14:22,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317915167] [2022-04-28 10:14:22,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:22,372 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-28 10:14:22,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:22,372 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-28 10:14:22,382 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-28 10:14:22,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:14:22,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:22,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:14:22,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:14:22,384 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-28 10:14:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,537 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 10:14:22,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:14:22,537 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-28 10:14:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:22,538 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-28 10:14:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-28 10:14:22,539 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-28 10:14:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-28 10:14:22,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-28 10:14:22,560 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-28 10:14:22,562 INFO L225 Difference]: With dead ends: 22 [2022-04-28 10:14:22,563 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 10:14:22,563 INFO L412 NwaCegarLoop]: 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-28 10:14:22,565 INFO L413 NwaCegarLoop]: 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-28 10:14:22,566 INFO L414 NwaCegarLoop]: 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-28 10:14:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 10:14:22,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 10:14:22,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:22,573 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-28 10:14:22,573 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-28 10:14:22,574 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-28 10:14:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,575 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 10:14:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:14:22,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:22,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:22,576 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-28 10:14:22,576 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-28 10:14:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,577 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 10:14:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:14:22,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:22,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:22,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:22,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:22,578 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-28 10:14:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 10:14:22,579 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-28 10:14:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:22,579 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 10:14:22,579 INFO L496 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-28 10:14:22,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 10:14:22,595 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-28 10:14:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 10:14:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:14:22,595 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:22,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:22,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:14:22,596 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:22,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:22,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1854346422, now seen corresponding path program 1 times [2022-04-28 10:14:22,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:22,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1988323097] [2022-04-28 10:14:22,609 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:22,610 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:22,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1854346422, now seen corresponding path program 2 times [2022-04-28 10:14:22,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:22,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768135771] [2022-04-28 10:14:22,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:22,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:22,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:22,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {289#(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-28 10:14:22,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#true} assume true; {283#true} is VALID [2022-04-28 10:14:22,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {283#true} {283#true} #42#return; {283#true} is VALID [2022-04-28 10:14:22,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {283#true} call ULTIMATE.init(); {289#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:22,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {289#(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-28 10:14:22,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#true} assume true; {283#true} is VALID [2022-04-28 10:14:22,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {283#true} {283#true} #42#return; {283#true} is VALID [2022-04-28 10:14:22,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {283#true} call #t~ret5 := main(); {283#true} is VALID [2022-04-28 10:14:22,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {283#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 0; {288#(= main_~x~0 0)} is VALID [2022-04-28 10:14:22,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {288#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {288#(= main_~x~0 0)} is VALID [2022-04-28 10:14:22,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {288#(= main_~x~0 0)} assume ~x~0 % 4294967296 >= 5000000;~z~0 := 2 + ~z~0; {284#false} is VALID [2022-04-28 10:14:22,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {284#false} is VALID [2022-04-28 10:14:22,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {284#false} is VALID [2022-04-28 10:14:22,673 INFO L272 TraceCheckUtils]: 10: Hoare triple {284#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)); {284#false} is VALID [2022-04-28 10:14:22,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {284#false} ~cond := #in~cond; {284#false} is VALID [2022-04-28 10:14:22,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {284#false} assume 0 == ~cond; {284#false} is VALID [2022-04-28 10:14:22,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#false} assume !false; {284#false} is VALID [2022-04-28 10:14:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:22,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:22,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768135771] [2022-04-28 10:14:22,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768135771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:22,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:22,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:14:22,674 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:22,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1988323097] [2022-04-28 10:14:22,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1988323097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:22,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:22,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:14:22,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371479182] [2022-04-28 10:14:22,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:22,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-28 10:14:22,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:22,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-28 10:14:22,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:22,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:14:22,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:22,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:14:22,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:14:22,686 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-28 10:14:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,727 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 10:14:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:14:22,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-28 10:14:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-28 10:14:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 10:14:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-28 10:14:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 10:14:22,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-28 10:14:22,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:22,751 INFO L225 Difference]: With dead ends: 28 [2022-04-28 10:14:22,751 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 10:14:22,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:14:22,752 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:22,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:14:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 10:14:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-28 10:14:22,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:22,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:22,756 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:22,756 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,757 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 10:14:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 10:14:22,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:22,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:22,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:14:22,758 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 10:14:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,759 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 10:14:22,759 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 10:14:22,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:22,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:22,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:22,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:14:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 10:14:22,761 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2022-04-28 10:14:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:22,761 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 10:14:22,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-28 10:14:22,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 10:14:22,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 10:14:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:14:22,779 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:22,779 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:22,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 10:14:22,779 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:22,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:22,779 INFO L85 PathProgramCache]: Analyzing trace with hash 309814626, now seen corresponding path program 1 times [2022-04-28 10:14:22,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:22,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [688942793] [2022-04-28 10:14:22,787 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:22,787 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:22,787 INFO L85 PathProgramCache]: Analyzing trace with hash 309814626, now seen corresponding path program 2 times [2022-04-28 10:14:22,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:22,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747088483] [2022-04-28 10:14:22,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:22,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:22,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {435#(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); {428#true} is VALID [2022-04-28 10:14:22,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 10:14:22,855 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {428#true} {428#true} #42#return; {428#true} is VALID [2022-04-28 10:14:22,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:22,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#(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); {428#true} is VALID [2022-04-28 10:14:22,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 10:14:22,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #42#return; {428#true} is VALID [2022-04-28 10:14:22,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret5 := main(); {428#true} is VALID [2022-04-28 10:14:22,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 0; {433#(= main_~x~0 0)} is VALID [2022-04-28 10:14:22,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {433#(= main_~x~0 0)} is VALID [2022-04-28 10:14:22,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {433#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {433#(= main_~x~0 0)} is VALID [2022-04-28 10:14:22,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {433#(= main_~x~0 0)} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {434#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:14:22,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {434#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 10:14:22,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {434#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume ~x~0 % 4294967296 >= 5000000;~z~0 := 2 + ~z~0; {429#false} is VALID [2022-04-28 10:14:22,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {429#false} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {429#false} is VALID [2022-04-28 10:14:22,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {429#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {429#false} is VALID [2022-04-28 10:14:22,859 INFO L272 TraceCheckUtils]: 13: Hoare triple {429#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)); {429#false} is VALID [2022-04-28 10:14:22,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-28 10:14:22,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-28 10:14:22,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-28 10:14:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:22,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:22,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747088483] [2022-04-28 10:14:22,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747088483] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:22,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895136039] [2022-04-28 10:14:22,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:22,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:22,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:22,862 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:22,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 10:14:22,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:22,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:22,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:14:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:22,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:23,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-28 10:14:23,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-28 10:14:23,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 10:14:23,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #42#return; {428#true} is VALID [2022-04-28 10:14:23,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret5 := main(); {428#true} is VALID [2022-04-28 10:14:23,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 0; {454#(= main_~z~0 0)} is VALID [2022-04-28 10:14:23,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {454#(= main_~z~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {454#(= main_~z~0 0)} is VALID [2022-04-28 10:14:23,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {454#(= main_~z~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {454#(= main_~z~0 0)} is VALID [2022-04-28 10:14:23,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {454#(= main_~z~0 0)} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {454#(= main_~z~0 0)} is VALID [2022-04-28 10:14:23,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {454#(= main_~z~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {454#(= main_~z~0 0)} is VALID [2022-04-28 10:14:23,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {454#(= main_~z~0 0)} assume ~x~0 % 4294967296 >= 5000000;~z~0 := 2 + ~z~0; {470#(= main_~z~0 2)} is VALID [2022-04-28 10:14:23,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {470#(= main_~z~0 2)} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {470#(= main_~z~0 2)} is VALID [2022-04-28 10:14:23,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {470#(= main_~z~0 2)} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {470#(= main_~z~0 2)} is VALID [2022-04-28 10:14:23,016 INFO L272 TraceCheckUtils]: 13: Hoare triple {470#(= main_~z~0 2)} 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)); {480#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:23,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {480#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {484#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:23,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {484#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {429#false} is VALID [2022-04-28 10:14:23,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-28 10:14:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:14:23,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:23,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-28 10:14:23,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {484#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {429#false} is VALID [2022-04-28 10:14:23,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {480#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {484#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:14:23,110 INFO L272 TraceCheckUtils]: 13: Hoare triple {500#(= (mod main_~z~0 2) 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)); {480#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:14:23,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {500#(= (mod main_~z~0 2) 0)} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {500#(= (mod main_~z~0 2) 0)} is VALID [2022-04-28 10:14:23,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {500#(= (mod main_~z~0 2) 0)} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {500#(= (mod main_~z~0 2) 0)} is VALID [2022-04-28 10:14:23,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {500#(= (mod main_~z~0 2) 0)} assume ~x~0 % 4294967296 >= 5000000;~z~0 := 2 + ~z~0; {500#(= (mod main_~z~0 2) 0)} is VALID [2022-04-28 10:14:23,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {500#(= (mod main_~z~0 2) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {500#(= (mod main_~z~0 2) 0)} is VALID [2022-04-28 10:14:23,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {500#(= (mod main_~z~0 2) 0)} #t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {500#(= (mod main_~z~0 2) 0)} is VALID [2022-04-28 10:14:23,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {500#(= (mod main_~z~0 2) 0)} assume !(~x~0 % 4294967296 >= 5000000); {500#(= (mod main_~z~0 2) 0)} is VALID [2022-04-28 10:14:23,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {500#(= (mod main_~z~0 2) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {500#(= (mod main_~z~0 2) 0)} is VALID [2022-04-28 10:14:23,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 0; {500#(= (mod main_~z~0 2) 0)} is VALID [2022-04-28 10:14:23,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret5 := main(); {428#true} is VALID [2022-04-28 10:14:23,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #42#return; {428#true} is VALID [2022-04-28 10:14:23,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 10:14:23,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-28 10:14:23,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-28 10:14:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 10:14:23,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895136039] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:23,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:14:23,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 10 [2022-04-28 10:14:23,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:23,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [688942793] [2022-04-28 10:14:23,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [688942793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:23,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:23,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:14:23,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847606762] [2022-04-28 10:14:23,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:23,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-28 10:14:23,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:23,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-28 10:14:23,127 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-28 10:14:23,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:14:23,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:23,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:14:23,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:14:23,128 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-28 10:14:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:23,162 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 10:14:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:14:23,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-28 10:14:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-28 10:14:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-04-28 10:14:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-28 10:14:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-04-28 10:14:23,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 15 transitions. [2022-04-28 10:14:23,174 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-28 10:14:23,174 INFO L225 Difference]: With dead ends: 19 [2022-04-28 10:14:23,174 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:14:23,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:14:23,175 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:23,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 36 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:14:23,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:14:23,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:14:23,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:23,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:14:23,176 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:14:23,176 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:14:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:23,176 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:14:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:14:23,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:23,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:23,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:14:23,177 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:14:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:23,177 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:14:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:14:23,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:23,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:23,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:23,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:14:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:14:23,178 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-28 10:14:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:23,178 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:14:23,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-28 10:14:23,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:14:23,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:14:23,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:23,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:14:23,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:23,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:23,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:14:23,496 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 10:14:23,497 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 10:14:23,497 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 10:14:23,497 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:14:23,497 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 10:14:23,497 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:14:23,497 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:14:23,497 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 10:14:23,497 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:14:23,497 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:14:23,497 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 17) the Hoare annotation is: true [2022-04-28 10:14:23,497 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 6 17) the Hoare annotation is: true [2022-04-28 10:14:23,497 INFO L902 garLoopResultBuilder]: At program point L15(line 15) the Hoare annotation is: true [2022-04-28 10:14:23,498 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 6 17) the Hoare annotation is: true [2022-04-28 10:14:23,498 INFO L895 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (= (mod main_~z~0 2) 0) [2022-04-28 10:14:23,498 INFO L895 garLoopResultBuilder]: At program point L11-2(lines 11 12) the Hoare annotation is: (= (mod main_~z~0 2) 0) [2022-04-28 10:14:23,498 INFO L895 garLoopResultBuilder]: At program point L10-2(lines 10 14) the Hoare annotation is: (= (mod main_~z~0 2) 0) [2022-04-28 10:14:23,498 INFO L895 garLoopResultBuilder]: At program point L10-3(lines 10 14) the Hoare annotation is: (= (mod main_~z~0 2) 0) [2022-04-28 10:14:23,498 INFO L902 garLoopResultBuilder]: At program point L4-3(line 4) the Hoare annotation is: true [2022-04-28 10:14:23,498 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2022-04-28 10:14:23,498 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(line 4) the Hoare annotation is: true [2022-04-28 10:14:23,498 INFO L895 garLoopResultBuilder]: At program point L4(line 4) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 10:14:23,498 INFO L895 garLoopResultBuilder]: At program point L4-1(line 4) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:14:23,498 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:14:23,501 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2] [2022-04-28 10:14:23,503 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:14:23,508 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:14:23,510 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:14:23,514 INFO L163 areAnnotationChecker]: CFG has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:14:23,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:14:23 BoogieIcfgContainer [2022-04-28 10:14:23,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:14:23,524 INFO L158 Benchmark]: Toolchain (without parser) took 2267.76ms. Allocated memory was 212.9MB in the beginning and 255.9MB in the end (delta: 43.0MB). Free memory was 189.3MB in the beginning and 152.0MB in the end (delta: 37.3MB). Peak memory consumption was 79.1MB. Max. memory is 8.0GB. [2022-04-28 10:14:23,524 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 212.9MB. Free memory is still 176.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:14:23,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.13ms. Allocated memory is still 212.9MB. Free memory was 189.1MB in the beginning and 188.2MB in the end (delta: 873.3kB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-04-28 10:14:23,524 INFO L158 Benchmark]: Boogie Preprocessor took 26.47ms. Allocated memory is still 212.9MB. Free memory was 188.2MB in the beginning and 186.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 10:14:23,524 INFO L158 Benchmark]: RCFGBuilder took 217.57ms. Allocated memory is still 212.9MB. Free memory was 186.7MB in the beginning and 176.5MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 10:14:23,524 INFO L158 Benchmark]: TraceAbstraction took 1854.90ms. Allocated memory was 212.9MB in the beginning and 255.9MB in the end (delta: 43.0MB). Free memory was 176.0MB in the beginning and 152.0MB in the end (delta: 24.0MB). Peak memory consumption was 67.0MB. Max. memory is 8.0GB. [2022-04-28 10:14:23,525 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.12ms. Allocated memory is still 212.9MB. Free memory is still 176.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 164.13ms. Allocated memory is still 212.9MB. Free memory was 189.1MB in the beginning and 188.2MB in the end (delta: 873.3kB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.47ms. Allocated memory is still 212.9MB. Free memory was 188.2MB in the beginning and 186.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 217.57ms. Allocated memory is still 212.9MB. Free memory was 186.7MB in the beginning and 176.5MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1854.90ms. Allocated memory was 212.9MB in the beginning and 255.9MB in the end (delta: 43.0MB). Free memory was 176.0MB in the beginning and 152.0MB in the end (delta: 24.0MB). Peak memory consumption was 67.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 58 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 39 PreInvPairs, 60 NumberOfFragments, 63 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 85 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: z % 2 == 0 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 10:14:23,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...