./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_floatingpointinfluence_has-floats_file-18.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 20590a3b952f77870c005ea22da4ee2c3e5fa42d319fcea291376108e5b76f76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:21:24,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:21:24,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:21:24,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:21:24,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:21:24,983 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:21:24,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:21:24,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:21:24,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:21:24,984 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:21:24,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:21:24,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:21:24,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:21:24,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:21:24,985 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:21:24,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:21:24,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:21:24,985 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:21:24,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:21:24,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:21:24,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:21:24,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:21:24,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:21:24,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:21:24,986 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:21:24,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:21:24,986 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:21:24,986 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:21:24,986 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:21:24,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:21:24,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:21:24,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:21:24,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:21:24,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:21:24,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:21:24,987 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:21:24,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:21:24,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:21:24,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:21:24,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:21:24,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:21:24,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:21:24,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:21:24,988 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 20590a3b952f77870c005ea22da4ee2c3e5fa42d319fcea291376108e5b76f76 [2025-03-03 22:21:25,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:21:25,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:21:25,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:21:25,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:21:25,199 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:21:25,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i [2025-03-03 22:21:26,294 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4662fdc11/3f1bcbfa39bf421f95730e27614d7bae/FLAG254068552 [2025-03-03 22:21:26,521 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:21:26,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i [2025-03-03 22:21:26,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4662fdc11/3f1bcbfa39bf421f95730e27614d7bae/FLAG254068552 [2025-03-03 22:21:26,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4662fdc11/3f1bcbfa39bf421f95730e27614d7bae [2025-03-03 22:21:26,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:21:26,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:21:26,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:21:26,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:21:26,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:21:26,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:21:26" (1/1) ... [2025-03-03 22:21:26,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d1cd8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:26, skipping insertion in model container [2025-03-03 22:21:26,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:21:26" (1/1) ... [2025-03-03 22:21:26,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:21:26,698 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_floatingpointinfluence_has-floats_file-18.i[917,930] [2025-03-03 22:21:26,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:21:26,754 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:21:26,763 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_floatingpointinfluence_has-floats_file-18.i[917,930] [2025-03-03 22:21:26,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:21:26,803 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:21:26,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:26 WrapperNode [2025-03-03 22:21:26,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:21:26,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:21:26,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:21:26,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:21:26,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:26" (1/1) ... [2025-03-03 22:21:26,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:26" (1/1) ... [2025-03-03 22:21:26,851 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2025-03-03 22:21:26,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:21:26,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:21:26,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:21:26,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:21:26,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:26" (1/1) ... [2025-03-03 22:21:26,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:26" (1/1) ... [2025-03-03 22:21:26,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:26" (1/1) ... [2025-03-03 22:21:26,885 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]. [2025-03-03 22:21:26,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:26" (1/1) ... [2025-03-03 22:21:26,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:26" (1/1) ... [2025-03-03 22:21:26,893 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:26" (1/1) ... [2025-03-03 22:21:26,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:26" (1/1) ... [2025-03-03 22:21:26,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:26" (1/1) ... [2025-03-03 22:21:26,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:26" (1/1) ... [2025-03-03 22:21:26,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:21:26,905 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:21:26,908 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:21:26,908 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:21:26,909 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:26" (1/1) ... [2025-03-03 22:21:26,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:21:26,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:21:26,936 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) [2025-03-03 22:21:26,939 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 [2025-03-03 22:21:26,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:21:26,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:21:26,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:21:26,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:21:26,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:21:26,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:21:27,012 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:21:27,014 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:21:27,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: havoc property_#t~bitwise13#1;havoc property_#t~bitwise14#1;havoc property_#t~short15#1; [2025-03-03 22:21:27,282 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 22:21:27,282 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:21:27,299 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:21:27,299 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:21:27,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:21:27 BoogieIcfgContainer [2025-03-03 22:21:27,300 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:21:27,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:21:27,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:21:27,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:21:27,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:21:26" (1/3) ... [2025-03-03 22:21:27,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2428d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:21:27, skipping insertion in model container [2025-03-03 22:21:27,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:26" (2/3) ... [2025-03-03 22:21:27,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2428d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:21:27, skipping insertion in model container [2025-03-03 22:21:27,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:21:27" (3/3) ... [2025-03-03 22:21:27,306 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-18.i [2025-03-03 22:21:27,317 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:21:27,319 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-18.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:21:27,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:21:27,368 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;@342dffae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:21:27,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:21:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 48 states have (on average 1.4375) internal successors, (69), 49 states have internal predecessors, (69), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:21:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 22:21:27,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:21:27,379 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:21:27,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:21:27,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:21:27,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1698747661, now seen corresponding path program 1 times [2025-03-03 22:21:27,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:21:27,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127306623] [2025-03-03 22:21:27,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:27,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:21:27,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 22:21:27,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 22:21:27,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:27,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:21:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 22:21:27,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:21:27,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127306623] [2025-03-03 22:21:27,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127306623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:21:27,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713834329] [2025-03-03 22:21:27,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:27,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:21:27,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:21:27,580 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) [2025-03-03 22:21:27,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:21:27,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 22:21:27,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 22:21:27,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:27,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:21:27,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:21:27,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:21:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 22:21:27,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:21:27,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713834329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:21:27,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:21:27,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:21:27,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46352817] [2025-03-03 22:21:27,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:21:27,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:21:27,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:21:27,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:21:27,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:21:27,727 INFO L87 Difference]: Start difference. First operand has 63 states, 48 states have (on average 1.4375) internal successors, (69), 49 states have internal predecessors, (69), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 22:21:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:21:27,767 INFO L93 Difference]: Finished difference Result 120 states and 193 transitions. [2025-03-03 22:21:27,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:21:27,769 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2025-03-03 22:21:27,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:21:27,773 INFO L225 Difference]: With dead ends: 120 [2025-03-03 22:21:27,773 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 22:21:27,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:21:27,778 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:21:27,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:21:27,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 22:21:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-03 22:21:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:21:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2025-03-03 22:21:27,805 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 87 [2025-03-03 22:21:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:21:27,806 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2025-03-03 22:21:27,806 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 22:21:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2025-03-03 22:21:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 22:21:27,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:21:27,811 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:21:27,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 22:21:28,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:21:28,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:21:28,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:21:28,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1310856465, now seen corresponding path program 1 times [2025-03-03 22:21:28,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:21:28,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592261932] [2025-03-03 22:21:28,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:28,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:21:28,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 22:21:28,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 22:21:28,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:28,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:21:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:21:28,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:21:28,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592261932] [2025-03-03 22:21:28,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592261932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:21:28,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:21:28,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:21:28,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154504606] [2025-03-03 22:21:28,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:21:28,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:21:28,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:21:28,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:21:28,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:21:28,298 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:21:28,421 INFO L93 Difference]: Finished difference Result 174 states and 258 transitions. [2025-03-03 22:21:28,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:21:28,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2025-03-03 22:21:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:21:28,423 INFO L225 Difference]: With dead ends: 174 [2025-03-03 22:21:28,425 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 22:21:28,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:21:28,426 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 54 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:21:28,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 131 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:21:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 22:21:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2025-03-03 22:21:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:21:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions. [2025-03-03 22:21:28,440 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 166 transitions. Word has length 87 [2025-03-03 22:21:28,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:21:28,441 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 166 transitions. [2025-03-03 22:21:28,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 166 transitions. [2025-03-03 22:21:28,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 22:21:28,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:21:28,442 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:21:28,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:21:28,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:21:28,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:21:28,443 INFO L85 PathProgramCache]: Analyzing trace with hash 965988472, now seen corresponding path program 1 times [2025-03-03 22:21:28,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:21:28,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211675587] [2025-03-03 22:21:28,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:28,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:21:28,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 22:21:28,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 22:21:28,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:28,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:21:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 22:21:28,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:21:28,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211675587] [2025-03-03 22:21:28,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211675587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:21:28,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242472540] [2025-03-03 22:21:28,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:28,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:21:28,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:21:28,898 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:21:28,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:21:28,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 22:21:28,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 22:21:28,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:28,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:21:28,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 22:21:28,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:21:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-03 22:21:29,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:21:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 22:21:29,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242472540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:21:29,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:21:29,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2025-03-03 22:21:29,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653476479] [2025-03-03 22:21:29,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:21:29,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 22:21:29,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:21:29,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 22:21:29,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-03-03 22:21:29,627 INFO L87 Difference]: Start difference. First operand 114 states and 166 transitions. Second operand has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-03 22:21:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:21:30,487 INFO L93 Difference]: Finished difference Result 366 states and 521 transitions. [2025-03-03 22:21:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 22:21:30,488 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) Word has length 88 [2025-03-03 22:21:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:21:30,490 INFO L225 Difference]: With dead ends: 366 [2025-03-03 22:21:30,491 INFO L226 Difference]: Without dead ends: 255 [2025-03-03 22:21:30,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 22:21:30,494 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 242 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:21:30,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 482 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 22:21:30,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-03 22:21:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 245. [2025-03-03 22:21:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 188 states have (on average 1.2234042553191489) internal successors, (230), 188 states have internal predecessors, (230), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 22:21:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 326 transitions. [2025-03-03 22:21:30,528 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 326 transitions. Word has length 88 [2025-03-03 22:21:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:21:30,528 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 326 transitions. [2025-03-03 22:21:30,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-03 22:21:30,528 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 326 transitions. [2025-03-03 22:21:30,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 22:21:30,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:21:30,529 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:21:30,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:21:30,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 22:21:30,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:21:30,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:21:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1948434226, now seen corresponding path program 1 times [2025-03-03 22:21:30,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:21:30,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571018677] [2025-03-03 22:21:30,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:30,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:21:30,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 22:21:30,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 22:21:30,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:30,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:21:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:21:33,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:21:33,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571018677] [2025-03-03 22:21:33,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571018677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:21:33,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:21:33,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 22:21:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498825280] [2025-03-03 22:21:33,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:21:33,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 22:21:33,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:21:33,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 22:21:33,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-03 22:21:33,415 INFO L87 Difference]: Start difference. First operand 245 states and 326 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:34,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:21:34,990 INFO L93 Difference]: Finished difference Result 648 states and 845 transitions. [2025-03-03 22:21:34,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:21:34,990 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2025-03-03 22:21:34,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:21:34,992 INFO L225 Difference]: With dead ends: 648 [2025-03-03 22:21:34,993 INFO L226 Difference]: Without dead ends: 406 [2025-03-03 22:21:34,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2025-03-03 22:21:34,994 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 556 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:21:34,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 512 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:21:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-03 22:21:35,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 257. [2025-03-03 22:21:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 200 states have (on average 1.215) internal successors, (243), 200 states have internal predecessors, (243), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 22:21:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 339 transitions. [2025-03-03 22:21:35,022 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 339 transitions. Word has length 89 [2025-03-03 22:21:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:21:35,023 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 339 transitions. [2025-03-03 22:21:35,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 339 transitions. [2025-03-03 22:21:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 22:21:35,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:21:35,025 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:21:35,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:21:35,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:21:35,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:21:35,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1835998893, now seen corresponding path program 1 times [2025-03-03 22:21:35,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:21:35,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853941453] [2025-03-03 22:21:35,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:35,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:21:35,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 22:21:35,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 22:21:35,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:35,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:21:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:21:36,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:21:36,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853941453] [2025-03-03 22:21:36,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853941453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:21:36,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:21:36,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 22:21:36,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986007687] [2025-03-03 22:21:36,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:21:36,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 22:21:36,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:21:36,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 22:21:36,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:21:36,166 INFO L87 Difference]: Start difference. First operand 257 states and 339 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:21:37,378 INFO L93 Difference]: Finished difference Result 474 states and 604 transitions. [2025-03-03 22:21:37,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:21:37,379 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2025-03-03 22:21:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:21:37,381 INFO L225 Difference]: With dead ends: 474 [2025-03-03 22:21:37,381 INFO L226 Difference]: Without dead ends: 411 [2025-03-03 22:21:37,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2025-03-03 22:21:37,382 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 327 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 22:21:37,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 548 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 22:21:37,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-03 22:21:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 257. [2025-03-03 22:21:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 200 states have (on average 1.215) internal successors, (243), 200 states have internal predecessors, (243), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 22:21:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 339 transitions. [2025-03-03 22:21:37,420 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 339 transitions. Word has length 89 [2025-03-03 22:21:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:21:37,421 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 339 transitions. [2025-03-03 22:21:37,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 339 transitions. [2025-03-03 22:21:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 22:21:37,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:21:37,424 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:21:37,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:21:37,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:21:37,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:21:37,425 INFO L85 PathProgramCache]: Analyzing trace with hash -241565316, now seen corresponding path program 1 times [2025-03-03 22:21:37,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:21:37,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666572925] [2025-03-03 22:21:37,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:37,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:21:37,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 22:21:37,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 22:21:37,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:37,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:21:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:21:37,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:21:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666572925] [2025-03-03 22:21:37,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666572925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:21:37,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:21:37,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:21:37,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189486893] [2025-03-03 22:21:37,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:21:37,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:21:37,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:21:37,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:21:37,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:21:37,505 INFO L87 Difference]: Start difference. First operand 257 states and 339 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:37,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:21:37,533 INFO L93 Difference]: Finished difference Result 516 states and 685 transitions. [2025-03-03 22:21:37,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:21:37,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2025-03-03 22:21:37,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:21:37,536 INFO L225 Difference]: With dead ends: 516 [2025-03-03 22:21:37,536 INFO L226 Difference]: Without dead ends: 262 [2025-03-03 22:21:37,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:21:37,537 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:21:37,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:21:37,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-03 22:21:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2025-03-03 22:21:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 203 states have (on average 1.2118226600985222) internal successors, (246), 203 states have internal predecessors, (246), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 22:21:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 342 transitions. [2025-03-03 22:21:37,566 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 342 transitions. Word has length 90 [2025-03-03 22:21:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:21:37,566 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 342 transitions. [2025-03-03 22:21:37,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:37,567 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 342 transitions. [2025-03-03 22:21:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 22:21:37,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:21:37,568 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:21:37,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:21:37,568 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:21:37,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:21:37,569 INFO L85 PathProgramCache]: Analyzing trace with hash -665949364, now seen corresponding path program 1 times [2025-03-03 22:21:37,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:21:37,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128683686] [2025-03-03 22:21:37,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:37,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:21:37,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 22:21:37,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 22:21:37,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:37,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:21:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:21:37,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:21:37,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128683686] [2025-03-03 22:21:37,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128683686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:21:37,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:21:37,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 22:21:37,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057002077] [2025-03-03 22:21:37,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:21:37,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:21:37,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:21:37,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:21:37,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:21:37,964 INFO L87 Difference]: Start difference. First operand 260 states and 342 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:21:38,090 INFO L93 Difference]: Finished difference Result 324 states and 416 transitions. [2025-03-03 22:21:38,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:21:38,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2025-03-03 22:21:38,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:21:38,093 INFO L225 Difference]: With dead ends: 324 [2025-03-03 22:21:38,093 INFO L226 Difference]: Without dead ends: 322 [2025-03-03 22:21:38,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:21:38,094 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 25 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:21:38,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 310 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:21:38,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-03 22:21:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 306. [2025-03-03 22:21:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 249 states have (on average 1.2048192771084338) internal successors, (300), 249 states have internal predecessors, (300), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 22:21:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 396 transitions. [2025-03-03 22:21:38,121 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 396 transitions. Word has length 91 [2025-03-03 22:21:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:21:38,121 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 396 transitions. [2025-03-03 22:21:38,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 396 transitions. [2025-03-03 22:21:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 22:21:38,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:21:38,122 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:21:38,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:21:38,123 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:21:38,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:21:38,123 INFO L85 PathProgramCache]: Analyzing trace with hash -366631721, now seen corresponding path program 1 times [2025-03-03 22:21:38,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:21:38,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80535508] [2025-03-03 22:21:38,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:38,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:21:38,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 22:21:38,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 22:21:38,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:38,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:21:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:21:38,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:21:38,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80535508] [2025-03-03 22:21:38,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80535508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:21:38,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:21:38,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:21:38,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70942807] [2025-03-03 22:21:38,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:21:38,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:21:38,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:21:38,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:21:38,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:21:38,166 INFO L87 Difference]: Start difference. First operand 306 states and 396 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:38,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:21:38,227 INFO L93 Difference]: Finished difference Result 519 states and 678 transitions. [2025-03-03 22:21:38,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:21:38,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2025-03-03 22:21:38,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:21:38,229 INFO L225 Difference]: With dead ends: 519 [2025-03-03 22:21:38,229 INFO L226 Difference]: Without dead ends: 355 [2025-03-03 22:21:38,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:21:38,230 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 67 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:21:38,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 117 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:21:38,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-03 22:21:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 207. [2025-03-03 22:21:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 164 states have (on average 1.1890243902439024) internal successors, (195), 164 states have internal predecessors, (195), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 22:21:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 267 transitions. [2025-03-03 22:21:38,253 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 267 transitions. Word has length 91 [2025-03-03 22:21:38,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:21:38,254 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 267 transitions. [2025-03-03 22:21:38,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 267 transitions. [2025-03-03 22:21:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 22:21:38,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:21:38,255 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:21:38,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 22:21:38,255 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:21:38,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:21:38,256 INFO L85 PathProgramCache]: Analyzing trace with hash -432766636, now seen corresponding path program 1 times [2025-03-03 22:21:38,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:21:38,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819084791] [2025-03-03 22:21:38,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:21:38,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 22:21:38,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 22:21:38,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:38,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:21:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:21:38,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:21:38,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819084791] [2025-03-03 22:21:38,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819084791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:21:38,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:21:38,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:21:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617385463] [2025-03-03 22:21:38,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:21:38,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:21:38,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:21:38,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:21:38,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:21:38,289 INFO L87 Difference]: Start difference. First operand 207 states and 267 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:21:38,350 INFO L93 Difference]: Finished difference Result 348 states and 448 transitions. [2025-03-03 22:21:38,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:21:38,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 92 [2025-03-03 22:21:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:21:38,352 INFO L225 Difference]: With dead ends: 348 [2025-03-03 22:21:38,352 INFO L226 Difference]: Without dead ends: 214 [2025-03-03 22:21:38,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:21:38,353 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 53 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:21:38,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 164 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:21:38,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-03 22:21:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2025-03-03 22:21:38,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 168 states have (on average 1.1666666666666667) internal successors, (196), 168 states have internal predecessors, (196), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 22:21:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 268 transitions. [2025-03-03 22:21:38,370 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 268 transitions. Word has length 92 [2025-03-03 22:21:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:21:38,370 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 268 transitions. [2025-03-03 22:21:38,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 268 transitions. [2025-03-03 22:21:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 22:21:38,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:21:38,372 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:21:38,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 22:21:38,372 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:21:38,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:21:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1741316740, now seen corresponding path program 1 times [2025-03-03 22:21:38,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:21:38,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385705073] [2025-03-03 22:21:38,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:38,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:21:38,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 22:21:38,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 22:21:38,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:38,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:21:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 22:21:38,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:21:38,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385705073] [2025-03-03 22:21:38,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385705073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:21:38,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:21:38,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:21:38,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191773902] [2025-03-03 22:21:38,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:21:38,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:21:38,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:21:38,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:21:38,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:21:38,695 INFO L87 Difference]: Start difference. First operand 211 states and 268 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:38,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:21:38,850 INFO L93 Difference]: Finished difference Result 376 states and 470 transitions. [2025-03-03 22:21:38,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:21:38,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 93 [2025-03-03 22:21:38,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:21:38,855 INFO L225 Difference]: With dead ends: 376 [2025-03-03 22:21:38,855 INFO L226 Difference]: Without dead ends: 233 [2025-03-03 22:21:38,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:21:38,856 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 85 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:21:38,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 294 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:21:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-03 22:21:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 207. [2025-03-03 22:21:38,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 164 states have (on average 1.146341463414634) internal successors, (188), 164 states have internal predecessors, (188), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 22:21:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 260 transitions. [2025-03-03 22:21:38,870 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 260 transitions. Word has length 93 [2025-03-03 22:21:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:21:38,870 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 260 transitions. [2025-03-03 22:21:38,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 22:21:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 260 transitions. [2025-03-03 22:21:38,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 22:21:38,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:21:38,871 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:21:38,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 22:21:38,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:21:38,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:21:38,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1676515873, now seen corresponding path program 1 times [2025-03-03 22:21:38,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:21:38,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395710703] [2025-03-03 22:21:38,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:38,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:21:38,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 22:21:38,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 22:21:38,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:38,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:21:38,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093081041] [2025-03-03 22:21:38,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:38,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:21:38,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:21:38,911 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:21:38,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 22:21:38,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 22:21:38,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 22:21:38,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:38,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:21:38,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:21:38,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 22:21:38,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 22:21:38,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:38,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:21:39,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:21:39,026 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:21:39,027 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:21:39,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 22:21:39,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:21:39,234 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:21:39,281 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:21:39,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:21:39 BoogieIcfgContainer [2025-03-03 22:21:39,285 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:21:39,285 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:21:39,286 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:21:39,286 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:21:39,286 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:21:27" (3/4) ... [2025-03-03 22:21:39,288 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:21:39,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:21:39,289 INFO L158 Benchmark]: Toolchain (without parser) took 12708.79ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 106.3MB in the beginning and 245.0MB in the end (delta: -138.6MB). Peak memory consumption was 141.5MB. Max. memory is 16.1GB. [2025-03-03 22:21:39,289 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:21:39,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.55ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 93.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:21:39,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.43ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.0MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:21:39,290 INFO L158 Benchmark]: Boogie Preprocessor took 48.78ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:21:39,290 INFO L158 Benchmark]: IcfgBuilder took 394.78ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 64.9MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 22:21:39,290 INFO L158 Benchmark]: TraceAbstraction took 11983.15ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 64.9MB in the beginning and 245.0MB in the end (delta: -180.2MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. [2025-03-03 22:21:39,290 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 419.4MB. Free memory was 245.0MB in the beginning and 245.0MB in the end (delta: 87.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:21:39,291 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.42ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.55ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 93.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.43ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.0MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.78ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 394.78ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 64.9MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11983.15ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 64.9MB in the beginning and 245.0MB in the end (delta: -180.2MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 419.4MB. Free memory was 245.0MB in the beginning and 245.0MB in the end (delta: 87.1kB). Peak memory consumption was 8.4MB. 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 89, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of bitwiseOr at line 89, overapproximation of bitwiseOr at line 54, overapproximation of bitwiseAnd at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99.25; [L23] signed short int var_1_7 = 18477; [L24] signed short int var_1_8 = 5; [L25] float var_1_9 = 5.8; [L26] float var_1_10 = 0.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 256; [L31] unsigned char var_1_15 = 0; [L32] unsigned char last_1_var_1_11 = 16; [L33] unsigned long int last_1_var_1_14 = 256; VAL [isInitial=0, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=18477, var_1_8=5, var_1_9=29/5] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L85] last_1_var_1_11 = var_1_11 [L86] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=18477, var_1_8=5, var_1_9=29/5] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L64] var_1_7 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=5, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=5, var_1_9=29/5] [L65] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=5, var_1_9=29/5] [L66] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=5, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=5, var_1_9=29/5] [L66] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=5, var_1_9=29/5] [L67] var_1_8 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256, var_1_9=29/5] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256, var_1_9=29/5] [L69] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256, var_1_9=29/5] [L69] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256, var_1_9=29/5] [L70] var_1_9 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L71] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L72] var_1_10 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L73] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L74] var_1_12 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L75] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L76] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L76] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L77] var_1_13 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L78] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L79] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L79] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L80] var_1_15 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L81] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L82] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L82] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L97] RET updateVariables() [L98] CALL step() [L37] signed short int stepLocal_3 = var_1_8; [L38] unsigned long int stepLocal_2 = last_1_var_1_14; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, stepLocal_3=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L39] COND FALSE !(last_1_var_1_14 > stepLocal_3) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L46] EXPR var_1_11 & var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L46] COND FALSE !((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) [L51] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L53] unsigned char stepLocal_1 = var_1_11; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L54] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=397/4, var_1_7=16383, var_1_8=256] [L54] unsigned long int stepLocal_0 = var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))); [L55] COND FALSE !(stepLocal_0 != var_1_11) [L60] var_1_1 = 10.5f VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=21/2, var_1_7=16383, var_1_8=256] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=21/2, var_1_7=16383, var_1_8=256] [L89] EXPR ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((float) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=21/2, var_1_7=16383, var_1_8=256] [L89-L90] return ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((float) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=21/2, var_1_7=16383, var_1_8=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=16383, var_1_15=0, var_1_1=21/2, var_1_7=16383, var_1_8=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 11, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1409 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1409 mSDsluCounter, 2790 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1952 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3312 IncrementalHoareTripleChecker+Invalid, 3531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 838 mSDtfsCounter, 3312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=7, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 511 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1262 NumberOfCodeBlocks, 1262 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1147 ConstructedInterpolants, 0 QuantifiedInterpolants, 4677 SizeOfPredicates, 4 NumberOfNonLiveVariables, 431 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 3311/3432 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 22:21:39,349 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/21.0.5-tem/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.6.800.v20240513-1750.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_floatingpointinfluence_has-floats_file-18.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 20590a3b952f77870c005ea22da4ee2c3e5fa42d319fcea291376108e5b76f76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:21:41,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:21:41,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:21:41,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:21:41,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:21:41,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:21:41,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:21:41,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:21:41,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:21:41,221 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:21:41,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:21:41,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:21:41,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:21:41,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:21:41,222 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:21:41,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:21:41,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:21:41,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:21:41,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:21:41,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:21:41,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:21:41,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:21:41,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:21:41,223 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:21:41,224 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:21:41,224 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:21:41,224 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:21:41,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:21:41,224 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:21:41,224 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:21:41,224 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:21:41,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:21:41,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:21:41,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:21:41,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:21:41,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:21:41,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:21:41,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:21:41,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:21:41,225 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:21:41,225 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:21:41,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:21:41,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:21:41,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:21:41,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:21:41,226 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 20590a3b952f77870c005ea22da4ee2c3e5fa42d319fcea291376108e5b76f76 [2025-03-03 22:21:41,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:21:41,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:21:41,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:21:41,443 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:21:41,445 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:21:41,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i [2025-03-03 22:21:42,636 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d428220/aef616e13fa3499dbb0f765c6632b074/FLAG584e5e020 [2025-03-03 22:21:42,811 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:21:42,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i [2025-03-03 22:21:42,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d428220/aef616e13fa3499dbb0f765c6632b074/FLAG584e5e020 [2025-03-03 22:21:42,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d428220/aef616e13fa3499dbb0f765c6632b074 [2025-03-03 22:21:42,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:21:42,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:21:42,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:21:42,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:21:42,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:21:42,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:21:42" (1/1) ... [2025-03-03 22:21:42,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5205c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:42, skipping insertion in model container [2025-03-03 22:21:42,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:21:42" (1/1) ... [2025-03-03 22:21:42,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:21:42,963 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_floatingpointinfluence_has-floats_file-18.i[917,930] [2025-03-03 22:21:43,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:21:43,016 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:21:43,024 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_floatingpointinfluence_has-floats_file-18.i[917,930] [2025-03-03 22:21:43,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:21:43,052 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:21:43,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:43 WrapperNode [2025-03-03 22:21:43,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:21:43,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:21:43,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:21:43,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:21:43,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:43" (1/1) ... [2025-03-03 22:21:43,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:43" (1/1) ... [2025-03-03 22:21:43,081 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2025-03-03 22:21:43,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:21:43,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:21:43,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:21:43,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:21:43,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:43" (1/1) ... [2025-03-03 22:21:43,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:43" (1/1) ... [2025-03-03 22:21:43,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:43" (1/1) ... [2025-03-03 22:21:43,109 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]. [2025-03-03 22:21:43,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:43" (1/1) ... [2025-03-03 22:21:43,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:43" (1/1) ... [2025-03-03 22:21:43,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:43" (1/1) ... [2025-03-03 22:21:43,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:43" (1/1) ... [2025-03-03 22:21:43,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:43" (1/1) ... [2025-03-03 22:21:43,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:43" (1/1) ... [2025-03-03 22:21:43,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:21:43,130 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:21:43,130 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:21:43,130 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:21:43,131 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:43" (1/1) ... [2025-03-03 22:21:43,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:21:43,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:21:43,154 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) [2025-03-03 22:21:43,157 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 [2025-03-03 22:21:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:21:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:21:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:21:43,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:21:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:21:43,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:21:43,230 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:21:43,232 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:21:43,434 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 22:21:43,434 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:21:43,441 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:21:43,442 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:21:43,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:21:43 BoogieIcfgContainer [2025-03-03 22:21:43,442 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:21:43,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:21:43,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:21:43,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:21:43,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:21:42" (1/3) ... [2025-03-03 22:21:43,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75838ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:21:43, skipping insertion in model container [2025-03-03 22:21:43,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:21:43" (2/3) ... [2025-03-03 22:21:43,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75838ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:21:43, skipping insertion in model container [2025-03-03 22:21:43,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:21:43" (3/3) ... [2025-03-03 22:21:43,451 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-18.i [2025-03-03 22:21:43,461 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:21:43,462 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-18.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:21:43,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:21:43,503 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;@54a85225, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:21:43,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:21:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:21:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 22:21:43,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:21:43,513 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:21:43,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:21:43,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:21:43,517 INFO L85 PathProgramCache]: Analyzing trace with hash 877425926, now seen corresponding path program 1 times [2025-03-03 22:21:43,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:21:43,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836370397] [2025-03-03 22:21:43,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:43,536 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 [2025-03-03 22:21:43,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:21:43,538 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) [2025-03-03 22:21:43,539 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 [2025-03-03 22:21:43,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 22:21:43,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 22:21:43,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:43,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:21:43,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:21:43,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:21:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-03 22:21:43,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:21:43,695 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:21:43,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836370397] [2025-03-03 22:21:43,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836370397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:21:43,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:21:43,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:21:43,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035617417] [2025-03-03 22:21:43,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:21:43,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:21:43,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:21:43,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:21:43,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:21:43,713 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 22:21:43,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:21:43,725 INFO L93 Difference]: Finished difference Result 82 states and 133 transitions. [2025-03-03 22:21:43,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:21:43,727 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2025-03-03 22:21:43,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:21:43,730 INFO L225 Difference]: With dead ends: 82 [2025-03-03 22:21:43,731 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 22:21:43,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:21:43,735 INFO L435 NwaCegarLoop]: 58 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, 58 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 [2025-03-03 22:21:43,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:21:43,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 22:21:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-03 22:21:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 22:21:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-03-03 22:21:43,769 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 80 [2025-03-03 22:21:43,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:21:43,769 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-03-03 22:21:43,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 22:21:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-03-03 22:21:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 22:21:43,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:21:43,773 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:21:43,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 22:21:43,974 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 [2025-03-03 22:21:43,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:21:43,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:21:43,975 INFO L85 PathProgramCache]: Analyzing trace with hash -918318936, now seen corresponding path program 1 times [2025-03-03 22:21:43,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:21:43,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122877981] [2025-03-03 22:21:43,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:43,976 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 [2025-03-03 22:21:43,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:21:43,979 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) [2025-03-03 22:21:43,980 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 [2025-03-03 22:21:44,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 22:21:44,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 22:21:44,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:44,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:21:44,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 22:21:44,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:21:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-03 22:21:44,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:21:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 22:21:44,911 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:21:44,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122877981] [2025-03-03 22:21:44,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122877981] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:21:44,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:21:44,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-03 22:21:44,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840905251] [2025-03-03 22:21:44,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:21:44,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 22:21:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:21:44,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 22:21:44,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-03 22:21:44,914 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 22:21:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:21:46,216 INFO L93 Difference]: Finished difference Result 213 states and 294 transitions. [2025-03-03 22:21:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 22:21:46,217 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 80 [2025-03-03 22:21:46,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:21:46,221 INFO L225 Difference]: With dead ends: 213 [2025-03-03 22:21:46,222 INFO L226 Difference]: Without dead ends: 175 [2025-03-03 22:21:46,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=494, Unknown=0, NotChecked=0, Total=756 [2025-03-03 22:21:46,224 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 170 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:21:46,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 262 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:21:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-03 22:21:46,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 88. [2025-03-03 22:21:46,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 22:21:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2025-03-03 22:21:46,267 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 80 [2025-03-03 22:21:46,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:21:46,267 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2025-03-03 22:21:46,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 22:21:46,267 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2025-03-03 22:21:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 22:21:46,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:21:46,269 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:21:46,275 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 [2025-03-03 22:21:46,473 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 [2025-03-03 22:21:46,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:21:46,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:21:46,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1627421790, now seen corresponding path program 1 times [2025-03-03 22:21:46,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:21:46,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408269574] [2025-03-03 22:21:46,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:21:46,474 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 [2025-03-03 22:21:46,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:21:46,476 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) [2025-03-03 22:21:46,477 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 [2025-03-03 22:21:46,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 22:21:46,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 22:21:46,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:21:46,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:21:46,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 22:21:46,572 INFO L279 TraceCheckSpWp]: Computing forward predicates...