./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.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 b52051d145fb2b47c7d32126bb345ca7aff8e39890cc67cf57ddb4a3e09751a2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:06:03,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:06:03,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:06:03,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:06:03,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:06:03,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:06:03,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:06:03,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:06:03,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:06:03,751 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:06:03,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:06:03,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:06:03,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:06:03,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:06:03,752 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:06:03,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:06:03,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:06:03,753 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:06:03,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:06:03,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:06:03,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:06:03,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:06:03,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:06:03,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:06:03,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:06:03,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:06:03,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:06:03,758 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:06:03,758 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:06:03,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:06:03,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:06:03,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:06:03,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:06:03,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:06:03,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:06:03,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:06:03,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:06:03,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:06:03,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:06:03,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:06:03,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:06:03,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:06:03,763 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b52051d145fb2b47c7d32126bb345ca7aff8e39890cc67cf57ddb4a3e09751a2 [2024-11-10 09:06:03,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:06:04,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:06:04,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:06:04,016 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:06:04,017 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:06:04,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.i [2024-11-10 09:06:05,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:06:05,710 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:06:05,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.i [2024-11-10 09:06:05,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb25c7e2/b47daca7ea40492492263bc86219e917/FLAGecd480356 [2024-11-10 09:06:05,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb25c7e2/b47daca7ea40492492263bc86219e917 [2024-11-10 09:06:05,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:06:05,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:06:05,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:06:05,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:06:05,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:06:05,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:06:05" (1/1) ... [2024-11-10 09:06:05,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a1b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:05, skipping insertion in model container [2024-11-10 09:06:05,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:06:05" (1/1) ... [2024-11-10 09:06:05,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:06:06,102 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_variablewrapping_normal_file-57.i[913,926] [2024-11-10 09:06:06,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:06:06,202 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:06:06,225 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_variablewrapping_normal_file-57.i[913,926] [2024-11-10 09:06:06,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:06:06,294 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:06:06,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:06 WrapperNode [2024-11-10 09:06:06,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:06:06,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:06:06,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:06:06,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:06:06,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:06" (1/1) ... [2024-11-10 09:06:06,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:06" (1/1) ... [2024-11-10 09:06:06,371 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-10 09:06:06,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:06:06,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:06:06,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:06:06,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:06:06,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:06" (1/1) ... [2024-11-10 09:06:06,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:06" (1/1) ... [2024-11-10 09:06:06,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:06" (1/1) ... [2024-11-10 09:06:06,394 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 09:06:06,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:06" (1/1) ... [2024-11-10 09:06:06,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:06" (1/1) ... [2024-11-10 09:06:06,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:06" (1/1) ... [2024-11-10 09:06:06,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:06" (1/1) ... [2024-11-10 09:06:06,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:06" (1/1) ... [2024-11-10 09:06:06,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:06" (1/1) ... [2024-11-10 09:06:06,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:06:06,477 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:06:06,477 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:06:06,477 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:06:06,478 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:06" (1/1) ... [2024-11-10 09:06:06,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:06:06,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:06:06,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:06:06,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:06:06,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:06:06,586 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:06:06,587 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:06:06,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:06:06,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:06:06,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:06:06,649 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:06:06,651 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:06:06,928 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 09:06:06,928 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:06:06,942 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:06:06,943 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:06:06,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:06:06 BoogieIcfgContainer [2024-11-10 09:06:06,944 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:06:06,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:06:06,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:06:06,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:06:06,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:06:05" (1/3) ... [2024-11-10 09:06:06,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4103f20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:06:06, skipping insertion in model container [2024-11-10 09:06:06,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:06" (2/3) ... [2024-11-10 09:06:06,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4103f20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:06:06, skipping insertion in model container [2024-11-10 09:06:06,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:06:06" (3/3) ... [2024-11-10 09:06:06,953 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-57.i [2024-11-10 09:06:06,965 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:06:06,965 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:06:07,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:06:07,029 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;@426ec3d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:06:07,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:06:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:06:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:06:07,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:06:07,045 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:06:07,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:06:07,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:06:07,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1224396486, now seen corresponding path program 1 times [2024-11-10 09:06:07,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:06:07,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736896240] [2024-11-10 09:06:07,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:06:07,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:06:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:06:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:06:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:06:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 09:06:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:06:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:06:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:06:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 09:06:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:06:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 09:06:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 09:06:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:06:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:06:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 09:06:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 09:06:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 09:06:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 09:06:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:06:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 09:06:07,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:06:07,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736896240] [2024-11-10 09:06:07,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736896240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:06:07,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:06:07,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:06:07,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129221508] [2024-11-10 09:06:07,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:06:07,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:06:07,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:06:07,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:06:07,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:06:07,343 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 09:06:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:06:07,368 INFO L93 Difference]: Finished difference Result 104 states and 173 transitions. [2024-11-10 09:06:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:06:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-11-10 09:06:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:06:07,377 INFO L225 Difference]: With dead ends: 104 [2024-11-10 09:06:07,377 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 09:06:07,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:06:07,388 INFO L432 NwaCegarLoop]: 73 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, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:06:07,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:06:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 09:06:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 09:06:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:06:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-10 09:06:07,422 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 115 [2024-11-10 09:06:07,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:06:07,422 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-10 09:06:07,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 09:06:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-10 09:06:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:06:07,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:06:07,426 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:06:07,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:06:07,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:06:07,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:06:07,431 INFO L85 PathProgramCache]: Analyzing trace with hash -219780570, now seen corresponding path program 1 times [2024-11-10 09:06:07,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:06:07,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390546072] [2024-11-10 09:06:07,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:06:07,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:06:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:06:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:06:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:06:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 09:06:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:06:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:06:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:06:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 09:06:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:06:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 09:06:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 09:06:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:06:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:06:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 09:06:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 09:06:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 09:06:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 09:06:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:06:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 09:06:07,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:06:07,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390546072] [2024-11-10 09:06:07,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390546072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:06:07,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:06:07,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:06:07,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496004696] [2024-11-10 09:06:07,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:06:07,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:06:07,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:06:07,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:06:07,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:06:07,794 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:06:07,949 INFO L93 Difference]: Finished difference Result 149 states and 215 transitions. [2024-11-10 09:06:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:06:07,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-10 09:06:07,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:06:07,953 INFO L225 Difference]: With dead ends: 149 [2024-11-10 09:06:07,953 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 09:06:07,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:06:07,955 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 43 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:06:07,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 195 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:06:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 09:06:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2024-11-10 09:06:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:06:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 125 transitions. [2024-11-10 09:06:07,980 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 125 transitions. Word has length 115 [2024-11-10 09:06:07,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:06:07,980 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 125 transitions. [2024-11-10 09:06:07,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 125 transitions. [2024-11-10 09:06:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 09:06:07,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:06:07,982 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:06:07,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:06:07,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:06:07,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:06:07,983 INFO L85 PathProgramCache]: Analyzing trace with hash -226024095, now seen corresponding path program 1 times [2024-11-10 09:06:07,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:06:07,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919876069] [2024-11-10 09:06:07,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:06:07,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:06:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:06:08,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:06:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:06:08,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:06:08,113 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:06:08,114 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:06:08,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:06:08,119 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 09:06:08,199 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:06:08,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:06:08 BoogieIcfgContainer [2024-11-10 09:06:08,202 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:06:08,203 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:06:08,203 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:06:08,203 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:06:08,203 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:06:06" (3/4) ... [2024-11-10 09:06:08,205 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:06:08,206 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:06:08,207 INFO L158 Benchmark]: Toolchain (without parser) took 2444.55ms. Allocated memory is still 176.2MB. Free memory was 106.2MB in the beginning and 92.0MB in the end (delta: 14.2MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-11-10 09:06:08,210 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory was 132.3MB in the beginning and 132.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:06:08,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.04ms. Allocated memory is still 176.2MB. Free memory was 106.1MB in the beginning and 91.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 09:06:08,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.91ms. Allocated memory is still 176.2MB. Free memory was 91.8MB in the beginning and 89.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:06:08,211 INFO L158 Benchmark]: Boogie Preprocessor took 104.58ms. Allocated memory is still 176.2MB. Free memory was 89.4MB in the beginning and 147.6MB in the end (delta: -58.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:06:08,211 INFO L158 Benchmark]: IcfgBuilder took 466.77ms. Allocated memory is still 176.2MB. Free memory was 147.6MB in the beginning and 130.5MB in the end (delta: 17.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 09:06:08,212 INFO L158 Benchmark]: TraceAbstraction took 1255.73ms. Allocated memory is still 176.2MB. Free memory was 129.8MB in the beginning and 93.1MB in the end (delta: 36.7MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2024-11-10 09:06:08,212 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 176.2MB. Free memory was 93.1MB in the beginning and 92.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:06:08,213 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.15ms. Allocated memory is still 176.2MB. Free memory was 132.3MB in the beginning and 132.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.04ms. Allocated memory is still 176.2MB. Free memory was 106.1MB in the beginning and 91.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.91ms. Allocated memory is still 176.2MB. Free memory was 91.8MB in the beginning and 89.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.58ms. Allocated memory is still 176.2MB. Free memory was 89.4MB in the beginning and 147.6MB in the end (delta: -58.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 466.77ms. Allocated memory is still 176.2MB. Free memory was 147.6MB in the beginning and 130.5MB in the end (delta: 17.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1255.73ms. Allocated memory is still 176.2MB. Free memory was 129.8MB in the beginning and 93.1MB in the end (delta: 36.7MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 176.2MB. Free memory was 93.1MB in the beginning and 92.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 1; [L26] signed char var_1_9 = 64; [L27] signed char var_1_10 = 4; [L28] signed char var_1_11 = -4; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = 32; [L31] signed char var_1_14 = -64; [L32] signed char var_1_15 = 50; [L33] signed char var_1_16 = 16; [L34] float var_1_17 = 63.5; [L35] signed char last_1_var_1_9 = 64; [L36] signed char last_1_var_1_14 = -64; VAL [isInitial=0, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_9=64] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_9 = var_1_9 [L98] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_9=64] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L68] var_1_4 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_5=0, var_1_6=1, var_1_9=64] [L69] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_5=0, var_1_6=1, var_1_9=64] [L70] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_9=64] [L70] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_9=64] [L71] var_1_5 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_6=1, var_1_9=64] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_6=1, var_1_9=64] [L73] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=1, var_1_9=64] [L73] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=1, var_1_9=64] [L74] var_1_6 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_9=64] [L75] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_9=64] [L76] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L76] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L77] var_1_10 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L78] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L79] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L79] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L80] var_1_11 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L81] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L82] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L82] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L83] var_1_12 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L84] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L85] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L85] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L87] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L88] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L88] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L89] var_1_15 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L91] CALL assume_abort_if_not(var_1_15 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L91] RET assume_abort_if_not(var_1_15 <= 64) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L92] var_1_16 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L94] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L94] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L109] RET updateVariables() [L110] CALL step() [L40] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=-255, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L41] COND TRUE ! (last_1_var_1_14 >= last_1_var_1_9) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=-255, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=1, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L42] COND TRUE (var_1_4 || var_1_5) && stepLocal_0 [L43] var_1_1 = ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L50] signed long int stepLocal_3 = (var_1_15 + var_1_16) - ((((64) > (var_1_13)) ? (64) : (var_1_13))); VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_3=0, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-64, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L51] COND TRUE var_1_12 < stepLocal_3 [L52] var_1_14 = ((64 - var_1_16) - var_1_13) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-124, var_1_15=64, var_1_16=62, var_1_17=127/2, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L56] var_1_17 = 128.91f [L57] unsigned char stepLocal_2 = var_1_14 == var_1_1; [L58] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_1=-255, stepLocal_2=0, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-124, var_1_15=64, var_1_16=62, var_1_17=12891/100, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=64] [L59] COND FALSE !(stepLocal_1 && var_1_4) [L64] var_1_9 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_2=0, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-124, var_1_15=64, var_1_16=62, var_1_17=12891/100, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=-127] [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return ((((! (last_1_var_1_14 >= last_1_var_1_9)) ? (((var_1_4 || var_1_5) && var_1_6) ? (var_1_1 == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : (var_1_1 == ((signed long int) last_1_var_1_14))) : (var_1_1 == ((signed long int) last_1_var_1_14))) && ((var_1_5 && var_1_4) ? ((var_1_6 || (var_1_14 == var_1_1)) ? (var_1_9 == ((signed char) ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))))) : 1) : (var_1_9 == ((signed char) (var_1_12 - var_1_13))))) && ((var_1_12 < ((var_1_15 + var_1_16) - ((((64) > (var_1_13)) ? (64) : (var_1_13))))) ? (var_1_14 == ((signed char) ((64 - var_1_16) - var_1_13))) : (var_1_14 == ((signed char) ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))))))) && (var_1_17 == ((float) 128.91f)) ; VAL [\result=0, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-124, var_1_15=64, var_1_16=62, var_1_17=12891/100, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=-127] [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-124, var_1_15=64, var_1_16=62, var_1_17=12891/100, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=-127] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=126, var_1_11=126, var_1_12=-1, var_1_13=126, var_1_14=-124, var_1_15=64, var_1_16=62, var_1_17=12891/100, var_1_1=-64, var_1_4=0, var_1_5=-255, var_1_6=-255, var_1_9=-127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 141 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1224/1224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:06:08,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.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 b52051d145fb2b47c7d32126bb345ca7aff8e39890cc67cf57ddb4a3e09751a2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:06:10,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:06:10,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:06:10,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:06:10,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:06:10,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:06:10,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:06:10,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:06:10,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:06:10,375 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:06:10,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:06:10,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:06:10,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:06:10,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:06:10,379 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:06:10,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:06:10,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:06:10,379 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:06:10,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:06:10,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:06:10,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:06:10,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:06:10,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:06:10,382 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:06:10,382 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:06:10,382 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:06:10,395 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:06:10,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:06:10,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:06:10,396 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:06:10,396 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:06:10,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:06:10,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:06:10,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:06:10,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:06:10,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:06:10,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:06:10,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:06:10,398 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:06:10,398 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:06:10,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:06:10,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:06:10,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:06:10,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:06:10,404 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b52051d145fb2b47c7d32126bb345ca7aff8e39890cc67cf57ddb4a3e09751a2 [2024-11-10 09:06:10,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:06:10,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:06:10,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:06:10,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:06:10,719 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:06:10,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.i [2024-11-10 09:06:12,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:06:12,390 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:06:12,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-57.i [2024-11-10 09:06:12,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c4c6c84d/649072c1e05f4a90a501d9d948992bc1/FLAGf5880595d [2024-11-10 09:06:12,754 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c4c6c84d/649072c1e05f4a90a501d9d948992bc1 [2024-11-10 09:06:12,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:06:12,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:06:12,759 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:06:12,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:06:12,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:06:12,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:06:12" (1/1) ... [2024-11-10 09:06:12,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@238780c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:12, skipping insertion in model container [2024-11-10 09:06:12,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:06:12" (1/1) ... [2024-11-10 09:06:12,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:06:12,955 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_variablewrapping_normal_file-57.i[913,926] [2024-11-10 09:06:13,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:06:13,030 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:06:13,043 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_variablewrapping_normal_file-57.i[913,926] [2024-11-10 09:06:13,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:06:13,113 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:06:13,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:13 WrapperNode [2024-11-10 09:06:13,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:06:13,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:06:13,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:06:13,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:06:13,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:13" (1/1) ... [2024-11-10 09:06:13,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:13" (1/1) ... [2024-11-10 09:06:13,165 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-11-10 09:06:13,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:06:13,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:06:13,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:06:13,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:06:13,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:13" (1/1) ... [2024-11-10 09:06:13,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:13" (1/1) ... [2024-11-10 09:06:13,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:13" (1/1) ... [2024-11-10 09:06:13,200 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 09:06:13,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:13" (1/1) ... [2024-11-10 09:06:13,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:13" (1/1) ... [2024-11-10 09:06:13,213 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:13" (1/1) ... [2024-11-10 09:06:13,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:13" (1/1) ... [2024-11-10 09:06:13,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:13" (1/1) ... [2024-11-10 09:06:13,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:13" (1/1) ... [2024-11-10 09:06:13,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:06:13,228 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:06:13,228 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:06:13,228 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:06:13,229 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:13" (1/1) ... [2024-11-10 09:06:13,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:06:13,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:06:13,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:06:13,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:06:13,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:06:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:06:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:06:13,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:06:13,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:06:13,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:06:13,385 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:06:13,387 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:06:13,617 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 09:06:13,621 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:06:13,637 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:06:13,639 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:06:13,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:06:13 BoogieIcfgContainer [2024-11-10 09:06:13,639 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:06:13,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:06:13,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:06:13,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:06:13,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:06:12" (1/3) ... [2024-11-10 09:06:13,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbe8621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:06:13, skipping insertion in model container [2024-11-10 09:06:13,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:13" (2/3) ... [2024-11-10 09:06:13,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbe8621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:06:13, skipping insertion in model container [2024-11-10 09:06:13,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:06:13" (3/3) ... [2024-11-10 09:06:13,649 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-57.i [2024-11-10 09:06:13,664 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:06:13,665 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:06:13,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:06:13,735 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;@5c8c1f35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:06:13,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:06:13,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:06:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:06:13,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:06:13,752 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:06:13,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:06:13,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:06:13,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1224396486, now seen corresponding path program 1 times [2024-11-10 09:06:13,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:06:13,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499027752] [2024-11-10 09:06:13,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:06:13,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:06:13,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:06:13,781 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:06:13,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 09:06:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:13,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:06:13,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:06:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-10 09:06:13,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:06:13,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:06:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499027752] [2024-11-10 09:06:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499027752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:06:13,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:06:13,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:06:14,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551932452] [2024-11-10 09:06:14,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:06:14,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:06:14,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:06:14,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:06:14,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:06:14,027 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 09:06:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:06:14,055 INFO L93 Difference]: Finished difference Result 104 states and 173 transitions. [2024-11-10 09:06:14,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:06:14,058 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-11-10 09:06:14,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:06:14,064 INFO L225 Difference]: With dead ends: 104 [2024-11-10 09:06:14,064 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 09:06:14,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:06:14,071 INFO L432 NwaCegarLoop]: 73 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, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:06:14,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:06:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 09:06:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 09:06:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:06:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-10 09:06:14,110 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 115 [2024-11-10 09:06:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:06:14,111 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-10 09:06:14,111 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 09:06:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-10 09:06:14,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:06:14,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:06:14,118 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:06:14,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 09:06:14,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:06:14,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:06:14,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:06:14,321 INFO L85 PathProgramCache]: Analyzing trace with hash -219780570, now seen corresponding path program 1 times [2024-11-10 09:06:14,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:06:14,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512690399] [2024-11-10 09:06:14,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:06:14,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:06:14,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:06:14,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:06:14,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 09:06:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:14,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 09:06:14,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:06:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 09:06:15,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:06:15,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:06:15,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512690399] [2024-11-10 09:06:15,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512690399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:06:15,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:06:15,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:06:15,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141198112] [2024-11-10 09:06:15,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:06:15,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:06:15,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:06:15,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:06:15,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:06:15,220 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:06:15,394 INFO L93 Difference]: Finished difference Result 149 states and 215 transitions. [2024-11-10 09:06:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:06:15,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-10 09:06:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:06:15,398 INFO L225 Difference]: With dead ends: 149 [2024-11-10 09:06:15,398 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 09:06:15,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:06:15,400 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 40 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:06:15,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 195 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:06:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 09:06:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2024-11-10 09:06:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:06:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 125 transitions. [2024-11-10 09:06:15,436 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 125 transitions. Word has length 115 [2024-11-10 09:06:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:06:15,437 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 125 transitions. [2024-11-10 09:06:15,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 125 transitions. [2024-11-10 09:06:15,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 09:06:15,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:06:15,442 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:06:15,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 09:06:15,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:06:15,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:06:15,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:06:15,645 INFO L85 PathProgramCache]: Analyzing trace with hash -226024095, now seen corresponding path program 1 times [2024-11-10 09:06:15,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:06:15,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559234572] [2024-11-10 09:06:15,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:06:15,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:06:15,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:06:15,648 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:06:15,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 09:06:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:15,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-10 09:06:15,782 INFO L278 TraceCheckSpWp]: Computing forward predicates...