./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-98.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 2802349e46e266d85129b1d5ad794eecec89b089e4c78c88709459d2378a7a91 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:20:15,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:20:15,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:20:15,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:20:15,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:20:15,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:20:15,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:20:15,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:20:15,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:20:15,760 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:20:15,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:20:15,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:20:15,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:20:15,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:20:15,763 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:20:15,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:20:15,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:20:15,766 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:20:15,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:20:15,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:20:15,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:20:15,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:20:15,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:20:15,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:20:15,768 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:20:15,768 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:20:15,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:20:15,769 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:20:15,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:20:15,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:20:15,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:20:15,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:20:15,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:20:15,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:20:15,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:20:15,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:20:15,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:20:15,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:20:15,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:20:15,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:20:15,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:20:15,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:20:15,775 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 -> 2802349e46e266d85129b1d5ad794eecec89b089e4c78c88709459d2378a7a91 [2024-11-19 00:20:16,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:20:16,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:20:16,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:20:16,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:20:16,029 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:20:16,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-98.i [2024-11-19 00:20:17,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:20:17,656 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:20:17,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-98.i [2024-11-19 00:20:17,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d27d9afb5/aa3da3c78d4a4bf48e3d4473ad9d43d1/FLAG317437a26 [2024-11-19 00:20:18,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d27d9afb5/aa3da3c78d4a4bf48e3d4473ad9d43d1 [2024-11-19 00:20:18,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:20:18,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:20:18,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:20:18,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:20:18,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:20:18,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:20:18" (1/1) ... [2024-11-19 00:20:18,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28bf5ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:18, skipping insertion in model container [2024-11-19 00:20:18,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:20:18" (1/1) ... [2024-11-19 00:20:18,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:20:18,280 WARN L250 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_operatoramount_amount50_file-98.i[915,928] [2024-11-19 00:20:18,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:20:18,356 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:20:18,366 WARN L250 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_operatoramount_amount50_file-98.i[915,928] [2024-11-19 00:20:18,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:20:18,416 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:20:18,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:18 WrapperNode [2024-11-19 00:20:18,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:20:18,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:20:18,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:20:18,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:20:18,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:18" (1/1) ... [2024-11-19 00:20:18,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:18" (1/1) ... [2024-11-19 00:20:18,470 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-11-19 00:20:18,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:20:18,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:20:18,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:20:18,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:20:18,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:18" (1/1) ... [2024-11-19 00:20:18,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:18" (1/1) ... [2024-11-19 00:20:18,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:18" (1/1) ... [2024-11-19 00:20:18,514 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-11-19 00:20:18,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:18" (1/1) ... [2024-11-19 00:20:18,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:18" (1/1) ... [2024-11-19 00:20:18,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:18" (1/1) ... [2024-11-19 00:20:18,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:18" (1/1) ... [2024-11-19 00:20:18,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:18" (1/1) ... [2024-11-19 00:20:18,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:18" (1/1) ... [2024-11-19 00:20:18,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:20:18,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:20:18,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:20:18,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:20:18,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:18" (1/1) ... [2024-11-19 00:20:18,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:20:18,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:20:18,581 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-11-19 00:20:18,588 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-11-19 00:20:18,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:20:18,632 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:20:18,633 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:20:18,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:20:18,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:20:18,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:20:18,719 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:20:18,722 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:20:19,161 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-19 00:20:19,161 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:20:19,182 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:20:19,182 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:20:19,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:20:19 BoogieIcfgContainer [2024-11-19 00:20:19,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:20:19,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:20:19,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:20:19,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:20:19,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:20:18" (1/3) ... [2024-11-19 00:20:19,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4370c6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:20:19, skipping insertion in model container [2024-11-19 00:20:19,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:18" (2/3) ... [2024-11-19 00:20:19,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4370c6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:20:19, skipping insertion in model container [2024-11-19 00:20:19,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:20:19" (3/3) ... [2024-11-19 00:20:19,194 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-98.i [2024-11-19 00:20:19,210 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:20:19,210 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:20:19,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:20:19,284 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;@380e72c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:20:19,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:20:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:20:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 00:20:19,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:20:19,302 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:20:19,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:20:19,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:20:19,307 INFO L85 PathProgramCache]: Analyzing trace with hash -913479411, now seen corresponding path program 1 times [2024-11-19 00:20:19,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:20:19,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620127693] [2024-11-19 00:20:19,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:20:19,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:20:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:20:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 00:20:22,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:20:22,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620127693] [2024-11-19 00:20:22,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620127693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:20:22,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:20:22,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:20:22,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37146584] [2024-11-19 00:20:22,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:20:22,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:20:22,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:20:23,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:20:23,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:20:23,016 INFO L87 Difference]: Start difference. First operand has 74 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 00:20:23,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:20:23,574 INFO L93 Difference]: Finished difference Result 287 states and 539 transitions. [2024-11-19 00:20:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:20:23,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-11-19 00:20:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:20:23,589 INFO L225 Difference]: With dead ends: 287 [2024-11-19 00:20:23,589 INFO L226 Difference]: Without dead ends: 216 [2024-11-19 00:20:23,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:20:23,602 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 242 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:20:23,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 398 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:20:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-19 00:20:23,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 123. [2024-11-19 00:20:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 77 states have internal predecessors, (98), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-19 00:20:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 186 transitions. [2024-11-19 00:20:23,696 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 186 transitions. Word has length 153 [2024-11-19 00:20:23,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:20:23,697 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 186 transitions. [2024-11-19 00:20:23,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 00:20:23,698 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 186 transitions. [2024-11-19 00:20:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 00:20:23,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:20:23,702 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:20:23,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 00:20:23,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:20:23,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:20:23,704 INFO L85 PathProgramCache]: Analyzing trace with hash 861527951, now seen corresponding path program 1 times [2024-11-19 00:20:23,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:20:23,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928879960] [2024-11-19 00:20:23,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:20:23,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:20:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 00:21:06,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:21:06,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928879960] [2024-11-19 00:21:06,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928879960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:21:06,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:21:06,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 00:21:06,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870264104] [2024-11-19 00:21:06,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:21:06,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 00:21:06,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:21:06,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 00:21:06,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:21:06,286 INFO L87 Difference]: Start difference. First operand 123 states and 186 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 00:21:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:21:07,181 INFO L93 Difference]: Finished difference Result 140 states and 205 transitions. [2024-11-19 00:21:07,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 00:21:07,182 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-11-19 00:21:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:21:07,186 INFO L225 Difference]: With dead ends: 140 [2024-11-19 00:21:07,186 INFO L226 Difference]: Without dead ends: 138 [2024-11-19 00:21:07,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:21:07,190 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 202 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:21:07,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 322 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:21:07,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-19 00:21:07,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 131. [2024-11-19 00:21:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-19 00:21:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 196 transitions. [2024-11-19 00:21:07,212 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 196 transitions. Word has length 153 [2024-11-19 00:21:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:21:07,213 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 196 transitions. [2024-11-19 00:21:07,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 00:21:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 196 transitions. [2024-11-19 00:21:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-19 00:21:07,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:07,216 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:21:07,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:21:07,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:07,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:07,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1858465799, now seen corresponding path program 1 times [2024-11-19 00:21:07,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:21:07,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718057211] [2024-11-19 00:21:07,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:07,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:21:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:21:07,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [297002183] [2024-11-19 00:21:07,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:07,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:21:07,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:21:07,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:21:07,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:21:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:21:07,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:21:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:21:07,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:21:07,865 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:21:07,866 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:21:07,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:21:08,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:21:08,073 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 00:21:08,182 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:21:08,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:21:08 BoogieIcfgContainer [2024-11-19 00:21:08,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:21:08,187 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:21:08,187 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:21:08,187 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:21:08,188 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:20:19" (3/4) ... [2024-11-19 00:21:08,191 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:21:08,192 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:21:08,193 INFO L158 Benchmark]: Toolchain (without parser) took 50146.72ms. Allocated memory was 132.1MB in the beginning and 901.8MB in the end (delta: 769.7MB). Free memory was 60.8MB in the beginning and 477.6MB in the end (delta: -416.7MB). Peak memory consumption was 354.6MB. Max. memory is 16.1GB. [2024-11-19 00:21:08,193 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 132.1MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:21:08,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.85ms. Allocated memory was 132.1MB in the beginning and 186.6MB in the end (delta: 54.5MB). Free memory was 60.7MB in the beginning and 152.4MB in the end (delta: -91.7MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-19 00:21:08,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.07ms. Allocated memory is still 186.6MB. Free memory was 152.4MB in the beginning and 149.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:21:08,194 INFO L158 Benchmark]: Boogie Preprocessor took 67.44ms. Allocated memory is still 186.6MB. Free memory was 149.1MB in the beginning and 144.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:21:08,195 INFO L158 Benchmark]: RCFGBuilder took 642.45ms. Allocated memory is still 186.6MB. Free memory was 143.7MB in the beginning and 120.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 00:21:08,195 INFO L158 Benchmark]: TraceAbstraction took 48999.65ms. Allocated memory was 186.6MB in the beginning and 901.8MB in the end (delta: 715.1MB). Free memory was 119.7MB in the beginning and 478.6MB in the end (delta: -358.9MB). Peak memory consumption was 356.1MB. Max. memory is 16.1GB. [2024-11-19 00:21:08,196 INFO L158 Benchmark]: Witness Printer took 4.97ms. Allocated memory is still 901.8MB. Free memory was 478.6MB in the beginning and 477.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:21:08,198 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.17ms. Allocated memory is still 132.1MB. Free memory is still 94.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.85ms. Allocated memory was 132.1MB in the beginning and 186.6MB in the end (delta: 54.5MB). Free memory was 60.7MB in the beginning and 152.4MB in the end (delta: -91.7MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.07ms. Allocated memory is still 186.6MB. Free memory was 152.4MB in the beginning and 149.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.44ms. Allocated memory is still 186.6MB. Free memory was 149.1MB in the beginning and 144.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 642.45ms. Allocated memory is still 186.6MB. Free memory was 143.7MB in the beginning and 120.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 48999.65ms. Allocated memory was 186.6MB in the beginning and 901.8MB in the end (delta: 715.1MB). Free memory was 119.7MB in the beginning and 478.6MB in the end (delta: -358.9MB). Peak memory consumption was 356.1MB. Max. memory is 16.1GB. * Witness Printer took 4.97ms. Allocated memory is still 901.8MB. Free memory was 478.6MB in the beginning and 477.6MB in the end (delta: 1.0MB). 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 127, overapproximation of someBinaryArithmeticDOUBLEoperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed short int var_1_4 = -10; [L24] signed short int var_1_5 = 100; [L25] double var_1_6 = 0.5; [L26] double var_1_7 = 16.5; [L27] double var_1_8 = 7.4; [L28] unsigned short int var_1_9 = 4; [L29] unsigned char var_1_10 = 0; [L30] unsigned long int var_1_11 = 1000000000; [L31] unsigned short int var_1_12 = 256; [L32] signed short int var_1_13 = 16; [L33] signed short int var_1_14 = 64; [L34] unsigned short int var_1_15 = 63836; [L35] unsigned short int var_1_16 = 10; [L36] signed char var_1_17 = -8; [L37] signed char var_1_18 = 8; [L38] signed short int var_1_19 = 50; [L39] signed short int var_1_20 = 10; [L40] signed short int var_1_21 = 10000; [L41] signed char var_1_22 = -2; [L42] signed long int last_1_var_1_1 = -64; VAL [isInitial=0, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L124] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L134] RET updateLastVariables() [L135] CALL updateVariables() [L86] var_1_4 = __VERIFIER_nondet_short() [L87] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L87] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L88] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L88] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L89] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L89] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L90] var_1_5 = __VERIFIER_nondet_short() [L91] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L91] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L92] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L92] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L93] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L94] var_1_7 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L95] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L96] var_1_8 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L97] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L98] var_1_10 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L100] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L101] var_1_13 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L102] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L103] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L103] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L104] var_1_14 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L105] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L106] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L106] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L107] var_1_15 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_15 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L108] RET assume_abort_if_not(var_1_15 >= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L109] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L109] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L110] var_1_16 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L111] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L112] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L112] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L113] var_1_18 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L114] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L115] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L115] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L116] var_1_20 = __VERIFIER_nondet_short() [L117] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L117] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L118] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L118] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L119] var_1_21 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_21 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L120] RET assume_abort_if_not(var_1_21 >= 8191) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L121] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L121] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L135] RET updateVariables() [L136] CALL step() [L46] COND TRUE (var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1 [L47] var_1_12 = (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L49] var_1_11 = (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))))) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L50] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L55] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L56] COND TRUE var_1_13 <= var_1_11 [L57] var_1_19 = ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-64, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-2, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L61] var_1_22 = var_1_18 [L62] unsigned short int stepLocal_3 = var_1_12; [L63] unsigned short int stepLocal_2 = var_1_12; [L64] unsigned short int stepLocal_1 = var_1_12; [L65] unsigned long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-64, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-127, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L66] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-64, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-127, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L66] COND TRUE stepLocal_3 <= ((var_1_11 / var_1_4) & 8) [L67] COND FALSE !(-16 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-64, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-127, var_1_4=-1, var_1_5=64, var_1_6=1/2, var_1_9=4] [L81] COND TRUE var_1_19 <= var_1_1 [L82] var_1_6 = (var_1_7 + var_1_8) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-64, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-127, var_1_4=-1, var_1_5=64, var_1_9=4] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-64, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-127, var_1_4=-1, var_1_5=64, var_1_9=4] [L127-L128] return ((((((((var_1_12 <= ((var_1_11 / var_1_4) & 8)) ? ((-16 <= var_1_11) ? ((var_1_12 != (var_1_11 / ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (var_1_1 == ((signed long int) ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))))) : (var_1_1 == ((signed long int) ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : 1) : ((var_1_11 <= var_1_12) ? (var_1_1 == ((signed long int) var_1_4)) : (var_1_1 == ((signed long int) var_1_11)))) && ((var_1_19 <= var_1_1) ? (var_1_6 == ((double) (var_1_7 + var_1_8))) : 1)) && (var_1_10 ? ((var_1_4 < (var_1_12 + var_1_5)) ? (var_1_9 == ((unsigned short int) 16)) : 1) : 1)) && (var_1_11 == ((unsigned long int) (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12))))))))) && (((var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1) ? (var_1_12 == ((unsigned short int) (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))))) : 1)) && (var_1_17 == ((signed char) var_1_18))) && ((var_1_13 <= var_1_11) ? (var_1_19 == ((signed short int) ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))))) : (var_1_19 == ((signed short int) ((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_12)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_12))))))) && (var_1_22 == ((signed char) var_1_18)) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-64, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-127, var_1_4=-1, var_1_5=64, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=32767, var_1_16=32767, var_1_17=-127, var_1_18=-127, var_1_19=-64, var_1_1=-64, var_1_20=16293, var_1_21=16383, var_1_22=-127, var_1_4=-1, var_1_5=64, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.8s, OverallIterations: 3, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 444 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 444 mSDsluCounter, 720 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 491 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 445 IncrementalHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 229 mSDtfsCounter, 445 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=2, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 100 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 45.6s InterpolantComputationTime, 612 NumberOfCodeBlocks, 612 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 2002 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2208/2208 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-11-19 00:21:08,270 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-98.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 2802349e46e266d85129b1d5ad794eecec89b089e4c78c88709459d2378a7a91 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:21:10,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:21:10,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:21:10,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:21:10,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:21:10,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:21:10,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:21:10,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:21:10,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:21:10,617 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:21:10,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:21:10,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:21:10,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:21:10,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:21:10,623 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:21:10,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:21:10,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:21:10,624 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:21:10,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:21:10,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:21:10,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:21:10,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:21:10,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:21:10,630 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:21:10,630 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:21:10,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:21:10,630 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:21:10,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:21:10,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:21:10,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:21:10,631 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:21:10,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:21:10,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:21:10,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:21:10,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:21:10,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:21:10,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:21:10,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:21:10,639 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:21:10,639 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:21:10,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:21:10,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:21:10,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:21:10,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:21:10,641 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 -> 2802349e46e266d85129b1d5ad794eecec89b089e4c78c88709459d2378a7a91 [2024-11-19 00:21:10,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:21:11,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:21:11,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:21:11,018 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:21:11,019 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:21:11,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-98.i [2024-11-19 00:21:12,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:21:12,748 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:21:12,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-98.i [2024-11-19 00:21:12,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6f78a3ed/1c1efff3b6d74e43aada96a51529fd87/FLAG3fc38ad8f [2024-11-19 00:21:12,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6f78a3ed/1c1efff3b6d74e43aada96a51529fd87 [2024-11-19 00:21:12,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:21:12,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:21:12,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:21:12,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:21:12,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:21:12,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:21:12" (1/1) ... [2024-11-19 00:21:12,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@482c2d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:12, skipping insertion in model container [2024-11-19 00:21:12,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:21:12" (1/1) ... [2024-11-19 00:21:12,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:21:13,032 WARN L250 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_operatoramount_amount50_file-98.i[915,928] [2024-11-19 00:21:13,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:21:13,131 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:21:13,143 WARN L250 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_operatoramount_amount50_file-98.i[915,928] [2024-11-19 00:21:13,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:21:13,210 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:21:13,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:13 WrapperNode [2024-11-19 00:21:13,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:21:13,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:21:13,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:21:13,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:21:13,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:13" (1/1) ... [2024-11-19 00:21:13,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:13" (1/1) ... [2024-11-19 00:21:13,266 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-11-19 00:21:13,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:21:13,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:21:13,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:21:13,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:21:13,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:13" (1/1) ... [2024-11-19 00:21:13,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:13" (1/1) ... [2024-11-19 00:21:13,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:13" (1/1) ... [2024-11-19 00:21:13,303 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-11-19 00:21:13,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:13" (1/1) ... [2024-11-19 00:21:13,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:13" (1/1) ... [2024-11-19 00:21:13,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:13" (1/1) ... [2024-11-19 00:21:13,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:13" (1/1) ... [2024-11-19 00:21:13,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:13" (1/1) ... [2024-11-19 00:21:13,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:13" (1/1) ... [2024-11-19 00:21:13,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:21:13,328 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:21:13,328 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:21:13,328 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:21:13,329 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:13" (1/1) ... [2024-11-19 00:21:13,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:21:13,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:21:13,362 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-11-19 00:21:13,364 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-11-19 00:21:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:21:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:21:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:21:13,398 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:21:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:21:13,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:21:13,487 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:21:13,490 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:21:14,409 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-19 00:21:14,409 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:21:14,425 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:21:14,425 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:21:14,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:21:14 BoogieIcfgContainer [2024-11-19 00:21:14,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:21:14,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:21:14,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:21:14,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:21:14,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:21:12" (1/3) ... [2024-11-19 00:21:14,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a35005b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:21:14, skipping insertion in model container [2024-11-19 00:21:14,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:21:13" (2/3) ... [2024-11-19 00:21:14,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a35005b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:21:14, skipping insertion in model container [2024-11-19 00:21:14,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:21:14" (3/3) ... [2024-11-19 00:21:14,437 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-98.i [2024-11-19 00:21:14,451 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:21:14,451 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:21:14,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:21:14,521 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;@463dec43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:21:14,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:21:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:21:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 00:21:14,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:14,548 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:21:14,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:14,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:14,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2033321866, now seen corresponding path program 1 times [2024-11-19 00:21:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:21:14,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819848792] [2024-11-19 00:21:14,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:14,568 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-11-19 00:21:14,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:21:14,571 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-11-19 00:21:14,572 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-11-19 00:21:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:14,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:21:14,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:21:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-19 00:21:14,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:21:14,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:21:14,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819848792] [2024-11-19 00:21:14,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819848792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:21:14,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:21:14,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:21:14,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112432734] [2024-11-19 00:21:14,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:21:14,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:21:14,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:21:14,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:21:14,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:21:14,984 INFO L87 Difference]: Start difference. First operand has 67 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 00:21:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:21:15,015 INFO L93 Difference]: Finished difference Result 127 states and 222 transitions. [2024-11-19 00:21:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:21:15,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 150 [2024-11-19 00:21:15,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:21:15,024 INFO L225 Difference]: With dead ends: 127 [2024-11-19 00:21:15,024 INFO L226 Difference]: Without dead ends: 63 [2024-11-19 00:21:15,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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-11-19 00:21:15,030 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:21:15,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:21:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-19 00:21:15,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-19 00:21:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:21:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-11-19 00:21:15,083 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 150 [2024-11-19 00:21:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:21:15,084 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-11-19 00:21:15,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-19 00:21:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-11-19 00:21:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 00:21:15,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:15,087 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:21:15,097 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-19 00:21:15,288 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-11-19 00:21:15,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:15,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:15,290 INFO L85 PathProgramCache]: Analyzing trace with hash -94721410, now seen corresponding path program 1 times [2024-11-19 00:21:15,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:21:15,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207323619] [2024-11-19 00:21:15,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:15,291 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-11-19 00:21:15,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:21:15,293 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-11-19 00:21:15,294 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-11-19 00:21:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:15,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 00:21:15,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:21:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 00:21:15,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:21:15,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:21:15,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207323619] [2024-11-19 00:21:15,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207323619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:21:15,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:21:15,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:21:15,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431942815] [2024-11-19 00:21:15,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:21:15,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:21:15,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:21:15,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:21:15,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:21:15,765 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 00:21:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:21:16,418 INFO L93 Difference]: Finished difference Result 167 states and 255 transitions. [2024-11-19 00:21:16,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:21:16,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2024-11-19 00:21:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:21:16,440 INFO L225 Difference]: With dead ends: 167 [2024-11-19 00:21:16,440 INFO L226 Difference]: Without dead ends: 107 [2024-11-19 00:21:16,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 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-11-19 00:21:16,442 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 85 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:21:16,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 222 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:21:16,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-19 00:21:16,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 63. [2024-11-19 00:21:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 00:21:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2024-11-19 00:21:16,465 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 94 transitions. Word has length 150 [2024-11-19 00:21:16,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:21:16,467 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 94 transitions. [2024-11-19 00:21:16,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 00:21:16,471 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 94 transitions. [2024-11-19 00:21:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 00:21:16,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:16,473 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:21:16,487 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-11-19 00:21:16,674 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-11-19 00:21:16,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:16,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:16,676 INFO L85 PathProgramCache]: Analyzing trace with hash -37463108, now seen corresponding path program 1 times [2024-11-19 00:21:16,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:21:16,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762700501] [2024-11-19 00:21:16,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:16,677 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-11-19 00:21:16,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:21:16,681 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-11-19 00:21:16,681 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-11-19 00:21:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:16,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 00:21:16,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:21:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-19 00:21:17,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:21:17,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:21:17,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762700501] [2024-11-19 00:21:17,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762700501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:21:17,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:21:17,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:21:17,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751176195] [2024-11-19 00:21:17,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:21:17,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:21:17,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:21:17,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:21:17,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:21:17,026 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 00:21:18,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:21:18,513 INFO L93 Difference]: Finished difference Result 227 states and 344 transitions. [2024-11-19 00:21:18,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:21:18,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2024-11-19 00:21:18,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:21:18,519 INFO L225 Difference]: With dead ends: 227 [2024-11-19 00:21:18,519 INFO L226 Difference]: Without dead ends: 167 [2024-11-19 00:21:18,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:21:18,526 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 150 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:21:18,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 375 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 00:21:18,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-19 00:21:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 119. [2024-11-19 00:21:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 68 states have internal predecessors, (84), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 00:21:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 180 transitions. [2024-11-19 00:21:18,578 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 180 transitions. Word has length 150 [2024-11-19 00:21:18,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:21:18,579 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 180 transitions. [2024-11-19 00:21:18,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-19 00:21:18,579 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 180 transitions. [2024-11-19 00:21:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-19 00:21:18,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:18,584 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:21:18,614 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 (4)] Ended with exit code 0 [2024-11-19 00:21:18,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-11-19 00:21:18,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:18,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:18,786 INFO L85 PathProgramCache]: Analyzing trace with hash -35616066, now seen corresponding path program 1 times [2024-11-19 00:21:18,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:21:18,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276561218] [2024-11-19 00:21:18,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:18,787 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-11-19 00:21:18,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:21:18,790 INFO L229 MonitoredProcess]: Starting monitored process 5 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-11-19 00:21:18,791 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 (5)] Waiting until timeout for monitored process [2024-11-19 00:21:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:18,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 00:21:18,995 INFO L278 TraceCheckSpWp]: Computing forward predicates...