./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:04:18,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:04:18,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:04:18,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:04:18,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:04:18,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:04:18,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:04:18,427 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:04:18,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:04:18,428 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:04:18,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:04:18,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:04:18,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:04:18,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:04:18,430 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:04:18,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:04:18,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:04:18,431 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:04:18,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:04:18,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:04:18,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:04:18,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:04:18,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:04:18,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:04:18,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:04:18,434 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:04:18,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:04:18,434 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:04:18,435 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:04:18,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:04:18,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:04:18,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:04:18,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:04:18,436 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:04:18,436 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:04:18,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:04:18,437 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:04:18,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:04:18,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:04:18,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:04:18,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:04:18,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:04:18,440 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 [2024-11-10 09:04:18,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:04:18,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:04:18,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:04:18,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:04:18,704 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:04:18,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2024-11-10 09:04:20,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:04:20,232 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:04:20,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2024-11-10 09:04:20,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2104ce324/98c3d729fbc6424c949d7f6711e8040d/FLAG3ea9d472f [2024-11-10 09:04:20,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2104ce324/98c3d729fbc6424c949d7f6711e8040d [2024-11-10 09:04:20,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:04:20,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:04:20,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:04:20,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:04:20,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:04:20,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:04:20" (1/1) ... [2024-11-10 09:04:20,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e816a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:20, skipping insertion in model container [2024-11-10 09:04:20,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:04:20" (1/1) ... [2024-11-10 09:04:20,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:04:20,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i[913,926] [2024-11-10 09:04:20,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:04:20,558 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:04:20,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i[913,926] [2024-11-10 09:04:20,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:04:20,656 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:04:20,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:20 WrapperNode [2024-11-10 09:04:20,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:04:20,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:04:20,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:04:20,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:04:20,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:20" (1/1) ... [2024-11-10 09:04:20,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:20" (1/1) ... [2024-11-10 09:04:20,721 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2024-11-10 09:04:20,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:04:20,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:04:20,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:04:20,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:04:20,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:20" (1/1) ... [2024-11-10 09:04:20,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:20" (1/1) ... [2024-11-10 09:04:20,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:20" (1/1) ... [2024-11-10 09:04:20,755 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 09:04:20,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:20" (1/1) ... [2024-11-10 09:04:20,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:20" (1/1) ... [2024-11-10 09:04:20,762 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:20" (1/1) ... [2024-11-10 09:04:20,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:20" (1/1) ... [2024-11-10 09:04:20,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:20" (1/1) ... [2024-11-10 09:04:20,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:20" (1/1) ... [2024-11-10 09:04:20,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:04:20,769 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:04:20,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:04:20,770 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:04:20,771 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:20" (1/1) ... [2024-11-10 09:04:20,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:04:20,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:04:20,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:04:20,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:04:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:04:20,864 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:04:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:04:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:04:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:04:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:04:20,942 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:04:20,944 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:04:21,184 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 09:04:21,184 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:04:21,204 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:04:21,204 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:04:21,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:04:21 BoogieIcfgContainer [2024-11-10 09:04:21,207 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:04:21,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:04:21,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:04:21,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:04:21,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:04:20" (1/3) ... [2024-11-10 09:04:21,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a02464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:04:21, skipping insertion in model container [2024-11-10 09:04:21,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:20" (2/3) ... [2024-11-10 09:04:21,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a02464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:04:21, skipping insertion in model container [2024-11-10 09:04:21,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:04:21" (3/3) ... [2024-11-10 09:04:21,218 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-42.i [2024-11-10 09:04:21,231 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:04:21,231 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:04:21,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:04:21,285 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;@3de6b710, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:04:21,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:04:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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-11-10 09:04:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 09:04:21,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:04:21,297 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, 1, 1, 1, 1, 1] [2024-11-10 09:04:21,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:04:21,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:04:21,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1827585352, now seen corresponding path program 1 times [2024-11-10 09:04:21,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:04:21,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20834660] [2024-11-10 09:04:21,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:04:21,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:04:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:04:21,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:04:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:04:21,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:04:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:04:21,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:04:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:04:21,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 09:04:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:04:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:04:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:04:21,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 09:04:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:04:21,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:04:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:04:21,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 09:04:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:04:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:04:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:04:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 09:04:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:04:21,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 09:04:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:04:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:04:21,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:04:21,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20834660] [2024-11-10 09:04:21,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20834660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:04:21,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:04:21,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:04:21,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40426663] [2024-11-10 09:04:21,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:04:21,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:04:21,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:04:21,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:04:21,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:04:21,642 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 09:04:21,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:04:21,664 INFO L93 Difference]: Finished difference Result 80 states and 128 transitions. [2024-11-10 09:04:21,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:04:21,667 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2024-11-10 09:04:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:04:21,674 INFO L225 Difference]: With dead ends: 80 [2024-11-10 09:04:21,674 INFO L226 Difference]: Without dead ends: 39 [2024-11-10 09:04:21,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:04:21,680 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:04:21,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:04:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-10 09:04:21,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-10 09:04:21,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 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-11-10 09:04:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-10 09:04:21,717 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 76 [2024-11-10 09:04:21,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:04:21,718 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-10 09:04:21,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-10 09:04:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-10 09:04:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 09:04:21,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:04:21,725 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, 1, 1, 1, 1, 1] [2024-11-10 09:04:21,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:04:21,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:04:21,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:04:21,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1883698010, now seen corresponding path program 1 times [2024-11-10 09:04:21,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:04:21,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90104662] [2024-11-10 09:04:21,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:04:21,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:04:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:04:21,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:04:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:04:22,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:04:22,029 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:04:22,030 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:04:22,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:04:22,034 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 09:04:22,103 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:04:22,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:04:22 BoogieIcfgContainer [2024-11-10 09:04:22,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:04:22,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:04:22,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:04:22,115 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:04:22,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:04:21" (3/4) ... [2024-11-10 09:04:22,118 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:04:22,119 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:04:22,121 INFO L158 Benchmark]: Toolchain (without parser) took 1858.74ms. Allocated memory was 174.1MB in the beginning and 213.9MB in the end (delta: 39.8MB). Free memory was 111.2MB in the beginning and 177.8MB in the end (delta: -66.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:04:22,122 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 96.5MB. Free memory was 51.4MB in the beginning and 51.3MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:04:22,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.45ms. Allocated memory is still 174.1MB. Free memory was 110.8MB in the beginning and 140.5MB in the end (delta: -29.6MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-10 09:04:22,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.65ms. Allocated memory is still 174.1MB. Free memory was 140.5MB in the beginning and 137.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:04:22,124 INFO L158 Benchmark]: Boogie Preprocessor took 45.00ms. Allocated memory is still 174.1MB. Free memory was 137.6MB in the beginning and 134.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:04:22,126 INFO L158 Benchmark]: IcfgBuilder took 438.18ms. Allocated memory is still 174.1MB. Free memory was 134.1MB in the beginning and 118.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 09:04:22,126 INFO L158 Benchmark]: TraceAbstraction took 904.39ms. Allocated memory was 174.1MB in the beginning and 213.9MB in the end (delta: 39.8MB). Free memory was 118.0MB in the beginning and 177.8MB in the end (delta: -59.9MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2024-11-10 09:04:22,127 INFO L158 Benchmark]: Witness Printer took 5.18ms. Allocated memory is still 213.9MB. Free memory is still 177.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:04:22,131 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.12ms. Allocated memory is still 96.5MB. Free memory was 51.4MB in the beginning and 51.3MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.45ms. Allocated memory is still 174.1MB. Free memory was 110.8MB in the beginning and 140.5MB in the end (delta: -29.6MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.65ms. Allocated memory is still 174.1MB. Free memory was 140.5MB in the beginning and 137.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.00ms. Allocated memory is still 174.1MB. Free memory was 137.6MB in the beginning and 134.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 438.18ms. Allocated memory is still 174.1MB. Free memory was 134.1MB in the beginning and 118.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 904.39ms. Allocated memory was 174.1MB in the beginning and 213.9MB in the end (delta: 39.8MB). Free memory was 118.0MB in the beginning and 177.8MB in the end (delta: -59.9MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. * Witness Printer took 5.18ms. Allocated memory is still 213.9MB. Free memory is still 177.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -1; [L23] unsigned char var_1_8 = 5; [L24] unsigned char var_1_9 = 4; [L25] float var_1_10 = 16.5; [L26] float var_1_11 = 127.25; [L27] unsigned char var_1_12 = 1; [L28] unsigned char var_1_13 = 0; [L29] unsigned char var_1_15 = 0; [L30] unsigned char var_1_16 = 0; [L31] unsigned char var_1_17 = 0; [L32] unsigned char var_1_18 = 0; VAL [isInitial=0, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=4] [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] FCALL updateLastVariables() [L90] CALL updateVariables() [L61] var_1_9 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5] [L62] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5] [L63] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L63] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L64] var_1_11 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L65] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L66] var_1_13 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L67] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L68] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L68] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L69] var_1_15 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L70] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L71] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L71] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L72] var_1_16 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L73] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L74] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L74] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L75] var_1_18 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L76] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L77] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=-1, var_1_8=5, var_1_9=127] [L77] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=-1, var_1_8=5, var_1_9=127] [L90] RET updateVariables() [L91] CALL step() [L36] var_1_8 = (var_1_9 + 100) [L37] var_1_10 = ((((var_1_11) < (64.15f)) ? (var_1_11) : (64.15f))) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=-1, var_1_8=227, var_1_9=127] [L38] COND FALSE !(var_1_8 > var_1_8) [L41] var_1_1 = (((((var_1_8 - var_1_8)) > ((var_1_8 - var_1_8))) ? ((var_1_8 - var_1_8)) : ((var_1_8 - var_1_8)))) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L43] COND TRUE var_1_11 <= var_1_10 VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L44] COND TRUE var_1_1 != var_1_8 [L45] var_1_17 = var_1_18 VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L54] COND TRUE (- var_1_10) > var_1_11 [L55] var_1_12 = (var_1_13 || (var_1_17 && (var_1_15 || var_1_16))) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L91] RET step() [L92] CALL, EXPR property() [L82-L83] return (((((var_1_8 > var_1_8) ? (var_1_1 == ((signed long int) (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) - 10))) : (var_1_1 == ((signed long int) (((((var_1_8 - var_1_8)) > ((var_1_8 - var_1_8))) ? ((var_1_8 - var_1_8)) : ((var_1_8 - var_1_8))))))) && (var_1_8 == ((unsigned char) (var_1_9 + 100)))) && (var_1_10 == ((float) ((((var_1_11) < (64.15f)) ? (var_1_11) : (64.15f)))))) && (((- var_1_10) > var_1_11) ? (var_1_12 == ((unsigned char) (var_1_13 || (var_1_17 && (var_1_15 || var_1_16))))) : (var_1_12 == ((unsigned char) ((var_1_1 <= var_1_9) && var_1_16))))) && ((var_1_11 <= var_1_10) ? ((var_1_1 != var_1_8) ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : ((var_1_8 <= 1000000) ? (var_1_17 == ((unsigned char) 0)) : (var_1_17 == ((unsigned char) 0)))) ; VAL [\result=0, isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] [L19] reach_error() VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=-256, var_1_1=0, var_1_8=227, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, 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, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 52 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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.2s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 75 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-11-10 09:04:22,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:04:24,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:04:24,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:04:24,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:04:24,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:04:24,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:04:24,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:04:24,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:04:24,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:04:24,448 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:04:24,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:04:24,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:04:24,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:04:24,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:04:24,450 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:04:24,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:04:24,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:04:24,454 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:04:24,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:04:24,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:04:24,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:04:24,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:04:24,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:04:24,457 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:04:24,457 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:04:24,457 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:04:24,458 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:04:24,458 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:04:24,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:04:24,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:04:24,459 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:04:24,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:04:24,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:04:24,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:04:24,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:04:24,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:04:24,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:04:24,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:04:24,461 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:04:24,462 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:04:24,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:04:24,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:04:24,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:04:24,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:04:24,464 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 [2024-11-10 09:04:24,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:04:24,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:04:24,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:04:24,804 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:04:24,805 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:04:24,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2024-11-10 09:04:26,374 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:04:26,596 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:04:26,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2024-11-10 09:04:26,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d15d5427/f0da2d949d654bbabbee61ae93381174/FLAG814c3984e [2024-11-10 09:04:26,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d15d5427/f0da2d949d654bbabbee61ae93381174 [2024-11-10 09:04:26,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:04:26,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:04:26,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:04:26,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:04:26,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:04:26,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:04:26" (1/1) ... [2024-11-10 09:04:26,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a8e0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:26, skipping insertion in model container [2024-11-10 09:04:26,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:04:26" (1/1) ... [2024-11-10 09:04:27,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:04:27,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i[913,926] [2024-11-10 09:04:27,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:04:27,257 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:04:27,271 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i[913,926] [2024-11-10 09:04:27,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:04:27,328 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:04:27,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:27 WrapperNode [2024-11-10 09:04:27,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:04:27,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:04:27,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:04:27,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:04:27,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:27" (1/1) ... [2024-11-10 09:04:27,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:27" (1/1) ... [2024-11-10 09:04:27,381 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2024-11-10 09:04:27,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:04:27,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:04:27,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:04:27,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:04:27,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:27" (1/1) ... [2024-11-10 09:04:27,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:27" (1/1) ... [2024-11-10 09:04:27,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:27" (1/1) ... [2024-11-10 09:04:27,416 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 09:04:27,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:27" (1/1) ... [2024-11-10 09:04:27,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:27" (1/1) ... [2024-11-10 09:04:27,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:27" (1/1) ... [2024-11-10 09:04:27,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:27" (1/1) ... [2024-11-10 09:04:27,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:27" (1/1) ... [2024-11-10 09:04:27,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:27" (1/1) ... [2024-11-10 09:04:27,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:04:27,441 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:04:27,441 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:04:27,441 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:04:27,442 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:27" (1/1) ... [2024-11-10 09:04:27,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:04:27,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:04:27,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:04:27,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:04:27,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:04:27,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:04:27,521 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:04:27,521 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:04:27,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:04:27,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:04:27,606 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:04:27,609 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:04:27,835 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 09:04:27,836 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:04:27,848 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:04:27,850 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:04:27,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:04:27 BoogieIcfgContainer [2024-11-10 09:04:27,850 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:04:27,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:04:27,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:04:27,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:04:27,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:04:26" (1/3) ... [2024-11-10 09:04:27,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547a69b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:04:27, skipping insertion in model container [2024-11-10 09:04:27,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:04:27" (2/3) ... [2024-11-10 09:04:27,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547a69b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:04:27, skipping insertion in model container [2024-11-10 09:04:27,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:04:27" (3/3) ... [2024-11-10 09:04:27,859 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-42.i [2024-11-10 09:04:27,873 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:04:27,874 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:04:27,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:04:27,936 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;@5e626693, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:04:27,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:04:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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-11-10 09:04:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 09:04:27,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:04:27,952 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, 1, 1, 1, 1, 1] [2024-11-10 09:04:27,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:04:27,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:04:27,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1827585352, now seen corresponding path program 1 times [2024-11-10 09:04:27,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:04:27,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123589633] [2024-11-10 09:04:27,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:04:27,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:04:27,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:04:27,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:04:27,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 09:04:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:04:28,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:04:28,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:04:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-10 09:04:28,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:04:28,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:04:28,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123589633] [2024-11-10 09:04:28,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123589633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:04:28,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:04:28,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:04:28,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826237535] [2024-11-10 09:04:28,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:04:28,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:04:28,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:04:28,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:04:28,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:04:28,221 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-11-10 09:04:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:04:28,249 INFO L93 Difference]: Finished difference Result 80 states and 128 transitions. [2024-11-10 09:04:28,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:04:28,252 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 76 [2024-11-10 09:04:28,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:04:28,259 INFO L225 Difference]: With dead ends: 80 [2024-11-10 09:04:28,259 INFO L226 Difference]: Without dead ends: 39 [2024-11-10 09:04:28,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:04:28,268 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:04:28,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:04:28,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-10 09:04:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-10 09:04:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 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-11-10 09:04:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-10 09:04:28,315 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 76 [2024-11-10 09:04:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:04:28,316 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-10 09:04:28,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-11-10 09:04:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-10 09:04:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 09:04:28,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:04:28,320 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, 1, 1, 1, 1, 1] [2024-11-10 09:04:28,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 09:04:28,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:04:28,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:04:28,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:04:28,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1883698010, now seen corresponding path program 1 times [2024-11-10 09:04:28,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:04:28,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285242606] [2024-11-10 09:04:28,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:04:28,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:04:28,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:04:28,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:04:28,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 09:04:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:04:28,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 09:04:28,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:04:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 09:04:46,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:05:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-10 09:05:12,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:05:12,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285242606] [2024-11-10 09:05:12,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285242606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 09:05:12,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:05:12,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2024-11-10 09:05:12,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303758102] [2024-11-10 09:05:12,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 09:05:12,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 09:05:12,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:05:12,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 09:05:12,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2024-11-10 09:05:12,462 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 32 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 5 states have call successors, (17), 4 states have call predecessors, (17), 10 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-10 09:05:14,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:05:14,392 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2024-11-10 09:05:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-10 09:05:14,393 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 5 states have call successors, (17), 4 states have call predecessors, (17), 10 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 76 [2024-11-10 09:05:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:05:14,396 INFO L225 Difference]: With dead ends: 91 [2024-11-10 09:05:14,396 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 09:05:14,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=617, Invalid=1933, Unknown=0, NotChecked=0, Total=2550 [2024-11-10 09:05:14,398 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 164 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 09:05:14,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 215 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 09:05:14,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 09:05:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 55. [2024-11-10 09:05:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 09:05:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-11-10 09:05:14,416 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 76 [2024-11-10 09:05:14,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:05:14,417 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-11-10 09:05:14,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 5 states have call successors, (17), 4 states have call predecessors, (17), 10 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-10 09:05:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2024-11-10 09:05:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 09:05:14,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:05:14,422 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, 1, 1, 1, 1, 1] [2024-11-10 09:05:14,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 09:05:14,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:05:14,623 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:05:14,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:05:14,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1106548411, now seen corresponding path program 1 times [2024-11-10 09:05:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:05:14,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622102377] [2024-11-10 09:05:14,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:05:14,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:05:14,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:05:14,626 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:05:14,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 09:05:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:05:14,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 09:05:14,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:05:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-10 09:05:15,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:05:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-10 09:05:40,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:05:40,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622102377] [2024-11-10 09:05:40,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622102377] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 09:05:40,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:05:40,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2024-11-10 09:05:40,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058318808] [2024-11-10 09:05:40,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:05:40,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:05:40,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:05:40,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:05:40,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2024-11-10 09:05:40,073 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-11-10 09:05:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:05:41,581 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2024-11-10 09:05:41,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:05:41,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 76 [2024-11-10 09:05:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:05:41,584 INFO L225 Difference]: With dead ends: 76 [2024-11-10 09:05:41,584 INFO L226 Difference]: Without dead ends: 73 [2024-11-10 09:05:41,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2024-11-10 09:05:41,585 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 44 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:05:41,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 191 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:05:41,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-10 09:05:41,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2024-11-10 09:05:41,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 09:05:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2024-11-10 09:05:41,607 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 76 [2024-11-10 09:05:41,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:05:41,608 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2024-11-10 09:05:41,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-11-10 09:05:41,608 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2024-11-10 09:05:41,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 09:05:41,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:05:41,610 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, 1, 1, 1, 1, 1] [2024-11-10 09:05:41,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 09:05:41,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:05:41,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:05:41,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:05:41,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1135177562, now seen corresponding path program 1 times [2024-11-10 09:05:41,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:05:41,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051200834] [2024-11-10 09:05:41,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:05:41,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:05:41,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:05:41,815 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:05:41,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 09:05:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:05:41,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 09:05:41,879 INFO L278 TraceCheckSpWp]: Computing forward predicates...