./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2e7bc86c416f082f6cbd3468de78760603e8d7fefbcdca8dd6e4ac6b460db48 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:20:36,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:20:36,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:20:36,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:20:36,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:20:36,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:20:36,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:20:36,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:20:36,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:20:36,646 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:20:36,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:20:36,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:20:36,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:20:36,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:20:36,655 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:20:36,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:20:36,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:20:36,656 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:20:36,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:20:36,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:20:36,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:20:36,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:20:36,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:20:36,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:20:36,662 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:20:36,663 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:20:36,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:20:36,663 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:20:36,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:20:36,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:20:36,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:20:36,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:20:36,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:20:36,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:20:36,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:20:36,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:20:36,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:20:36,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:20:36,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:20:36,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:20:36,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:20:36,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:20:36,675 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2e7bc86c416f082f6cbd3468de78760603e8d7fefbcdca8dd6e4ac6b460db48 [2024-10-13 04:20:37,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:20:37,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:20:37,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:20:37,076 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:20:37,077 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:20:37,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i [2024-10-13 04:20:38,400 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:20:38,664 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:20:38,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i [2024-10-13 04:20:38,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afd3e6f64/c383f1b16dbd46749feced68497bd8bf/FLAGa5d9a4510 [2024-10-13 04:20:39,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afd3e6f64/c383f1b16dbd46749feced68497bd8bf [2024-10-13 04:20:39,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:20:39,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:20:39,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:20:39,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:20:39,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:20:39,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:20:39" (1/1) ... [2024-10-13 04:20:39,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70d76db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:39, skipping insertion in model container [2024-10-13 04:20:39,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:20:39" (1/1) ... [2024-10-13 04:20:39,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:20:39,281 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i[915,928] [2024-10-13 04:20:39,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:20:39,346 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:20:39,358 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i[915,928] [2024-10-13 04:20:39,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:20:39,386 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:20:39,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:39 WrapperNode [2024-10-13 04:20:39,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:20:39,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:20:39,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:20:39,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:20:39,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:39" (1/1) ... [2024-10-13 04:20:39,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:39" (1/1) ... [2024-10-13 04:20:39,419 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-10-13 04:20:39,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:20:39,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:20:39,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:20:39,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:20:39,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:39" (1/1) ... [2024-10-13 04:20:39,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:39" (1/1) ... [2024-10-13 04:20:39,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:39" (1/1) ... [2024-10-13 04:20:39,449 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:20:39,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:39" (1/1) ... [2024-10-13 04:20:39,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:39" (1/1) ... [2024-10-13 04:20:39,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:39" (1/1) ... [2024-10-13 04:20:39,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:39" (1/1) ... [2024-10-13 04:20:39,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:39" (1/1) ... [2024-10-13 04:20:39,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:39" (1/1) ... [2024-10-13 04:20:39,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:20:39,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:20:39,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:20:39,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:20:39,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:39" (1/1) ... [2024-10-13 04:20:39,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:20:39,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:20:39,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:20:39,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:20:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:20:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:20:39,520 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:20:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:20:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:20:39,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:20:39,618 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:20:39,620 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:20:39,872 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 04:20:39,873 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:20:39,959 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:20:39,959 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:20:39,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:20:39 BoogieIcfgContainer [2024-10-13 04:20:39,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:20:39,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:20:39,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:20:39,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:20:39,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:20:39" (1/3) ... [2024-10-13 04:20:39,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37dae590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:20:39, skipping insertion in model container [2024-10-13 04:20:39,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:39" (2/3) ... [2024-10-13 04:20:39,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37dae590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:20:39, skipping insertion in model container [2024-10-13 04:20:39,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:20:39" (3/3) ... [2024-10-13 04:20:39,982 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-59.i [2024-10-13 04:20:40,008 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:20:40,008 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:20:40,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:20:40,107 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@28c0edfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:20:40,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:20:40,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 04:20:40,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 04:20:40,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:20:40,137 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:20:40,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:20:40,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:20:40,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1817537960, now seen corresponding path program 1 times [2024-10-13 04:20:40,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:20:40,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109531038] [2024-10-13 04:20:40,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:20:40,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:20:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:20:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:20:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:20:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:20:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:20:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:20:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:20:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:20:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:20:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:20:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:20:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:20:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:20:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:20:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:20:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:20:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:20:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:20:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 04:20:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 04:20:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 04:20:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:20:40,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:20:40,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109531038] [2024-10-13 04:20:40,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109531038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:20:40,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:20:40,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:20:40,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322645517] [2024-10-13 04:20:40,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:20:40,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:20:40,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:20:40,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:20:40,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:20:40,950 INFO L87 Difference]: Start difference. First operand has 54 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:20:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:20:41,028 INFO L93 Difference]: Finished difference Result 105 states and 183 transitions. [2024-10-13 04:20:41,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:20:41,032 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 128 [2024-10-13 04:20:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:20:41,041 INFO L225 Difference]: With dead ends: 105 [2024-10-13 04:20:41,042 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 04:20:41,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:20:41,051 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:20:41,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:20:41,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 04:20:41,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 04:20:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 04:20:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-10-13 04:20:41,095 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 128 [2024-10-13 04:20:41,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:20:41,096 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-10-13 04:20:41,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:20:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-10-13 04:20:41,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 04:20:41,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:20:41,100 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:20:41,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:20:41,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:20:41,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:20:41,101 INFO L85 PathProgramCache]: Analyzing trace with hash 208803318, now seen corresponding path program 1 times [2024-10-13 04:20:41,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:20:41,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512543687] [2024-10-13 04:20:41,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:20:41,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:20:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:20:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:20:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:20:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:20:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:20:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:20:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:20:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:20:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:20:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:20:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:20:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:20:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:20:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:20:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:20:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:20:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:20:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:20:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 04:20:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 04:20:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 04:20:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:20:41,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:20:41,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512543687] [2024-10-13 04:20:41,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512543687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:20:41,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:20:41,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:20:41,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395599613] [2024-10-13 04:20:41,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:20:41,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:20:41,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:20:41,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:20:41,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:20:41,494 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:20:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:20:41,523 INFO L93 Difference]: Finished difference Result 103 states and 151 transitions. [2024-10-13 04:20:41,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:20:41,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 128 [2024-10-13 04:20:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:20:41,524 INFO L225 Difference]: With dead ends: 103 [2024-10-13 04:20:41,524 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 04:20:41,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:20:41,526 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:20:41,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:20:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 04:20:41,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 04:20:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 04:20:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-10-13 04:20:41,541 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 128 [2024-10-13 04:20:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:20:41,542 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-10-13 04:20:41,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:20:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-10-13 04:20:41,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 04:20:41,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:20:41,545 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:20:41,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:20:41,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:20:41,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:20:41,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2126795466, now seen corresponding path program 1 times [2024-10-13 04:20:41,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:20:41,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455935778] [2024-10-13 04:20:41,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:20:41,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:20:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:20:41,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:20:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:20:41,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:20:41,805 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:20:41,806 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:20:41,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:20:41,810 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 04:20:41,892 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:20:41,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:20:41 BoogieIcfgContainer [2024-10-13 04:20:41,895 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:20:41,895 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:20:41,895 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:20:41,896 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:20:41,896 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:20:39" (3/4) ... [2024-10-13 04:20:41,898 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:20:41,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:20:41,899 INFO L158 Benchmark]: Toolchain (without parser) took 2894.79ms. Allocated memory was 140.5MB in the beginning and 213.9MB in the end (delta: 73.4MB). Free memory was 71.2MB in the beginning and 153.7MB in the end (delta: -82.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:20:41,899 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 140.5MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:20:41,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.93ms. Allocated memory is still 140.5MB. Free memory was 71.1MB in the beginning and 105.0MB in the end (delta: -33.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-10-13 04:20:41,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.75ms. Allocated memory is still 140.5MB. Free memory was 105.0MB in the beginning and 102.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:20:41,901 INFO L158 Benchmark]: Boogie Preprocessor took 38.39ms. Allocated memory is still 140.5MB. Free memory was 102.5MB in the beginning and 100.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:20:41,901 INFO L158 Benchmark]: RCFGBuilder took 500.95ms. Allocated memory is still 140.5MB. Free memory was 100.5MB in the beginning and 81.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 04:20:41,901 INFO L158 Benchmark]: TraceAbstraction took 1927.22ms. Allocated memory was 140.5MB in the beginning and 213.9MB in the end (delta: 73.4MB). Free memory was 80.8MB in the beginning and 153.7MB in the end (delta: -72.9MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. [2024-10-13 04:20:41,902 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 213.9MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:20:41,903 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 140.5MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.93ms. Allocated memory is still 140.5MB. Free memory was 71.1MB in the beginning and 105.0MB in the end (delta: -33.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.75ms. Allocated memory is still 140.5MB. Free memory was 105.0MB in the beginning and 102.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.39ms. Allocated memory is still 140.5MB. Free memory was 102.5MB in the beginning and 100.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 500.95ms. Allocated memory is still 140.5MB. Free memory was 100.5MB in the beginning and 81.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1927.22ms. Allocated memory was 140.5MB in the beginning and 213.9MB in the end (delta: 73.4MB). Free memory was 80.8MB in the beginning and 153.7MB in the end (delta: -72.9MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 213.9MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryArithmeticFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -128; [L23] signed long int var_1_4 = -32; [L24] signed long int var_1_5 = 10; [L25] signed long int var_1_6 = -1; [L26] unsigned long int var_1_7 = 25; [L27] unsigned char var_1_8 = 1; [L28] unsigned long int var_1_9 = 2; [L29] unsigned long int var_1_10 = 32; [L30] unsigned long int var_1_11 = 128; [L31] float var_1_12 = 24.2; [L32] double var_1_13 = 999999999999999.2; [L33] double var_1_14 = 9999999.6; [L34] double var_1_15 = 9.75; [L35] float var_1_16 = 999999999999999.4; [L36] float var_1_17 = 256.6; [L37] float var_1_18 = 8.875; [L38] float var_1_19 = 256.25; [L39] signed long int last_1_var_1_1 = -128; [L40] unsigned long int last_1_var_1_7 = 25; [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] CALL updateLastVariables() [L107] last_1_var_1_1 = var_1_1 [L108] last_1_var_1_7 = var_1_7 [L118] RET updateLastVariables() [L119] CALL updateVariables() [L70] var_1_4 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_4 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L71] RET assume_abort_if_not(var_1_4 >= -536870911) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L72] CALL assume_abort_if_not(var_1_4 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L72] RET assume_abort_if_not(var_1_4 <= 536870912) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L73] var_1_5 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_5 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L74] RET assume_abort_if_not(var_1_5 >= -536870911) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L75] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L75] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L76] var_1_6 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_6 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=2] [L77] RET assume_abort_if_not(var_1_6 >= -1073741823) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=2] [L78] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=2] [L78] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=2] [L79] var_1_8 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_9=2] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_9=2] [L81] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=2] [L81] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=2] [L82] var_1_9 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0] [L83] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0] [L84] CALL assume_abort_if_not(var_1_9 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_9 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L85] var_1_10 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L86] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L88] var_1_11 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L91] var_1_13 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L93] var_1_14 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L95] var_1_15 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L97] var_1_16 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L99] var_1_17 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L101] var_1_18 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L103] var_1_19 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L104] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L119] RET updateVariables() [L120] CALL step() [L44] COND TRUE ((((last_1_var_1_7) > (1)) ? (last_1_var_1_7) : (1))) <= (256 + last_1_var_1_1) [L45] var_1_1 = ((var_1_4 + var_1_5) + var_1_6) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_1=0, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L49] COND FALSE !(\read(var_1_8)) [L56] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_1=0, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L58] unsigned long int stepLocal_0 = var_1_7; VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_1=0, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L59] COND TRUE var_1_7 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_1=0, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L60] COND TRUE (var_1_13 - var_1_14) == var_1_15 [L61] var_1_12 = ((((var_1_16) > (((var_1_17 + var_1_18) - var_1_19))) ? (var_1_16) : (((var_1_17 + var_1_18) - var_1_19)))) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L120] RET step() [L121] CALL, EXPR property() [L111-L112] return (((((((last_1_var_1_7) > (1)) ? (last_1_var_1_7) : (1))) <= (256 + last_1_var_1_1)) ? (var_1_1 == ((signed long int) ((var_1_4 + var_1_5) + var_1_6))) : (var_1_1 == ((signed long int) var_1_6))) && (var_1_8 ? ((var_1_1 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_9) > (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) ? (var_1_9) : (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))))) : (var_1_7 == ((unsigned long int) var_1_10))) : (var_1_7 == ((unsigned long int) var_1_11)))) && ((var_1_7 <= var_1_7) ? (((var_1_13 - var_1_14) == var_1_15) ? (var_1_12 == ((float) ((((var_1_16) > (((var_1_17 + var_1_18) - var_1_19))) ? (var_1_16) : (((var_1_17 + var_1_18) - var_1_19)))))) : (var_1_12 == ((float) var_1_19))) : (var_1_12 == ((float) var_1_16))) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 211 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 144 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 385 NumberOfCodeBlocks, 385 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1680/1680 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 04:20:41,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2e7bc86c416f082f6cbd3468de78760603e8d7fefbcdca8dd6e4ac6b460db48 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:20:43,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:20:44,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:20:44,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:20:44,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:20:44,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:20:44,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:20:44,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:20:44,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:20:44,057 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:20:44,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:20:44,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:20:44,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:20:44,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:20:44,058 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:20:44,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:20:44,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:20:44,060 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:20:44,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:20:44,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:20:44,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:20:44,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:20:44,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:20:44,062 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:20:44,062 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:20:44,062 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:20:44,063 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:20:44,063 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:20:44,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:20:44,063 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:20:44,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:20:44,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:20:44,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:20:44,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:20:44,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:20:44,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:20:44,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:20:44,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:20:44,065 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:20:44,065 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:20:44,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:20:44,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:20:44,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:20:44,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:20:44,067 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:20:44,067 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2e7bc86c416f082f6cbd3468de78760603e8d7fefbcdca8dd6e4ac6b460db48 [2024-10-13 04:20:44,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:20:44,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:20:44,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:20:44,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:20:44,356 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:20:44,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i [2024-10-13 04:20:45,996 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:20:46,228 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:20:46,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i [2024-10-13 04:20:46,237 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a1be12e9/68fb2aacf94f4334985dceec423685b7/FLAG36e23499b [2024-10-13 04:20:46,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a1be12e9/68fb2aacf94f4334985dceec423685b7 [2024-10-13 04:20:46,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:20:46,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:20:46,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:20:46,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:20:46,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:20:46,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:20:46" (1/1) ... [2024-10-13 04:20:46,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29261dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:46, skipping insertion in model container [2024-10-13 04:20:46,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:20:46" (1/1) ... [2024-10-13 04:20:46,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:20:46,442 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i[915,928] [2024-10-13 04:20:46,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:20:46,508 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:20:46,518 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i[915,928] [2024-10-13 04:20:46,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:20:46,558 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:20:46,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:46 WrapperNode [2024-10-13 04:20:46,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:20:46,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:20:46,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:20:46,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:20:46,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:46" (1/1) ... [2024-10-13 04:20:46,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:46" (1/1) ... [2024-10-13 04:20:46,597 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-10-13 04:20:46,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:20:46,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:20:46,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:20:46,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:20:46,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:46" (1/1) ... [2024-10-13 04:20:46,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:46" (1/1) ... [2024-10-13 04:20:46,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:46" (1/1) ... [2024-10-13 04:20:46,645 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:20:46,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:46" (1/1) ... [2024-10-13 04:20:46,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:46" (1/1) ... [2024-10-13 04:20:46,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:46" (1/1) ... [2024-10-13 04:20:46,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:46" (1/1) ... [2024-10-13 04:20:46,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:46" (1/1) ... [2024-10-13 04:20:46,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:46" (1/1) ... [2024-10-13 04:20:46,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:20:46,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:20:46,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:20:46,671 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:20:46,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:46" (1/1) ... [2024-10-13 04:20:46,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:20:46,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:20:46,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:20:46,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:20:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:20:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:20:46,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:20:46,758 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:20:46,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:20:46,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:20:46,847 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:20:46,848 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:20:48,170 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 04:20:48,171 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:20:48,207 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:20:48,208 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:20:48,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:20:48 BoogieIcfgContainer [2024-10-13 04:20:48,208 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:20:48,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:20:48,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:20:48,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:20:48,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:20:46" (1/3) ... [2024-10-13 04:20:48,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2669b6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:20:48, skipping insertion in model container [2024-10-13 04:20:48,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:20:46" (2/3) ... [2024-10-13 04:20:48,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2669b6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:20:48, skipping insertion in model container [2024-10-13 04:20:48,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:20:48" (3/3) ... [2024-10-13 04:20:48,214 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-59.i [2024-10-13 04:20:48,227 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:20:48,227 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:20:48,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:20:48,304 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3c314e58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:20:48,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:20:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 04:20:48,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 04:20:48,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:20:48,325 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:20:48,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:20:48,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:20:48,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1817537960, now seen corresponding path program 1 times [2024-10-13 04:20:48,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:20:48,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605287859] [2024-10-13 04:20:48,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:20:48,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:20:48,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:20:48,375 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:20:48,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 04:20:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:48,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:20:48,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:20:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-10-13 04:20:48,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:20:48,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:20:48,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605287859] [2024-10-13 04:20:48,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605287859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:20:48,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:20:48,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:20:48,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906252840] [2024-10-13 04:20:48,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:20:48,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:20:48,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:20:48,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:20:48,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:20:48,815 INFO L87 Difference]: Start difference. First operand has 54 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:20:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:20:49,648 INFO L93 Difference]: Finished difference Result 105 states and 183 transitions. [2024-10-13 04:20:49,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:20:49,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 128 [2024-10-13 04:20:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:20:49,670 INFO L225 Difference]: With dead ends: 105 [2024-10-13 04:20:49,670 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 04:20:49,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:20:49,675 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 04:20:49,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 04:20:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 04:20:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 04:20:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 04:20:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-10-13 04:20:49,712 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 128 [2024-10-13 04:20:49,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:20:49,713 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-10-13 04:20:49,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 04:20:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-10-13 04:20:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 04:20:49,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:20:49,715 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:20:49,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 04:20:49,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:20:49,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:20:49,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:20:49,922 INFO L85 PathProgramCache]: Analyzing trace with hash 208803318, now seen corresponding path program 1 times [2024-10-13 04:20:49,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:20:49,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136579939] [2024-10-13 04:20:49,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:20:49,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:20:49,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:20:49,930 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:20:49,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 04:20:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:50,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 04:20:50,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:20:50,387 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 04:20:50,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:20:50,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:20:50,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136579939] [2024-10-13 04:20:50,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136579939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:20:50,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:20:50,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:20:50,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553738654] [2024-10-13 04:20:50,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:20:50,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:20:50,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:20:50,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:20:50,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:20:50,395 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:20:51,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:20:51,216 INFO L93 Difference]: Finished difference Result 103 states and 151 transitions. [2024-10-13 04:20:51,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:20:51,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 128 [2024-10-13 04:20:51,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:20:51,237 INFO L225 Difference]: With dead ends: 103 [2024-10-13 04:20:51,237 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 04:20:51,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:20:51,243 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 04:20:51,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 04:20:51,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 04:20:51,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 04:20:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 04:20:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-10-13 04:20:51,258 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 128 [2024-10-13 04:20:51,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:20:51,260 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-10-13 04:20:51,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 04:20:51,261 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-10-13 04:20:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 04:20:51,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:20:51,263 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:20:51,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 04:20:51,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:20:51,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:20:51,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:20:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2126795466, now seen corresponding path program 1 times [2024-10-13 04:20:51,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:20:51,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42357379] [2024-10-13 04:20:51,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:20:51,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:20:51,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:20:51,468 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:20:51,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 04:20:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:20:51,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 04:20:51,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:21:48,108 WARN L286 SmtUtils]: Spent 18.75s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)