./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.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 21c88489aa138dbbc6ea2b63fbc507bc3a819b70c71c9b1f4d3d14d1012d804f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:53:59,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:53:59,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:53:59,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:53:59,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:53:59,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:53:59,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:53:59,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:53:59,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:53:59,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:53:59,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:53:59,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:53:59,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:53:59,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:53:59,473 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:53:59,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:53:59,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:53:59,474 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:53:59,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:53:59,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:53:59,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:53:59,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:53:59,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:53:59,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:53:59,477 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:53:59,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:53:59,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:53:59,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:53:59,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:53:59,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:53:59,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:53:59,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:53:59,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:53:59,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:53:59,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:53:59,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:53:59,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:53:59,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:53:59,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:53:59,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:53:59,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:53:59,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:53:59,482 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 -> 21c88489aa138dbbc6ea2b63fbc507bc3a819b70c71c9b1f4d3d14d1012d804f [2024-11-09 00:53:59,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:53:59,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:53:59,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:53:59,739 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:53:59,740 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:53:59,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.i [2024-11-09 00:54:01,135 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:54:01,336 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:54:01,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.i [2024-11-09 00:54:01,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbeeb34ab/5ecb057d3ad94154b899ec5ee7143132/FLAG862ba76d8 [2024-11-09 00:54:01,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbeeb34ab/5ecb057d3ad94154b899ec5ee7143132 [2024-11-09 00:54:01,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:54:01,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:54:01,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:54:01,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:54:01,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:54:01,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:54:01" (1/1) ... [2024-11-09 00:54:01,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d787561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:01, skipping insertion in model container [2024-11-09 00:54:01,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:54:01" (1/1) ... [2024-11-09 00:54:01,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:54:01,570 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.i[914,927] [2024-11-09 00:54:01,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:54:01,634 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:54:01,647 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.i[914,927] [2024-11-09 00:54:01,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:54:01,677 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:54:01,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:01 WrapperNode [2024-11-09 00:54:01,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:54:01,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:54:01,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:54:01,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:54:01,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:01" (1/1) ... [2024-11-09 00:54:01,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:01" (1/1) ... [2024-11-09 00:54:01,724 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-09 00:54:01,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:54:01,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:54:01,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:54:01,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:54:01,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:01" (1/1) ... [2024-11-09 00:54:01,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:01" (1/1) ... [2024-11-09 00:54:01,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:01" (1/1) ... [2024-11-09 00:54:01,750 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:54:01,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:01" (1/1) ... [2024-11-09 00:54:01,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:01" (1/1) ... [2024-11-09 00:54:01,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:01" (1/1) ... [2024-11-09 00:54:01,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:01" (1/1) ... [2024-11-09 00:54:01,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:01" (1/1) ... [2024-11-09 00:54:01,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:01" (1/1) ... [2024-11-09 00:54:01,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:54:01,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:54:01,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:54:01,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:54:01,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:01" (1/1) ... [2024-11-09 00:54:01,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:54:01,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:54:01,804 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:54:01,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:54:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:54:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:54:01,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:54:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:54:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:54:01,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:54:01,914 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:54:01,917 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:54:02,101 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:54:02,101 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:54:02,111 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:54:02,112 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:54:02,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:02 BoogieIcfgContainer [2024-11-09 00:54:02,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:54:02,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:54:02,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:54:02,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:54:02,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:54:01" (1/3) ... [2024-11-09 00:54:02,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2082a819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:54:02, skipping insertion in model container [2024-11-09 00:54:02,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:01" (2/3) ... [2024-11-09 00:54:02,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2082a819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:54:02, skipping insertion in model container [2024-11-09 00:54:02,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:02" (3/3) ... [2024-11-09 00:54:02,119 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-8.i [2024-11-09 00:54:02,132 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:54:02,132 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:54:02,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:54:02,180 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;@19c6aabb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:54:02,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:54:02,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:54:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 00:54:02,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:54:02,192 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:54:02,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:54:02,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:54:02,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1472964719, now seen corresponding path program 1 times [2024-11-09 00:54:02,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:54:02,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238970138] [2024-11-09 00:54:02,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:02,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:54:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:54:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:54:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:54:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:54:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:54:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:54:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:54:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:54:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:54:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:54:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:54:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:54:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:54:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:54:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:54:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:54:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:54:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:54:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:54:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:54:02,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:54:02,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238970138] [2024-11-09 00:54:02,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238970138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:54:02,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:54:02,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:54:02,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153379916] [2024-11-09 00:54:02,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:54:02,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:54:02,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:54:02,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:54:02,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:54:02,557 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:54:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:54:02,582 INFO L93 Difference]: Finished difference Result 103 states and 176 transitions. [2024-11-09 00:54:02,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:54:02,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-11-09 00:54:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:54:02,589 INFO L225 Difference]: With dead ends: 103 [2024-11-09 00:54:02,592 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 00:54:02,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:54:02,599 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:54:02,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:54:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 00:54:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-09 00:54:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:54:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2024-11-09 00:54:02,640 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 125 [2024-11-09 00:54:02,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:54:02,640 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-11-09 00:54:02,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:54:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2024-11-09 00:54:02,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 00:54:02,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:54:02,645 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:54:02,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:54:02,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:54:02,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:54:02,647 INFO L85 PathProgramCache]: Analyzing trace with hash -286332501, now seen corresponding path program 1 times [2024-11-09 00:54:02,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:54:02,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651367803] [2024-11-09 00:54:02,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:02,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:54:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:54:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:54:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:54:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:54:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:54:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:54:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:54:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:54:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:54:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:54:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:02,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:54:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:54:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:54:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:54:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:54:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:54:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:54:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:54:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:54:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:54:03,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:54:03,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651367803] [2024-11-09 00:54:03,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651367803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:54:03,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:54:03,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:54:03,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944815760] [2024-11-09 00:54:03,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:54:03,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:54:03,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:54:03,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:54:03,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:54:03,043 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:54:03,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:54:03,165 INFO L93 Difference]: Finished difference Result 99 states and 145 transitions. [2024-11-09 00:54:03,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:54:03,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-11-09 00:54:03,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:54:03,170 INFO L225 Difference]: With dead ends: 99 [2024-11-09 00:54:03,170 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 00:54:03,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:54:03,171 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:54:03,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 69 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:54:03,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 00:54:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-09 00:54:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:54:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-09 00:54:03,189 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 125 [2024-11-09 00:54:03,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:54:03,190 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-09 00:54:03,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:54:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-09 00:54:03,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 00:54:03,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:54:03,197 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:54:03,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:54:03,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:54:03,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:54:03,198 INFO L85 PathProgramCache]: Analyzing trace with hash 393725869, now seen corresponding path program 1 times [2024-11-09 00:54:03,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:54:03,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709260940] [2024-11-09 00:54:03,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:03,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:54:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:54:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:54:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:54:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:54:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:54:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:54:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:54:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:54:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:54:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:54:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:54:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:54:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:54:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:54:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:54:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:54:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:54:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:54:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:54:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 00:54:03,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:54:03,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709260940] [2024-11-09 00:54:03,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709260940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:54:03,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949256489] [2024-11-09 00:54:03,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:03,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:54:03,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:54:03,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:54:03,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:54:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:03,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:54:03,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:54:03,918 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-09 00:54:03,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:54:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 00:54:04,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949256489] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:54:04,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:54:04,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-09 00:54:04,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188365470] [2024-11-09 00:54:04,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:54:04,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:54:04,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:54:04,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:54:04,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:54:04,122 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-09 00:54:04,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:54:04,281 INFO L93 Difference]: Finished difference Result 107 states and 150 transitions. [2024-11-09 00:54:04,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:54:04,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 125 [2024-11-09 00:54:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:54:04,286 INFO L225 Difference]: With dead ends: 107 [2024-11-09 00:54:04,286 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 00:54:04,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:54:04,290 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:54:04,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 101 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:54:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 00:54:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-09 00:54:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:54:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2024-11-09 00:54:04,312 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 125 [2024-11-09 00:54:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:54:04,313 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2024-11-09 00:54:04,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-09 00:54:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2024-11-09 00:54:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 00:54:04,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:54:04,317 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:54:04,334 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-11-09 00:54:04,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:54:04,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:54:04,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:54:04,519 INFO L85 PathProgramCache]: Analyzing trace with hash 395572911, now seen corresponding path program 1 times [2024-11-09 00:54:04,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:54:04,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788101333] [2024-11-09 00:54:04,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:04,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:54:04,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:54:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:54:04,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:54:04,642 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:54:04,643 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:54:04,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:54:04,648 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 00:54:04,740 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:54:04,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:54:04 BoogieIcfgContainer [2024-11-09 00:54:04,742 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:54:04,747 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:54:04,747 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:54:04,748 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:54:04,748 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:02" (3/4) ... [2024-11-09 00:54:04,750 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:54:04,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:54:04,752 INFO L158 Benchmark]: Toolchain (without parser) took 3391.70ms. Allocated memory is still 228.6MB. Free memory was 197.8MB in the beginning and 80.9MB in the end (delta: 116.9MB). Peak memory consumption was 115.6MB. Max. memory is 16.1GB. [2024-11-09 00:54:04,752 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:54:04,754 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.79ms. Allocated memory is still 228.6MB. Free memory was 197.6MB in the beginning and 189.2MB in the end (delta: 8.4MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-09 00:54:04,754 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.04ms. Allocated memory is still 228.6MB. Free memory was 189.2MB in the beginning and 186.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:54:04,754 INFO L158 Benchmark]: Boogie Preprocessor took 37.99ms. Allocated memory is still 228.6MB. Free memory was 186.1MB in the beginning and 183.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:54:04,754 INFO L158 Benchmark]: RCFGBuilder took 348.53ms. Allocated memory is still 228.6MB. Free memory was 182.9MB in the beginning and 167.0MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:54:04,754 INFO L158 Benchmark]: TraceAbstraction took 2628.26ms. Allocated memory is still 228.6MB. Free memory was 166.1MB in the beginning and 80.9MB in the end (delta: 85.2MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2024-11-09 00:54:04,754 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 228.6MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:54:04,758 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.13ms. Allocated memory is still 134.2MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.79ms. Allocated memory is still 228.6MB. Free memory was 197.6MB in the beginning and 189.2MB in the end (delta: 8.4MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.04ms. Allocated memory is still 228.6MB. Free memory was 189.2MB in the beginning and 186.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.99ms. Allocated memory is still 228.6MB. Free memory was 186.1MB in the beginning and 183.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.53ms. Allocated memory is still 228.6MB. Free memory was 182.9MB in the beginning and 167.0MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2628.26ms. Allocated memory is still 228.6MB. Free memory was 166.1MB in the beginning and 80.9MB in the end (delta: 85.2MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 228.6MB. Free memory is still 80.9MB. 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 97, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] signed long int var_1_8 = 64; [L28] signed char var_1_11 = 2; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = 2; [L31] float var_1_14 = 31.325; [L32] float var_1_15 = 7.4; [L33] float var_1_16 = 7.375; [L34] unsigned short int var_1_17 = 256; [L35] unsigned short int var_1_19 = 24509; [L36] unsigned short int var_1_20 = 32; [L37] unsigned short int var_1_21 = 4; [L38] signed char last_1_var_1_11 = 2; VAL [isInitial=0, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L61] var_1_4 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L62] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L63] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L63] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L64] var_1_5 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L66] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L66] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L67] var_1_6 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L68] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L69] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L69] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L70] var_1_7 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L71] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L72] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L72] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L73] var_1_12 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L74] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L75] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L75] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L76] var_1_13 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L77] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L78] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L78] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L79] var_1_15 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L80] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L82] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L83] var_1_19 = __VERIFIER_nondet_ushort() [L84] CALL assume_abort_if_not(var_1_19 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L84] RET assume_abort_if_not(var_1_19 >= 16383) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L85] CALL assume_abort_if_not(var_1_19 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L85] RET assume_abort_if_not(var_1_19 <= 32767) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L86] var_1_20 = __VERIFIER_nondet_ushort() [L87] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L87] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L88] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L88] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L89] var_1_21 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L90] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L91] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L91] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L105] RET updateVariables() [L106] CALL step() [L42] COND FALSE !(((((16) < 0 ) ? -(16) : (16))) < last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L45] var_1_14 = (var_1_15 - var_1_16) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L46] COND TRUE var_1_14 <= ((var_1_15 - var_1_16) * var_1_14) [L47] var_1_17 = ((var_1_19 - var_1_20) + var_1_21) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L51] COND FALSE !(var_1_17 >= (8u * var_1_17)) [L54] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=-255, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L56] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=-255, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L106] RET step() [L107] CALL, EXPR property() [L97-L98] return (((((var_1_17 >= (8u * var_1_17)) ? (var_1_1 == ((unsigned char) (! (var_1_4 || (var_1_5 || var_1_6))))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_5 ? (var_1_8 == ((signed long int) (var_1_17 + var_1_11))) : 1)) && ((((((16) < 0 ) ? -(16) : (16))) < last_1_var_1_11) ? (var_1_11 == ((signed char) (var_1_12 + var_1_13))) : 1)) && (var_1_14 == ((float) (var_1_15 - var_1_16)))) && ((var_1_14 <= ((var_1_15 - var_1_16) * var_1_14)) ? (var_1_17 == ((unsigned short int) ((var_1_19 - var_1_20) + var_1_21))) : (var_1_17 == ((unsigned short int) var_1_20))) ; VAL [\result=0, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=-255, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=-255, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=-255, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119 IncrementalHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 190 mSDtfsCounter, 119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 391 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 625 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 1366 SizeOfPredicates, 1 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 3656/3800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 00:54:04,781 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.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 21c88489aa138dbbc6ea2b63fbc507bc3a819b70c71c9b1f4d3d14d1012d804f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:54:06,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:54:06,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:54:07,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:54:07,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:54:07,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:54:07,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:54:07,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:54:07,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:54:07,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:54:07,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:54:07,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:54:07,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:54:07,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:54:07,048 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:54:07,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:54:07,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:54:07,049 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:54:07,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:54:07,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:54:07,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:54:07,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:54:07,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:54:07,055 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:54:07,055 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:54:07,056 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:54:07,056 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:54:07,056 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:54:07,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:54:07,057 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:54:07,057 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:54:07,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:54:07,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:54:07,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:54:07,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:54:07,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:54:07,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:54:07,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:54:07,062 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:54:07,062 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:54:07,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:54:07,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:54:07,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:54:07,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:54:07,065 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 -> 21c88489aa138dbbc6ea2b63fbc507bc3a819b70c71c9b1f4d3d14d1012d804f [2024-11-09 00:54:07,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:54:07,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:54:07,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:54:07,361 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:54:07,365 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:54:07,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.i [2024-11-09 00:54:08,717 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:54:08,913 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:54:08,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.i [2024-11-09 00:54:08,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/073e41640/184467d224cc4b728d873db8f9c2361a/FLAG128034577 [2024-11-09 00:54:09,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/073e41640/184467d224cc4b728d873db8f9c2361a [2024-11-09 00:54:09,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:54:09,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:54:09,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:54:09,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:54:09,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:54:09,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:54:09" (1/1) ... [2024-11-09 00:54:09,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd04878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:09, skipping insertion in model container [2024-11-09 00:54:09,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:54:09" (1/1) ... [2024-11-09 00:54:09,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:54:09,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.i[914,927] [2024-11-09 00:54:09,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:54:09,510 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:54:09,520 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.i[914,927] [2024-11-09 00:54:09,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:54:09,578 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:54:09,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:09 WrapperNode [2024-11-09 00:54:09,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:54:09,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:54:09,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:54:09,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:54:09,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:09" (1/1) ... [2024-11-09 00:54:09,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:09" (1/1) ... [2024-11-09 00:54:09,617 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-09 00:54:09,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:54:09,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:54:09,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:54:09,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:54:09,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:09" (1/1) ... [2024-11-09 00:54:09,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:09" (1/1) ... [2024-11-09 00:54:09,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:09" (1/1) ... [2024-11-09 00:54:09,647 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:54:09,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:09" (1/1) ... [2024-11-09 00:54:09,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:09" (1/1) ... [2024-11-09 00:54:09,660 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:09" (1/1) ... [2024-11-09 00:54:09,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:09" (1/1) ... [2024-11-09 00:54:09,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:09" (1/1) ... [2024-11-09 00:54:09,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:09" (1/1) ... [2024-11-09 00:54:09,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:54:09,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:54:09,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:54:09,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:54:09,676 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:09" (1/1) ... [2024-11-09 00:54:09,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:54:09,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:54:09,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:54:09,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:54:09,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:54:09,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:54:09,745 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:54:09,745 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:54:09,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:54:09,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:54:09,805 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:54:09,808 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:54:11,251 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:54:11,251 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:54:11,266 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:54:11,267 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:54:11,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:11 BoogieIcfgContainer [2024-11-09 00:54:11,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:54:11,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:54:11,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:54:11,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:54:11,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:54:09" (1/3) ... [2024-11-09 00:54:11,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ddb320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:54:11, skipping insertion in model container [2024-11-09 00:54:11,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:09" (2/3) ... [2024-11-09 00:54:11,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ddb320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:54:11, skipping insertion in model container [2024-11-09 00:54:11,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:11" (3/3) ... [2024-11-09 00:54:11,274 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-8.i [2024-11-09 00:54:11,287 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:54:11,287 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:54:11,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:54:11,341 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;@436e6847, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:54:11,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:54:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:54:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 00:54:11,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:54:11,359 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:54:11,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:54:11,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:54:11,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1472964719, now seen corresponding path program 1 times [2024-11-09 00:54:11,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:54:11,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87391534] [2024-11-09 00:54:11,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:11,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:54:11,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:54:11,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:54:11,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:54:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:11,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:54:11,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:54:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-09 00:54:11,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:54:11,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:54:11,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87391534] [2024-11-09 00:54:11,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87391534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:54:11,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:54:11,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:54:11,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161101790] [2024-11-09 00:54:11,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:54:11,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:54:11,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:54:11,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:54:11,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:54:11,816 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:54:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:54:11,847 INFO L93 Difference]: Finished difference Result 103 states and 176 transitions. [2024-11-09 00:54:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:54:11,852 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-11-09 00:54:11,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:54:11,859 INFO L225 Difference]: With dead ends: 103 [2024-11-09 00:54:11,859 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 00:54:11,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:54:11,867 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:54:11,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:54:11,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 00:54:11,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-09 00:54:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:54:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2024-11-09 00:54:11,910 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 125 [2024-11-09 00:54:11,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:54:11,910 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-11-09 00:54:11,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 00:54:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2024-11-09 00:54:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 00:54:11,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:54:11,913 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:54:11,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:54:12,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:54:12,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:54:12,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:54:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash -286332501, now seen corresponding path program 1 times [2024-11-09 00:54:12,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:54:12,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798549986] [2024-11-09 00:54:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:12,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:54:12,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:54:12,122 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:54:12,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:54:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:12,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 00:54:12,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:54:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-09 00:54:12,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:54:12,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:54:12,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798549986] [2024-11-09 00:54:12,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798549986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:54:12,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:54:12,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:54:12,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455815925] [2024-11-09 00:54:12,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:54:12,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:54:12,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:54:12,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:54:12,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:54:12,606 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:54:13,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:54:13,027 INFO L93 Difference]: Finished difference Result 99 states and 145 transitions. [2024-11-09 00:54:13,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:54:13,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-11-09 00:54:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:54:13,039 INFO L225 Difference]: With dead ends: 99 [2024-11-09 00:54:13,039 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 00:54:13,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:54:13,042 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:54:13,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 69 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 00:54:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 00:54:13,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-09 00:54:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:54:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-09 00:54:13,059 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 125 [2024-11-09 00:54:13,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:54:13,063 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-09 00:54:13,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-09 00:54:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-09 00:54:13,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 00:54:13,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:54:13,066 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:54:13,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 00:54:13,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:54:13,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:54:13,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:54:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash 393725869, now seen corresponding path program 1 times [2024-11-09 00:54:13,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:54:13,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097337112] [2024-11-09 00:54:13,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:13,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:54:13,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:54:13,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:54:13,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 00:54:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:13,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 00:54:13,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:54:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-09 00:54:13,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:54:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-09 00:54:13,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:54:13,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097337112] [2024-11-09 00:54:13,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097337112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:54:13,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:54:13,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-09 00:54:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023570628] [2024-11-09 00:54:13,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:54:13,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:54:13,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:54:13,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:54:13,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:54:13,825 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-09 00:54:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:54:14,596 INFO L93 Difference]: Finished difference Result 107 states and 150 transitions. [2024-11-09 00:54:14,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:54:14,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 125 [2024-11-09 00:54:14,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:54:14,610 INFO L225 Difference]: With dead ends: 107 [2024-11-09 00:54:14,610 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 00:54:14,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:54:14,612 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:54:14,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 99 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 00:54:14,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 00:54:14,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-09 00:54:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 00:54:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2024-11-09 00:54:14,624 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 125 [2024-11-09 00:54:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:54:14,624 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2024-11-09 00:54:14,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-09 00:54:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2024-11-09 00:54:14,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 00:54:14,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:54:14,626 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:54:14,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 00:54:14,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:54:14,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:54:14,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:54:14,831 INFO L85 PathProgramCache]: Analyzing trace with hash 395572911, now seen corresponding path program 1 times [2024-11-09 00:54:14,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:54:14,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386959266] [2024-11-09 00:54:14,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:14,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:54:14,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:54:14,836 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:54:14,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 00:54:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:15,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 00:54:15,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:54:41,859 WARN L286 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:55:08,906 WARN L286 SmtUtils]: Spent 9.33s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)