./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9930e7e7388f7dfeb601d848298c3301ebab0d86295164196a4204cce117c042 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:04:57,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:04:57,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:04:57,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:04:57,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:04:57,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:04:57,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:04:57,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:04:57,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:04:57,604 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:04:57,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:04:57,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:04:57,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:04:57,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:04:57,607 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:04:57,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:04:57,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:04:57,610 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:04:57,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:04:57,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:04:57,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:04:57,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:04:57,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:04:57,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:04:57,614 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:04:57,614 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:04:57,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:04:57,615 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:04:57,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:04:57,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:04:57,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:04:57,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:04:57,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:04:57,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:04:57,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:04:57,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:04:57,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:04:57,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:04:57,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:04:57,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:04:57,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:04:57,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:04:57,619 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-clean/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-clean/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 -> 9930e7e7388f7dfeb601d848298c3301ebab0d86295164196a4204cce117c042 [2024-10-11 13:04:57,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:04:57,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:04:57,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:04:57,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:04:57,909 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:04:57,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i [2024-10-11 13:04:59,369 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:04:59,556 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:04:59,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i [2024-10-11 13:04:59,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a419c2e37/02fc1456a5ae403595f85f55782e9f97/FLAG8197f5548 [2024-10-11 13:04:59,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a419c2e37/02fc1456a5ae403595f85f55782e9f97 [2024-10-11 13:04:59,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:04:59,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:04:59,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:04:59,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:04:59,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:04:59,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:04:59" (1/1) ... [2024-10-11 13:04:59,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53bbbf70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:04:59, skipping insertion in model container [2024-10-11 13:04:59,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:04:59" (1/1) ... [2024-10-11 13:04:59,987 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:05:00,177 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i[913,926] [2024-10-11 13:05:00,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:05:00,237 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:05:00,249 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i[913,926] [2024-10-11 13:05:00,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:05:00,281 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:05:00,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:00 WrapperNode [2024-10-11 13:05:00,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:05:00,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:05:00,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:05:00,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:05:00,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:00" (1/1) ... [2024-10-11 13:05:00,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:00" (1/1) ... [2024-10-11 13:05:00,322 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-10-11 13:05:00,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:05:00,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:05:00,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:05:00,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:05:00,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:00" (1/1) ... [2024-10-11 13:05:00,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:00" (1/1) ... [2024-10-11 13:05:00,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:00" (1/1) ... [2024-10-11 13:05:00,354 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 13:05:00,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:00" (1/1) ... [2024-10-11 13:05:00,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:00" (1/1) ... [2024-10-11 13:05:00,365 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:00" (1/1) ... [2024-10-11 13:05:00,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:00" (1/1) ... [2024-10-11 13:05:00,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:00" (1/1) ... [2024-10-11 13:05:00,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:00" (1/1) ... [2024-10-11 13:05:00,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:05:00,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:05:00,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:05:00,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:05:00,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:00" (1/1) ... [2024-10-11 13:05:00,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:05:00,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:05:00,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:05:00,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:05:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:05:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:05:00,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:05:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:05:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:05:00,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:05:00,507 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:05:00,508 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:05:00,714 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 13:05:00,715 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:05:00,753 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:05:00,753 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:05:00,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:05:00 BoogieIcfgContainer [2024-10-11 13:05:00,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:05:00,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:05:00,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:05:00,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:05:00,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:04:59" (1/3) ... [2024-10-11 13:05:00,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3969aca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:05:00, skipping insertion in model container [2024-10-11 13:05:00,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:00" (2/3) ... [2024-10-11 13:05:00,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3969aca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:05:00, skipping insertion in model container [2024-10-11 13:05:00,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:05:00" (3/3) ... [2024-10-11 13:05:00,765 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-31.i [2024-10-11 13:05:00,784 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:05:00,784 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:05:00,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:05:00,851 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;@2bd5abda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:05:00,851 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:05:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:05:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 13:05:00,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:05:00,864 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:05:00,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:05:00,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:05:00,870 INFO L85 PathProgramCache]: Analyzing trace with hash 30954485, now seen corresponding path program 1 times [2024-10-11 13:05:00,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:05:00,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297879031] [2024-10-11 13:05:00,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:05:00,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:05:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:01,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:05:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:01,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:05:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:01,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:05:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:01,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:05:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:01,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:05:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:01,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:05:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:01,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:05:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:01,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:05:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:01,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:05:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:01,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:05:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:01,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:05:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:05:01,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:05:01,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297879031] [2024-10-11 13:05:01,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297879031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:05:01,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:05:01,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:05:01,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205846769] [2024-10-11 13:05:01,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:05:01,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:05:01,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:05:01,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:05:01,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:05:01,349 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:05:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:05:01,397 INFO L93 Difference]: Finished difference Result 75 states and 131 transitions. [2024-10-11 13:05:01,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:05:01,400 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2024-10-11 13:05:01,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:05:01,412 INFO L225 Difference]: With dead ends: 75 [2024-10-11 13:05:01,413 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 13:05:01,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:05:01,422 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:05:01,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:05:01,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 13:05:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 13:05:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:05:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2024-10-11 13:05:01,509 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 70 [2024-10-11 13:05:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:05:01,512 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2024-10-11 13:05:01,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:05:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2024-10-11 13:05:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 13:05:01,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:05:01,536 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:05:01,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:05:01,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:05:01,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:05:01,539 INFO L85 PathProgramCache]: Analyzing trace with hash 88212787, now seen corresponding path program 1 times [2024-10-11 13:05:01,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:05:01,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468677725] [2024-10-11 13:05:01,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:05:01,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:05:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:05:01,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [937057276] [2024-10-11 13:05:01,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:05:01,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:05:01,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:05:01,639 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:05:01,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:05:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:05:01,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:05:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:05:01,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:05:01,831 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:05:01,833 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:05:01,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:05:02,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:05:02,039 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 13:05:02,099 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:05:02,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:05:02 BoogieIcfgContainer [2024-10-11 13:05:02,109 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:05:02,109 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:05:02,109 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:05:02,110 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:05:02,110 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:05:00" (3/4) ... [2024-10-11 13:05:02,114 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:05:02,116 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:05:02,119 INFO L158 Benchmark]: Toolchain (without parser) took 2168.54ms. Allocated memory was 174.1MB in the beginning and 270.5MB in the end (delta: 96.5MB). Free memory was 117.2MB in the beginning and 214.9MB in the end (delta: -97.7MB). Peak memory consumption was 843.9kB. Max. memory is 16.1GB. [2024-10-11 13:05:02,120 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 174.1MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:05:02,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.69ms. Allocated memory is still 174.1MB. Free memory was 117.2MB in the beginning and 102.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:05:02,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.39ms. Allocated memory is still 174.1MB. Free memory was 102.5MB in the beginning and 100.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:05:02,124 INFO L158 Benchmark]: Boogie Preprocessor took 53.38ms. Allocated memory is still 174.1MB. Free memory was 100.4MB in the beginning and 97.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:05:02,124 INFO L158 Benchmark]: RCFGBuilder took 376.47ms. Allocated memory is still 174.1MB. Free memory was 97.6MB in the beginning and 79.4MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:05:02,125 INFO L158 Benchmark]: TraceAbstraction took 1352.28ms. Allocated memory was 174.1MB in the beginning and 270.5MB in the end (delta: 96.5MB). Free memory was 78.7MB in the beginning and 215.9MB in the end (delta: -137.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:05:02,125 INFO L158 Benchmark]: Witness Printer took 6.56ms. Allocated memory is still 270.5MB. Free memory was 215.9MB in the beginning and 214.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:05:02,127 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.18ms. Allocated memory is still 174.1MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.69ms. Allocated memory is still 174.1MB. Free memory was 117.2MB in the beginning and 102.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.39ms. Allocated memory is still 174.1MB. Free memory was 102.5MB in the beginning and 100.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.38ms. Allocated memory is still 174.1MB. Free memory was 100.4MB in the beginning and 97.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 376.47ms. Allocated memory is still 174.1MB. Free memory was 97.6MB in the beginning and 79.4MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1352.28ms. Allocated memory was 174.1MB in the beginning and 270.5MB in the end (delta: 96.5MB). Free memory was 78.7MB in the beginning and 215.9MB in the end (delta: -137.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.56ms. Allocated memory is still 270.5MB. Free memory was 215.9MB in the beginning and 214.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 200; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1107940323; [L25] unsigned char var_1_6 = 0; [L26] signed long int var_1_7 = 4; [L27] signed long int var_1_8 = -32; [L28] unsigned char var_1_9 = 64; [L29] unsigned char var_1_12 = 4; [L30] double var_1_13 = 0.97; [L31] double var_1_14 = 32.6; [L32] signed long int last_1_var_1_7 = 4; [L33] double last_1_var_1_13 = 0.97; [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L92] last_1_var_1_7 = var_1_7 [L93] last_1_var_1_13 = var_1_13 [L103] RET updateLastVariables() [L104] CALL updateVariables() [L73] var_1_2 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L74] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L75] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L75] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L76] var_1_3 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L77] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L78] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L78] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L79] var_1_6 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_7=4, var_1_8=-32, var_1_9=64] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_7=4, var_1_8=-32, var_1_9=64] [L81] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=-32, var_1_9=64] [L81] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=-32, var_1_9=64] [L82] var_1_8 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L83] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L84] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L84] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L85] var_1_12 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L86] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L87] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L87] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L88] var_1_14 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L89] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L104] RET updateVariables() [L105] CALL step() [L37] COND FALSE !(! (var_1_3 < (var_1_8 * last_1_var_1_7))) [L44] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=1] [L46] COND FALSE !(var_1_9 < var_1_9) [L49] var_1_7 = (var_1_9 - var_1_3) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L51] COND FALSE !((var_1_9 + var_1_3) < var_1_9) [L62] var_1_13 = var_1_14 VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L64] COND TRUE \read(var_1_2) [L65] var_1_1 = ((var_1_3 - var_1_9) - var_1_9) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L105] RET step() [L106] CALL, EXPR property() [L96-L97] return (((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_9) - var_1_9))) : ((var_1_6 && (var_1_3 < var_1_9)) ? (var_1_1 == ((signed long int) var_1_3)) : 1)) && ((var_1_9 < var_1_9) ? (var_1_7 == ((signed long int) (var_1_9 + var_1_9))) : (var_1_7 == ((signed long int) (var_1_9 - var_1_3))))) && ((! (var_1_3 < (var_1_8 * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? (var_1_6 ? (var_1_9 == ((unsigned char) var_1_12)) : 1) : 1) : (var_1_9 == ((unsigned char) var_1_12)))) && (((var_1_9 + var_1_3) < var_1_9) ? ((var_1_2 && var_1_6) ? (var_1_6 ? (var_1_13 == ((double) 0.8)) : (var_1_13 == ((double) var_1_14))) : (var_1_13 == ((double) var_1_14))) : (var_1_13 == ((double) var_1_14))) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 52 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 69 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:05:02,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9930e7e7388f7dfeb601d848298c3301ebab0d86295164196a4204cce117c042 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:05:04,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:05:04,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:05:04,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:05:04,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:05:04,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:05:04,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:05:04,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:05:04,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:05:04,502 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:05:04,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:05:04,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:05:04,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:05:04,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:05:04,505 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:05:04,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:05:04,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:05:04,508 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:05:04,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:05:04,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:05:04,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:05:04,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:05:04,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:05:04,512 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:05:04,512 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:05:04,512 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:05:04,512 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:05:04,512 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:05:04,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:05:04,513 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:05:04,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:05:04,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:05:04,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:05:04,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:05:04,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:05:04,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:05:04,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:05:04,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:05:04,517 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:05:04,517 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:05:04,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:05:04,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:05:04,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:05:04,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:05:04,518 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:05:04,519 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-clean/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-clean/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 -> 9930e7e7388f7dfeb601d848298c3301ebab0d86295164196a4204cce117c042 [2024-10-11 13:05:04,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:05:04,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:05:04,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:05:04,870 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:05:04,870 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:05:04,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i [2024-10-11 13:05:06,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:05:06,669 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:05:06,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i [2024-10-11 13:05:06,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d2012e093/093fa3fe96954bb095c095ed65b2cd8f/FLAG8b5034a74 [2024-10-11 13:05:06,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d2012e093/093fa3fe96954bb095c095ed65b2cd8f [2024-10-11 13:05:06,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:05:06,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:05:06,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:05:06,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:05:06,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:05:06,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:05:06" (1/1) ... [2024-10-11 13:05:06,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@afdeeb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:06, skipping insertion in model container [2024-10-11 13:05:06,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:05:06" (1/1) ... [2024-10-11 13:05:06,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:05:06,912 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i[913,926] [2024-10-11 13:05:06,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:05:06,976 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:05:06,989 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i[913,926] [2024-10-11 13:05:07,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:05:07,036 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:05:07,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:07 WrapperNode [2024-10-11 13:05:07,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:05:07,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:05:07,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:05:07,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:05:07,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:07" (1/1) ... [2024-10-11 13:05:07,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:07" (1/1) ... [2024-10-11 13:05:07,092 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2024-10-11 13:05:07,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:05:07,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:05:07,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:05:07,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:05:07,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:07" (1/1) ... [2024-10-11 13:05:07,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:07" (1/1) ... [2024-10-11 13:05:07,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:07" (1/1) ... [2024-10-11 13:05:07,129 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 13:05:07,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:07" (1/1) ... [2024-10-11 13:05:07,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:07" (1/1) ... [2024-10-11 13:05:07,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:07" (1/1) ... [2024-10-11 13:05:07,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:07" (1/1) ... [2024-10-11 13:05:07,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:07" (1/1) ... [2024-10-11 13:05:07,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:07" (1/1) ... [2024-10-11 13:05:07,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:05:07,160 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:05:07,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:05:07,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:05:07,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:07" (1/1) ... [2024-10-11 13:05:07,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:05:07,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:05:07,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:05:07,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:05:07,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:05:07,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:05:07,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:05:07,245 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:05:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:05:07,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:05:07,331 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:05:07,333 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:05:07,691 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 13:05:07,692 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:05:07,752 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:05:07,752 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:05:07,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:05:07 BoogieIcfgContainer [2024-10-11 13:05:07,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:05:07,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:05:07,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:05:07,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:05:07,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:05:06" (1/3) ... [2024-10-11 13:05:07,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1d4e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:05:07, skipping insertion in model container [2024-10-11 13:05:07,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:05:07" (2/3) ... [2024-10-11 13:05:07,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1d4e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:05:07, skipping insertion in model container [2024-10-11 13:05:07,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:05:07" (3/3) ... [2024-10-11 13:05:07,764 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-31.i [2024-10-11 13:05:07,784 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:05:07,784 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:05:07,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:05:07,870 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;@9306f9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:05:07,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:05:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:05:07,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 13:05:07,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:05:07,887 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:05:07,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:05:07,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:05:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash 30954485, now seen corresponding path program 1 times [2024-10-11 13:05:07,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:05:07,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263884475] [2024-10-11 13:05:07,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:05:07,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:05:07,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:05:07,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:05:07,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:05:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:08,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:05:08,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:05:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:05:08,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:05:08,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:05:08,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263884475] [2024-10-11 13:05:08,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263884475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:05:08,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:05:08,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:05:08,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278237015] [2024-10-11 13:05:08,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:05:08,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:05:08,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:05:08,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:05:08,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:05:08,157 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:05:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:05:08,201 INFO L93 Difference]: Finished difference Result 74 states and 129 transitions. [2024-10-11 13:05:08,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:05:08,205 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2024-10-11 13:05:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:05:08,212 INFO L225 Difference]: With dead ends: 74 [2024-10-11 13:05:08,212 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 13:05:08,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:05:08,218 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:05:08,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:05:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 13:05:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 13:05:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:05:08,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2024-10-11 13:05:08,256 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 70 [2024-10-11 13:05:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:05:08,260 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2024-10-11 13:05:08,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:05:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2024-10-11 13:05:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 13:05:08,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:05:08,264 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:05:08,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:05:08,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:05:08,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:05:08,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:05:08,467 INFO L85 PathProgramCache]: Analyzing trace with hash 88212787, now seen corresponding path program 1 times [2024-10-11 13:05:08,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:05:08,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783535240] [2024-10-11 13:05:08,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:05:08,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:05:08,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:05:08,473 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:05:08,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:05:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:08,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:05:08,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:05:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 13:05:43,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:05:43,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:05:43,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783535240] [2024-10-11 13:05:43,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783535240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:05:43,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:05:43,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:05:43,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144924261] [2024-10-11 13:05:43,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:05:43,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:05:43,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:05:43,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:05:43,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:05:43,236 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:05:44,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:05:44,386 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2024-10-11 13:05:44,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:05:44,388 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 70 [2024-10-11 13:05:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:05:44,391 INFO L225 Difference]: With dead ends: 104 [2024-10-11 13:05:44,391 INFO L226 Difference]: Without dead ends: 102 [2024-10-11 13:05:44,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:05:44,392 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 109 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:05:44,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 193 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:05:44,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-11 13:05:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 68. [2024-10-11 13:05:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:05:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-10-11 13:05:44,412 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 70 [2024-10-11 13:05:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:05:44,413 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-10-11 13:05:44,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:05:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-10-11 13:05:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 13:05:44,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:05:44,415 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:05:44,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:05:44,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:05:44,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:05:44,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:05:44,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1560204614, now seen corresponding path program 1 times [2024-10-11 13:05:44,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:05:44,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479015320] [2024-10-11 13:05:44,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:05:44,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:05:44,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:05:44,623 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:05:44,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 13:05:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:44,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:05:44,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:05:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-11 13:05:44,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:05:44,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:05:44,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479015320] [2024-10-11 13:05:44,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479015320] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:05:44,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1063449715] [2024-10-11 13:05:44,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:05:44,902 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:05:44,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:05:44,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:05:44,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-11 13:05:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:45,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:05:45,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:05:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-11 13:05:45,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:05:45,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1063449715] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:05:45,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:05:45,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-10-11 13:05:45,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480451498] [2024-10-11 13:05:45,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:05:45,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:05:45,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:05:45,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:05:45,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:05:45,432 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:05:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:05:45,633 INFO L93 Difference]: Finished difference Result 115 states and 157 transitions. [2024-10-11 13:05:45,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:05:45,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 71 [2024-10-11 13:05:45,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:05:45,638 INFO L225 Difference]: With dead ends: 115 [2024-10-11 13:05:45,638 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 13:05:45,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:05:45,640 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:05:45,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 63 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:05:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 13:05:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-10-11 13:05:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:05:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2024-10-11 13:05:45,665 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 71 [2024-10-11 13:05:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:05:45,665 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2024-10-11 13:05:45,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:05:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2024-10-11 13:05:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 13:05:45,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:05:45,668 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:05:45,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-10-11 13:05:45,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 13:05:46,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:05:46,073 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:05:46,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:05:46,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1560145032, now seen corresponding path program 1 times [2024-10-11 13:05:46,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:05:46,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242230984] [2024-10-11 13:05:46,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:05:46,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:05:46,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:05:46,076 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:05:46,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (6)] Waiting until timeout for monitored process [2024-10-11 13:05:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:05:46,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:05:46,160 INFO L278 TraceCheckSpWp]: Computing forward predicates...