./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-26.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 6be4c9be62328bd37ccdf057890c0a9f3a4d0382c2ea12b98096ea1fecbede65 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:00:43,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:00:43,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:00:43,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:00:43,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:00:43,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:00:43,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:00:43,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:00:43,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:00:43,189 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:00:43,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:00:43,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:00:43,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:00:43,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:00:43,192 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:00:43,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:00:43,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:00:43,195 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:00:43,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:00:43,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:00:43,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:00:43,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:00:43,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:00:43,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:00:43,197 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:00:43,197 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:00:43,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:00:43,198 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:00:43,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:00:43,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:00:43,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:00:43,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:00:43,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:00:43,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:00:43,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:00:43,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:00:43,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:00:43,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:00:43,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:00:43,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:00:43,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:00:43,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:00:43,203 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 -> 6be4c9be62328bd37ccdf057890c0a9f3a4d0382c2ea12b98096ea1fecbede65 [2024-10-14 13:00:43,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:00:43,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:00:43,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:00:43,458 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:00:43,459 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:00:43,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-26.i [2024-10-14 13:00:44,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:00:45,052 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:00:45,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-26.i [2024-10-14 13:00:45,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c473ce8ce/e3d9b523b41e45b98b6fa7466df1b8e6/FLAG421932c8f [2024-10-14 13:00:45,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c473ce8ce/e3d9b523b41e45b98b6fa7466df1b8e6 [2024-10-14 13:00:45,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:00:45,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:00:45,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:00:45,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:00:45,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:00:45,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:00:45" (1/1) ... [2024-10-14 13:00:45,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42cebe87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:45, skipping insertion in model container [2024-10-14 13:00:45,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:00:45" (1/1) ... [2024-10-14 13:00:45,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:00:45,262 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-26.i[915,928] [2024-10-14 13:00:45,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:00:45,361 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:00:45,383 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-26.i[915,928] [2024-10-14 13:00:45,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:00:45,448 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:00:45,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:45 WrapperNode [2024-10-14 13:00:45,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:00:45,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:00:45,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:00:45,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:00:45,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:45" (1/1) ... [2024-10-14 13:00:45,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:45" (1/1) ... [2024-10-14 13:00:45,510 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-10-14 13:00:45,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:00:45,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:00:45,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:00:45,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:00:45,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:45" (1/1) ... [2024-10-14 13:00:45,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:45" (1/1) ... [2024-10-14 13:00:45,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:45" (1/1) ... [2024-10-14 13:00:45,541 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 13:00:45,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:45" (1/1) ... [2024-10-14 13:00:45,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:45" (1/1) ... [2024-10-14 13:00:45,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:45" (1/1) ... [2024-10-14 13:00:45,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:45" (1/1) ... [2024-10-14 13:00:45,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:45" (1/1) ... [2024-10-14 13:00:45,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:45" (1/1) ... [2024-10-14 13:00:45,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:00:45,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:00:45,562 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:00:45,562 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:00:45,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:45" (1/1) ... [2024-10-14 13:00:45,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:00:45,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:00:45,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:00:45,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:00:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:00:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:00:45,653 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:00:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:00:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:00:45,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:00:45,747 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:00:45,749 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:00:46,065 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-14 13:00:46,065 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:00:46,108 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:00:46,109 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:00:46,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:00:46 BoogieIcfgContainer [2024-10-14 13:00:46,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:00:46,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:00:46,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:00:46,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:00:46,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:00:45" (1/3) ... [2024-10-14 13:00:46,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4519bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:00:46, skipping insertion in model container [2024-10-14 13:00:46,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:45" (2/3) ... [2024-10-14 13:00:46,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4519bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:00:46, skipping insertion in model container [2024-10-14 13:00:46,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:00:46" (3/3) ... [2024-10-14 13:00:46,121 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-26.i [2024-10-14 13:00:46,140 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:00:46,140 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:00:46,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:00:46,202 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;@60a89019, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:00:46,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:00:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:00:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 13:00:46,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:00:46,216 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:00:46,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:00:46,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:00:46,221 INFO L85 PathProgramCache]: Analyzing trace with hash -564915041, now seen corresponding path program 1 times [2024-10-14 13:00:46,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:00:46,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798590408] [2024-10-14 13:00:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:00:46,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:00:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:00:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 13:00:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 13:00:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 13:00:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:00:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:00:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 13:00:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 13:00:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 13:00:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 13:00:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 13:00:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 13:00:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 13:00:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:00:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:00:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 13:00:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 13:00:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 13:00:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:46,689 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 13:00:46,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:00:46,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798590408] [2024-10-14 13:00:46,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798590408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:00:46,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:00:46,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:00:46,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289247985] [2024-10-14 13:00:46,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:00:46,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:00:46,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:00:46,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:00:46,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:00:46,729 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 13:00:46,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:00:46,772 INFO L93 Difference]: Finished difference Result 105 states and 184 transitions. [2024-10-14 13:00:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:00:46,776 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-10-14 13:00:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:00:46,784 INFO L225 Difference]: With dead ends: 105 [2024-10-14 13:00:46,785 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 13:00:46,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:00:46,794 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:00:46,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:00:46,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 13:00:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-14 13:00:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:00:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2024-10-14 13:00:46,853 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 114 [2024-10-14 13:00:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:00:46,854 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2024-10-14 13:00:46,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 13:00:46,855 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-10-14 13:00:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 13:00:46,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:00:46,858 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:00:46,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:00:46,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:00:46,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:00:46,859 INFO L85 PathProgramCache]: Analyzing trace with hash -315253605, now seen corresponding path program 1 times [2024-10-14 13:00:46,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:00:46,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585529982] [2024-10-14 13:00:46,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:00:46,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:00:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:00:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 13:00:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 13:00:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 13:00:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:00:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:00:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 13:00:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 13:00:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 13:00:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 13:00:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 13:00:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 13:00:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 13:00:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:00:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:00:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 13:00:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 13:00:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 13:00:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 13:00:47,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:00:47,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585529982] [2024-10-14 13:00:47,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585529982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:00:47,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:00:47,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:00:47,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541654422] [2024-10-14 13:00:47,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:00:47,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:00:47,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:00:47,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:00:47,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:00:47,493 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 13:00:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:00:47,573 INFO L93 Difference]: Finished difference Result 128 states and 192 transitions. [2024-10-14 13:00:47,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:00:47,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-10-14 13:00:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:00:47,583 INFO L225 Difference]: With dead ends: 128 [2024-10-14 13:00:47,610 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 13:00:47,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:00:47,612 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 30 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:00:47,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 178 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:00:47,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 13:00:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2024-10-14 13:00:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 51 states have internal predecessors, (69), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 13:00:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2024-10-14 13:00:47,639 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 114 [2024-10-14 13:00:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:00:47,640 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2024-10-14 13:00:47,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 13:00:47,641 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2024-10-14 13:00:47,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 13:00:47,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:00:47,643 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:00:47,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:00:47,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:00:47,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:00:47,645 INFO L85 PathProgramCache]: Analyzing trace with hash 736927679, now seen corresponding path program 1 times [2024-10-14 13:00:47,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:00:47,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001384364] [2024-10-14 13:00:47,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:00:47,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:00:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:00:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 13:00:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 13:00:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 13:00:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 13:00:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:00:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 13:00:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 13:00:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:47,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 13:00:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:48,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 13:00:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:48,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 13:00:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:48,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 13:00:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:48,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 13:00:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:48,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 13:00:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:48,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 13:00:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:48,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 13:00:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:48,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 13:00:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:48,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 13:00:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:00:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 13:00:48,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:00:48,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001384364] [2024-10-14 13:00:48,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001384364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:00:48,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:00:48,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:00:48,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553653261] [2024-10-14 13:00:48,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:00:48,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:00:48,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:00:48,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:00:48,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:00:48,075 INFO L87 Difference]: Start difference. First operand 74 states and 111 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 13:00:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:00:48,341 INFO L93 Difference]: Finished difference Result 223 states and 335 transitions. [2024-10-14 13:00:48,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:00:48,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-10-14 13:00:48,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:00:48,348 INFO L225 Difference]: With dead ends: 223 [2024-10-14 13:00:48,348 INFO L226 Difference]: Without dead ends: 150 [2024-10-14 13:00:48,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:00:48,351 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 75 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:00:48,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 256 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:00:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-14 13:00:48,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2024-10-14 13:00:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 87 states have (on average 1.367816091954023) internal successors, (119), 88 states have internal predecessors, (119), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-14 13:00:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 197 transitions. [2024-10-14 13:00:48,390 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 197 transitions. Word has length 115 [2024-10-14 13:00:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:00:48,391 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 197 transitions. [2024-10-14 13:00:48,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 13:00:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 197 transitions. [2024-10-14 13:00:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 13:00:48,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:00:48,398 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:00:48,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:00:48,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:00:48,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:00:48,399 INFO L85 PathProgramCache]: Analyzing trace with hash -72418947, now seen corresponding path program 1 times [2024-10-14 13:00:48,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:00:48,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3721805] [2024-10-14 13:00:48,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:00:48,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:00:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 13:00:48,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [893236826] [2024-10-14 13:00:48,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:00:48,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:00:48,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:00:48,557 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-10-14 13:00:48,562 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-10-14 13:00:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:00:49,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 13:00:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 13:00:49,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 13:00:49,203 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 13:00:49,205 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:00:49,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 13:00:49,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:00:49,410 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 13:00:49,507 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:00:49,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:00:49 BoogieIcfgContainer [2024-10-14 13:00:49,510 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:00:49,511 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:00:49,511 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:00:49,511 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:00:49,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:00:46" (3/4) ... [2024-10-14 13:00:49,513 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 13:00:49,514 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:00:49,515 INFO L158 Benchmark]: Toolchain (without parser) took 4436.17ms. Allocated memory was 169.9MB in the beginning and 220.2MB in the end (delta: 50.3MB). Free memory was 112.5MB in the beginning and 130.0MB in the end (delta: -17.5MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-10-14 13:00:49,515 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 51.0MB in the beginning and 51.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:00:49,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.68ms. Allocated memory is still 169.9MB. Free memory was 112.3MB in the beginning and 139.5MB in the end (delta: -27.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 13:00:49,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.31ms. Allocated memory is still 169.9MB. Free memory was 139.5MB in the beginning and 136.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:00:49,516 INFO L158 Benchmark]: Boogie Preprocessor took 49.45ms. Allocated memory is still 169.9MB. Free memory was 136.2MB in the beginning and 131.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:00:49,516 INFO L158 Benchmark]: RCFGBuilder took 551.06ms. Allocated memory is still 169.9MB. Free memory was 131.1MB in the beginning and 106.9MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 13:00:49,517 INFO L158 Benchmark]: TraceAbstraction took 3396.02ms. Allocated memory was 169.9MB in the beginning and 220.2MB in the end (delta: 50.3MB). Free memory was 106.0MB in the beginning and 130.0MB in the end (delta: -24.0MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2024-10-14 13:00:49,517 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 220.2MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:00:49,519 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.16ms. Allocated memory is still 96.5MB. Free memory was 51.0MB in the beginning and 51.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.68ms. Allocated memory is still 169.9MB. Free memory was 112.3MB in the beginning and 139.5MB in the end (delta: -27.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.31ms. Allocated memory is still 169.9MB. Free memory was 139.5MB in the beginning and 136.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.45ms. Allocated memory is still 169.9MB. Free memory was 136.2MB in the beginning and 131.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 551.06ms. Allocated memory is still 169.9MB. Free memory was 131.1MB in the beginning and 106.9MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3396.02ms. Allocated memory was 169.9MB in the beginning and 220.2MB in the end (delta: 50.3MB). Free memory was 106.0MB in the beginning and 130.0MB in the end (delta: -24.0MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 220.2MB. Free memory is still 130.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 someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 133. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 16; [L23] signed long int var_1_4 = -64; [L24] signed char var_1_9 = 10; [L25] unsigned char var_1_10 = 0; [L26] signed char var_1_11 = -1; [L27] unsigned short int var_1_12 = 10000; [L28] float var_1_13 = 5.4; [L29] float var_1_14 = 1.4; [L30] unsigned short int var_1_18 = 32; [L31] double var_1_20 = 1.5; [L32] double var_1_21 = 2.75; [L33] unsigned char var_1_22 = 5; [L34] unsigned short int var_1_23 = 55712; [L35] unsigned char var_1_24 = 5; [L36] signed short int var_1_25 = 10; [L37] float var_1_26 = 64.2; [L38] unsigned long int last_1_var_1_1 = 16; [L39] signed char last_1_var_1_9 = 10; [L40] unsigned short int last_1_var_1_12 = 10000; [L41] double last_1_var_1_20 = 1.5; [L42] unsigned char last_1_var_1_22 = 5; [L43] signed short int last_1_var_1_25 = 10; [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L125] last_1_var_1_1 = var_1_1 [L126] last_1_var_1_9 = var_1_9 [L127] last_1_var_1_12 = var_1_12 [L128] last_1_var_1_20 = var_1_20 [L129] last_1_var_1_22 = var_1_22 [L130] last_1_var_1_25 = var_1_25 [L140] RET updateLastVariables() [L141] CALL updateVariables() [L95] var_1_4 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L96] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L97] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L97] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L98] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L98] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L100] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L101] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L101] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L102] var_1_11 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L103] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L104] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L104] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L105] var_1_13 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L106] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L107] var_1_14 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L108] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L109] var_1_18 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L110] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L111] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L111] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L113] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L114] var_1_23 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L115] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L116] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L116] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L117] var_1_24 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L118] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L119] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L119] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_26=321/5, var_1_4=5, var_1_9=10] [L120] var_1_26 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=5, var_1_9=10] [L121] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=5, var_1_9=10] [L122] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=5, var_1_9=10] [L122] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=5, var_1_9=10] [L141] RET updateVariables() [L142] CALL step() [L47] COND FALSE !(! var_1_10) [L54] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=5, var_1_9=8] [L56] unsigned long int stepLocal_5 = last_1_var_1_1; [L57] signed long int stepLocal_4 = var_1_4 + last_1_var_1_9; [L58] unsigned short int stepLocal_3 = var_1_18; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=15, stepLocal_5=16, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=5, var_1_9=8] [L59] COND FALSE !(stepLocal_5 > last_1_var_1_12) [L70] var_1_22 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=15, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=5, var_1_9=8] [L72] unsigned char stepLocal_2 = var_1_10; [L73] signed long int stepLocal_1 = last_1_var_1_22; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, stepLocal_2=1, stepLocal_3=0, stepLocal_4=15, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=5, var_1_9=8] [L74] COND TRUE ((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || stepLocal_2 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, stepLocal_3=0, stepLocal_4=15, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=5, var_1_9=8] [L75] COND FALSE !(stepLocal_1 >= last_1_var_1_12) [L78] var_1_12 = last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=15, var_1_10=1, var_1_11=8, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=5, var_1_9=8] [L81] COND TRUE var_1_11 > (var_1_22 * (var_1_12 + var_1_22)) [L82] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=15, var_1_10=1, var_1_11=8, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=5, var_1_9=8] [L84] COND TRUE (var_1_20 / var_1_26) > var_1_13 [L85] var_1_25 = ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=15, var_1_10=1, var_1_11=8, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=5, var_1_9=8] [L89] signed long int stepLocal_0 = (var_1_25 + var_1_9) / var_1_4; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_0=2, stepLocal_3=0, stepLocal_4=15, var_1_10=1, var_1_11=8, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=5, var_1_9=8] [L90] COND TRUE stepLocal_0 == var_1_25 [L91] var_1_1 = (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=15, var_1_10=1, var_1_11=8, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=5, var_1_9=8] [L142] RET step() [L143] CALL, EXPR property() [L133-L134] return ((((((((var_1_25 + var_1_9) / var_1_4) == var_1_25) ? (var_1_1 == ((unsigned long int) (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22))) : 1) && ((! var_1_10) ? ((((((last_1_var_1_22) > (last_1_var_1_25)) ? (last_1_var_1_22) : (last_1_var_1_25))) >= last_1_var_1_12) ? (var_1_9 == ((signed char) (-16 + var_1_11))) : (var_1_9 == ((signed char) var_1_11))) : (var_1_9 == ((signed char) var_1_11)))) && ((((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || var_1_10) ? ((last_1_var_1_22 >= last_1_var_1_12) ? (var_1_12 == ((unsigned short int) (((((last_1_var_1_22) < (last_1_var_1_22)) ? (last_1_var_1_22) : (last_1_var_1_22))) + 32))) : (var_1_12 == ((unsigned short int) last_1_var_1_22))) : 1)) && ((var_1_11 > (var_1_22 * (var_1_12 + var_1_22))) ? (var_1_20 == ((double) var_1_21)) : 1)) && ((last_1_var_1_1 > last_1_var_1_12) ? ((last_1_var_1_1 >= (var_1_4 + last_1_var_1_9)) ? ((var_1_18 == (var_1_23 - 8)) ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24)))) && (((var_1_20 / var_1_26) > var_1_13) ? (var_1_25 == ((signed short int) ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))))) : (var_1_25 == ((signed short int) var_1_11))) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=5, var_1_9=8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=5, var_1_9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 510 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 271 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 102 IncrementalHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 239 mSDtfsCounter, 102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=3, InterpolantAutomatonStates: 11, 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, 3 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 573 NumberOfCodeBlocks, 573 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 661 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1836/1836 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 13:00:49,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-26.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 6be4c9be62328bd37ccdf057890c0a9f3a4d0382c2ea12b98096ea1fecbede65 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:00:51,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:00:51,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 13:00:51,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:00:51,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:00:51,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:00:51,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:00:51,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:00:51,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:00:51,834 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:00:51,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:00:51,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:00:51,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:00:51,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:00:51,836 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:00:51,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:00:51,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:00:51,837 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:00:51,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:00:51,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:00:51,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:00:51,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:00:51,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:00:51,839 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 13:00:51,840 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 13:00:51,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:00:51,840 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 13:00:51,841 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:00:51,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:00:51,841 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:00:51,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:00:51,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:00:51,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:00:51,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:00:51,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:00:51,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:00:51,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:00:51,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:00:51,844 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 13:00:51,844 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 13:00:51,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:00:51,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:00:51,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:00:51,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:00:51,846 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 13:00:51,846 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 -> 6be4c9be62328bd37ccdf057890c0a9f3a4d0382c2ea12b98096ea1fecbede65 [2024-10-14 13:00:52,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:00:52,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:00:52,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:00:52,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:00:52,214 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:00:52,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-26.i [2024-10-14 13:00:53,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:00:53,977 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:00:53,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-26.i [2024-10-14 13:00:53,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b26adfe6/d984ebfd625f4c328c532f797c9d348c/FLAG7004b6acf [2024-10-14 13:00:54,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b26adfe6/d984ebfd625f4c328c532f797c9d348c [2024-10-14 13:00:54,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:00:54,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:00:54,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:00:54,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:00:54,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:00:54,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:00:54" (1/1) ... [2024-10-14 13:00:54,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69df3215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:54, skipping insertion in model container [2024-10-14 13:00:54,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:00:54" (1/1) ... [2024-10-14 13:00:54,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:00:54,236 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-26.i[915,928] [2024-10-14 13:00:54,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:00:54,336 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:00:54,349 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-26.i[915,928] [2024-10-14 13:00:54,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:00:54,414 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:00:54,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:54 WrapperNode [2024-10-14 13:00:54,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:00:54,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:00:54,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:00:54,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:00:54,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:54" (1/1) ... [2024-10-14 13:00:54,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:54" (1/1) ... [2024-10-14 13:00:54,481 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-10-14 13:00:54,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:00:54,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:00:54,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:00:54,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:00:54,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:54" (1/1) ... [2024-10-14 13:00:54,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:54" (1/1) ... [2024-10-14 13:00:54,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:54" (1/1) ... [2024-10-14 13:00:54,521 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 13:00:54,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:54" (1/1) ... [2024-10-14 13:00:54,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:54" (1/1) ... [2024-10-14 13:00:54,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:54" (1/1) ... [2024-10-14 13:00:54,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:54" (1/1) ... [2024-10-14 13:00:54,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:54" (1/1) ... [2024-10-14 13:00:54,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:54" (1/1) ... [2024-10-14 13:00:54,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:00:54,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:00:54,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:00:54,563 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:00:54,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:54" (1/1) ... [2024-10-14 13:00:54,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:00:54,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:00:54,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:00:54,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:00:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:00:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 13:00:54,643 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:00:54,644 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:00:54,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:00:54,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:00:54,731 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:00:54,734 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:01:07,851 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-14 13:01:07,852 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:01:07,901 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:01:07,902 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:01:07,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:01:07 BoogieIcfgContainer [2024-10-14 13:01:07,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:01:07,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:01:07,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:01:07,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:01:07,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:00:54" (1/3) ... [2024-10-14 13:01:07,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21675b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:01:07, skipping insertion in model container [2024-10-14 13:01:07,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:00:54" (2/3) ... [2024-10-14 13:01:07,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21675b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:01:07, skipping insertion in model container [2024-10-14 13:01:07,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:01:07" (3/3) ... [2024-10-14 13:01:07,912 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-26.i [2024-10-14 13:01:07,933 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:01:07,934 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:01:08,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:01:08,027 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;@3a516f7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:01:08,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:01:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:01:08,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 13:01:08,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:01:08,046 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:01:08,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:01:08,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:01:08,053 INFO L85 PathProgramCache]: Analyzing trace with hash -564915041, now seen corresponding path program 1 times [2024-10-14 13:01:08,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:01:08,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931831426] [2024-10-14 13:01:08,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:01:08,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:01:08,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:01:08,071 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:01:08,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 13:01:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:01:08,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 13:01:08,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:01:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-14 13:01:09,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:01:09,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:01:09,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931831426] [2024-10-14 13:01:09,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931831426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:01:09,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:01:09,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:01:09,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576753182] [2024-10-14 13:01:09,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:01:09,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:01:09,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:01:09,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:01:09,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:01:09,038 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 13:01:13,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 13:01:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:01:13,335 INFO L93 Difference]: Finished difference Result 105 states and 184 transitions. [2024-10-14 13:01:13,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:01:13,430 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-10-14 13:01:13,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:01:13,436 INFO L225 Difference]: With dead ends: 105 [2024-10-14 13:01:13,436 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 13:01:13,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:01:13,442 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-14 13:01:13,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-14 13:01:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 13:01:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-14 13:01:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:01:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2024-10-14 13:01:13,491 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 114 [2024-10-14 13:01:13,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:01:13,491 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2024-10-14 13:01:13,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 13:01:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-10-14 13:01:13,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 13:01:13,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:01:13,501 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:01:13,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 13:01:13,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:01:13,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:01:13,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:01:13,703 INFO L85 PathProgramCache]: Analyzing trace with hash -315253605, now seen corresponding path program 1 times [2024-10-14 13:01:13,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:01:13,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707585716] [2024-10-14 13:01:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:01:13,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:01:13,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:01:13,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:01:13,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 13:01:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:01:14,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 13:01:14,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:01:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 39 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-14 13:01:17,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:01:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 13:01:18,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:01:18,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707585716] [2024-10-14 13:01:18,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707585716] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:01:18,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 13:01:18,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-14 13:01:18,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374349719] [2024-10-14 13:01:18,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:01:18,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:01:18,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:01:18,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:01:18,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:01:18,549 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 13:01:23,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 13:01:27,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 13:01:31,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 13:01:34,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 13:01:35,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:01:35,205 INFO L93 Difference]: Finished difference Result 128 states and 192 transitions. [2024-10-14 13:01:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:01:35,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-10-14 13:01:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:01:35,208 INFO L225 Difference]: With dead ends: 128 [2024-10-14 13:01:35,208 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 13:01:35,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 13:01:35,210 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 31 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2024-10-14 13:01:35,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 236 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 3 Unknown, 0 Unchecked, 16.5s Time] [2024-10-14 13:01:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 13:01:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2024-10-14 13:01:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 51 states have internal predecessors, (69), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 13:01:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2024-10-14 13:01:35,227 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 114 [2024-10-14 13:01:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:01:35,228 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2024-10-14 13:01:35,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 13:01:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2024-10-14 13:01:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 13:01:35,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:01:35,231 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:01:35,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 13:01:35,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:01:35,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:01:35,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:01:35,432 INFO L85 PathProgramCache]: Analyzing trace with hash 736927679, now seen corresponding path program 1 times [2024-10-14 13:01:35,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:01:35,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366727762] [2024-10-14 13:01:35,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:01:35,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:01:35,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:01:35,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 13:01:35,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 13:01:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:01:36,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 13:01:36,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:01:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 13:01:39,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 13:01:39,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 13:01:39,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366727762] [2024-10-14 13:01:39,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366727762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:01:39,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:01:39,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:01:39,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496989396] [2024-10-14 13:01:39,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:01:39,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:01:39,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 13:01:39,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:01:39,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:01:39,135 INFO L87 Difference]: Start difference. First operand 74 states and 111 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 13:01:45,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 13:01:49,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 13:01:53,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:01:57,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:02:01,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:02:05,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 13:02:09,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 13:02:13,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 13:02:17,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 13:02:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:02:17,533 INFO L93 Difference]: Finished difference Result 223 states and 335 transitions. [2024-10-14 13:02:17,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:02:17,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-10-14 13:02:17,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:02:17,627 INFO L225 Difference]: With dead ends: 223 [2024-10-14 13:02:17,627 INFO L226 Difference]: Without dead ends: 150 [2024-10-14 13:02:17,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:02:17,629 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 70 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 37 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:02:17,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 254 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 67 Invalid, 9 Unknown, 0 Unchecked, 38.1s Time] [2024-10-14 13:02:17,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-14 13:02:17,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2024-10-14 13:02:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 87 states have (on average 1.367816091954023) internal successors, (119), 88 states have internal predecessors, (119), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-14 13:02:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 197 transitions. [2024-10-14 13:02:17,669 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 197 transitions. Word has length 115 [2024-10-14 13:02:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:02:17,669 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 197 transitions. [2024-10-14 13:02:17,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 13:02:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 197 transitions. [2024-10-14 13:02:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 13:02:17,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:02:17,672 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:02:17,696 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 (4)] Forceful destruction successful, exit code 0 [2024-10-14 13:02:17,872 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-10-14 13:02:17,873 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:02:17,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:02:17,873 INFO L85 PathProgramCache]: Analyzing trace with hash -72418947, now seen corresponding path program 1 times [2024-10-14 13:02:17,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 13:02:17,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237290462] [2024-10-14 13:02:17,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:02:17,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 13:02:17,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 13:02:17,877 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-10-14 13:02:17,878 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-10-14 13:02:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:02:18,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 13:02:18,716 INFO L278 TraceCheckSpWp]: Computing forward predicates...