./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.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 afae07a7e8a468ecc7c0f4a08803b8b183d56b14bf458e30f12588ce54318aab --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:26:18,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:26:19,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:26:19,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:26:19,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:26:19,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:26:19,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:26:19,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:26:19,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:26:19,082 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:26:19,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:26:19,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:26:19,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:26:19,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:26:19,084 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:26:19,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:26:19,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:26:19,084 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:26:19,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:26:19,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:26:19,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:26:19,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:26:19,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:26:19,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:26:19,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:26:19,089 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:26:19,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:26:19,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:26:19,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:26:19,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:26:19,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:26:19,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:26:19,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:26:19,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:26:19,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:26:19,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:26:19,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:26:19,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:26:19,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:26:19,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:26:19,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:26:19,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:26:19,093 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 -> afae07a7e8a468ecc7c0f4a08803b8b183d56b14bf458e30f12588ce54318aab [2024-11-09 01:26:19,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:26:19,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:26:19,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:26:19,309 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:26:19,309 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:26:19,310 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-95.i [2024-11-09 01:26:20,494 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:26:20,660 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:26:20,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i [2024-11-09 01:26:20,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c41442470/dc91c008960d4a21b040ffe53f4d2076/FLAGc49299606 [2024-11-09 01:26:21,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c41442470/dc91c008960d4a21b040ffe53f4d2076 [2024-11-09 01:26:21,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:26:21,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:26:21,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:21,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:26:21,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:26:21,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:21" (1/1) ... [2024-11-09 01:26:21,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639d0c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:21, skipping insertion in model container [2024-11-09 01:26:21,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:21" (1/1) ... [2024-11-09 01:26:21,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:26:21,192 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-95.i[913,926] [2024-11-09 01:26:21,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:21,261 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:26:21,276 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-95.i[913,926] [2024-11-09 01:26:21,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:21,313 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:26:21,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:21 WrapperNode [2024-11-09 01:26:21,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:21,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:21,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:26:21,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:26:21,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:21" (1/1) ... [2024-11-09 01:26:21,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:21" (1/1) ... [2024-11-09 01:26:21,364 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-09 01:26:21,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:21,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:26:21,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:26:21,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:26:21,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:21" (1/1) ... [2024-11-09 01:26:21,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:21" (1/1) ... [2024-11-09 01:26:21,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:21" (1/1) ... [2024-11-09 01:26:21,395 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 01:26:21,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:21" (1/1) ... [2024-11-09 01:26:21,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:21" (1/1) ... [2024-11-09 01:26:21,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:21" (1/1) ... [2024-11-09 01:26:21,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:21" (1/1) ... [2024-11-09 01:26:21,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:21" (1/1) ... [2024-11-09 01:26:21,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:21" (1/1) ... [2024-11-09 01:26:21,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:26:21,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:26:21,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:26:21,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:26:21,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:21" (1/1) ... [2024-11-09 01:26:21,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:26:21,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:26:21,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:26:21,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:26:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:26:21,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:26:21,491 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:26:21,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:26:21,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:26:21,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:26:21,554 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:26:21,556 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:26:21,823 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-09 01:26:21,824 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:26:21,837 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:26:21,837 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:26:21,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:21 BoogieIcfgContainer [2024-11-09 01:26:21,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:26:21,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:26:21,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:26:21,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:26:21,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:26:21" (1/3) ... [2024-11-09 01:26:21,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11be00ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:21, skipping insertion in model container [2024-11-09 01:26:21,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:21" (2/3) ... [2024-11-09 01:26:21,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11be00ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:21, skipping insertion in model container [2024-11-09 01:26:21,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:21" (3/3) ... [2024-11-09 01:26:21,845 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-95.i [2024-11-09 01:26:21,858 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:26:21,858 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:26:21,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:26:21,913 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;@16ee805d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:26:21,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:26:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:26:21,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 01:26:21,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:21,927 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:21,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:21,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:21,931 INFO L85 PathProgramCache]: Analyzing trace with hash -483140881, now seen corresponding path program 1 times [2024-11-09 01:26:21,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:26:21,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739575096] [2024-11-09 01:26:21,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:21,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:26:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:26:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:26:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:26:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 01:26:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 01:26:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:26:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:26:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:26:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:26:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 01:26:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:26:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 01:26:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:26:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:26:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 01:26:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:26:22,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:26:22,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739575096] [2024-11-09 01:26:22,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739575096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:22,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:22,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:26:22,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141024606] [2024-11-09 01:26:22,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:22,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:26:22,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:26:22,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:26:22,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:26:22,193 INFO L87 Difference]: Start difference. First operand has 64 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:26:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:22,212 INFO L93 Difference]: Finished difference Result 121 states and 196 transitions. [2024-11-09 01:26:22,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:26:22,214 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2024-11-09 01:26:22,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:22,228 INFO L225 Difference]: With dead ends: 121 [2024-11-09 01:26:22,228 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 01:26:22,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:26:22,235 INFO L432 NwaCegarLoop]: 86 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, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:22,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:26:22,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 01:26:22,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-09 01:26:22,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:26:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 86 transitions. [2024-11-09 01:26:22,268 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 86 transitions. Word has length 107 [2024-11-09 01:26:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:22,269 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 86 transitions. [2024-11-09 01:26:22,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:26:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 86 transitions. [2024-11-09 01:26:22,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 01:26:22,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:22,272 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:22,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:26:22,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:22,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash -466849305, now seen corresponding path program 1 times [2024-11-09 01:26:22,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:26:22,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923343643] [2024-11-09 01:26:22,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:22,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:26:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:26:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:26:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:26:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 01:26:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 01:26:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:26:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 01:26:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:26:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:26:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 01:26:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:26:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 01:26:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:26:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:26:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 01:26:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:26:22,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:26:22,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923343643] [2024-11-09 01:26:22,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923343643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:22,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:22,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:26:22,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161075276] [2024-11-09 01:26:22,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:22,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:26:22,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:26:22,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:26:22,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:26:22,622 INFO L87 Difference]: Start difference. First operand 60 states and 86 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:26:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:22,643 INFO L93 Difference]: Finished difference Result 118 states and 171 transitions. [2024-11-09 01:26:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:26:22,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-11-09 01:26:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:22,644 INFO L225 Difference]: With dead ends: 118 [2024-11-09 01:26:22,645 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 01:26:22,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:26:22,646 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:22,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:26:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 01:26:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 01:26:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:26:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2024-11-09 01:26:22,653 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 107 [2024-11-09 01:26:22,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:22,656 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2024-11-09 01:26:22,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:26:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2024-11-09 01:26:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 01:26:22,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:22,659 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:22,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:26:22,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:22,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash -173030421, now seen corresponding path program 1 times [2024-11-09 01:26:22,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:26:22,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456143813] [2024-11-09 01:26:22,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:22,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:26:22,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768218443] [2024-11-09 01:26:22,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:22,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:26:22,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:26:22,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:26:22,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:26:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:26:22,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:26:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:26:22,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:26:22,921 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:26:22,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:26:22,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:26:23,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:26:23,128 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 01:26:23,182 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:26:23,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:26:23 BoogieIcfgContainer [2024-11-09 01:26:23,185 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:26:23,186 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:26:23,186 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:26:23,186 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:26:23,186 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:21" (3/4) ... [2024-11-09 01:26:23,188 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:26:23,189 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:26:23,190 INFO L158 Benchmark]: Toolchain (without parser) took 2132.93ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 66.5MB in the beginning and 74.2MB in the end (delta: -7.8MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2024-11-09 01:26:23,190 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 100.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:26:23,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.50ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 66.3MB in the beginning and 156.2MB in the end (delta: -89.9MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-09 01:26:23,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.38ms. Allocated memory is still 188.7MB. Free memory was 156.2MB in the beginning and 153.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:26:23,191 INFO L158 Benchmark]: Boogie Preprocessor took 46.33ms. Allocated memory is still 188.7MB. Free memory was 153.0MB in the beginning and 148.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 01:26:23,191 INFO L158 Benchmark]: RCFGBuilder took 425.93ms. Allocated memory is still 188.7MB. Free memory was 147.8MB in the beginning and 127.8MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 01:26:23,191 INFO L158 Benchmark]: TraceAbstraction took 1345.80ms. Allocated memory is still 188.7MB. Free memory was 126.9MB in the beginning and 74.2MB in the end (delta: 52.6MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2024-11-09 01:26:23,192 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 188.7MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:26:23,195 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.14ms. Allocated memory is still 138.4MB. Free memory is still 100.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.50ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 66.3MB in the beginning and 156.2MB in the end (delta: -89.9MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.38ms. Allocated memory is still 188.7MB. Free memory was 156.2MB in the beginning and 153.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.33ms. Allocated memory is still 188.7MB. Free memory was 153.0MB in the beginning and 148.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 425.93ms. Allocated memory is still 188.7MB. Free memory was 147.8MB in the beginning and 127.8MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1345.80ms. Allocated memory is still 188.7MB. Free memory was 126.9MB in the beginning and 74.2MB in the end (delta: 52.6MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 188.7MB. Free memory is still 74.2MB. 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 88, overapproximation of shiftRight at line 47, overapproximation of someBinaryArithmeticFLOAToperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] float var_1_3 = 1.8; [L24] float var_1_4 = 8.54; [L25] float var_1_5 = 255.8; [L26] float var_1_6 = 50.4; [L27] unsigned char var_1_7 = 0; [L28] unsigned long int var_1_8 = 8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 5; [L31] unsigned char var_1_12 = 2; [L32] signed short int var_1_13 = 0; [L33] unsigned long int var_1_14 = 16; [L34] signed char var_1_16 = -1; [L35] signed char var_1_17 = -16; [L36] unsigned char last_1_var_1_7 = 0; VAL [isInitial=0, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_4=427/50, var_1_5=1279/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] CALL updateLastVariables() [L85] last_1_var_1_7 = var_1_7 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_4=427/50, var_1_5=1279/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L95] RET updateLastVariables() [L96] CALL updateVariables() [L58] var_1_4 = __VERIFIER_nondet_float() [L59] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_5=1279/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_5=1279/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L59] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_5=1279/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L60] var_1_5 = __VERIFIER_nondet_float() [L61] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L61] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L62] var_1_6 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=8] [L63] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=8] [L64] var_1_8 = __VERIFIER_nondet_ulong() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0] [L66] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L66] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L67] var_1_10 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L68] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L69] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L69] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L70] var_1_11 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L71] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L72] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L72] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L73] var_1_12 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L74] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L75] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L75] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L76] var_1_14 = __VERIFIER_nondet_ulong() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L78] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L78] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L79] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L79] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L80] var_1_17 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L81] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L82] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=0] [L96] RET updateVariables() [L97] CALL step() [L40] var_1_1 = ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))) [L41] var_1_3 = ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f))))) [L42] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=0] [L43] EXPR var_1_16 & var_1_1 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=0] [L43] signed long int stepLocal_0 = var_1_16 & var_1_1; [L44] COND TRUE (- (3351680781u - var_1_8)) > stepLocal_0 [L45] var_1_7 = (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=1, var_1_8=0] [L47] EXPR var_1_7 >> var_1_7 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=1, var_1_8=0] [L47] COND TRUE (var_1_16 / var_1_14) < (var_1_7 >> var_1_7) [L48] var_1_13 = ((((4 - var_1_11) < 0 ) ? -(4 - var_1_11) : (4 - var_1_11))) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=4, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=1, var_1_8=0] [L97] RET step() [L98] CALL, EXPR property() [L88] EXPR ((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((float) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=4, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=1, var_1_8=0] [L88] EXPR (((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((float) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1)) && (((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) ? (var_1_13 == ((signed short int) ((((4 - var_1_11) < 0 ) ? -(4 - var_1_11) : (4 - var_1_11))))) : ((var_1_16 >= var_1_1) ? (var_1_13 == ((signed short int) (-5 + (var_1_12 - var_1_11)))) : (var_1_13 == ((signed short int) 256)))) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=4, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=1, var_1_8=0] [L88-L89] return ((((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((float) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1)) && (((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) ? (var_1_13 == ((signed short int) ((((4 - var_1_11) < 0 ) ? -(4 - var_1_11) : (4 - var_1_11))))) : ((var_1_16 >= var_1_1) ? (var_1_13 == ((signed short int) (-5 + (var_1_12 - var_1_11)))) : (var_1_13 == ((signed short int) 256))))) && (var_1_16 == ((signed char) var_1_17)) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=4, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_7=0, var_1_10=-256, var_1_11=0, var_1_12=1, var_1_13=4, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 16, 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, 251 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 171 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:26:23,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.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 afae07a7e8a468ecc7c0f4a08803b8b183d56b14bf458e30f12588ce54318aab --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:26:25,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:26:25,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:26:25,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:26:25,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:26:25,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:26:25,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:26:25,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:26:25,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:26:25,170 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:26:25,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:26:25,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:26:25,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:26:25,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:26:25,172 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:26:25,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:26:25,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:26:25,173 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:26:25,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:26:25,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:26:25,173 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:26:25,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:26:25,174 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:26:25,174 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:26:25,174 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:26:25,174 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:26:25,175 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:26:25,175 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:26:25,175 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:26:25,175 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:26:25,175 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:26:25,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:26:25,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:26:25,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:26:25,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:26:25,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:26:25,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:26:25,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:26:25,180 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:26:25,180 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:26:25,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:26:25,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:26:25,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:26:25,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:26:25,182 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 -> afae07a7e8a468ecc7c0f4a08803b8b183d56b14bf458e30f12588ce54318aab [2024-11-09 01:26:25,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:26:25,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:26:25,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:26:25,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:26:25,436 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:26:25,437 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-95.i [2024-11-09 01:26:26,677 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:26:26,843 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:26:26,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i [2024-11-09 01:26:26,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48eece927/0c796f97bf1d4a828a59d38ad26bbd0d/FLAG1bb077ac2 [2024-11-09 01:26:27,238 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48eece927/0c796f97bf1d4a828a59d38ad26bbd0d [2024-11-09 01:26:27,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:26:27,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:26:27,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:27,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:26:27,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:26:27,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:27" (1/1) ... [2024-11-09 01:26:27,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704e4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:27, skipping insertion in model container [2024-11-09 01:26:27,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:27" (1/1) ... [2024-11-09 01:26:27,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:26:27,409 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-95.i[913,926] [2024-11-09 01:26:27,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:27,471 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:26:27,482 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-95.i[913,926] [2024-11-09 01:26:27,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:27,526 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:26:27,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:27 WrapperNode [2024-11-09 01:26:27,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:27,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:27,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:26:27,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:26:27,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:27" (1/1) ... [2024-11-09 01:26:27,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:27" (1/1) ... [2024-11-09 01:26:27,576 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-11-09 01:26:27,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:27,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:26:27,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:26:27,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:26:27,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:27" (1/1) ... [2024-11-09 01:26:27,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:27" (1/1) ... [2024-11-09 01:26:27,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:27" (1/1) ... [2024-11-09 01:26:27,613 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 01:26:27,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:27" (1/1) ... [2024-11-09 01:26:27,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:27" (1/1) ... [2024-11-09 01:26:27,622 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:27" (1/1) ... [2024-11-09 01:26:27,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:27" (1/1) ... [2024-11-09 01:26:27,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:27" (1/1) ... [2024-11-09 01:26:27,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:27" (1/1) ... [2024-11-09 01:26:27,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:26:27,635 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:26:27,638 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:26:27,638 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:26:27,639 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:27" (1/1) ... [2024-11-09 01:26:27,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:26:27,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:26:27,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:26:27,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:26:27,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:26:27,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:26:27,714 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:26:27,715 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:26:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:26:27,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:26:27,793 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:26:27,795 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:26:28,881 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 01:26:28,882 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:26:28,892 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:26:28,893 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:26:28,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:28 BoogieIcfgContainer [2024-11-09 01:26:28,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:26:28,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:26:28,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:26:28,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:26:28,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:26:27" (1/3) ... [2024-11-09 01:26:28,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343cebe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:28, skipping insertion in model container [2024-11-09 01:26:28,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:27" (2/3) ... [2024-11-09 01:26:28,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343cebe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:28, skipping insertion in model container [2024-11-09 01:26:28,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:28" (3/3) ... [2024-11-09 01:26:28,899 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-95.i [2024-11-09 01:26:28,911 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:26:28,911 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:26:28,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:26:28,971 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;@24affcd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:26:28,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:26:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:26:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:26:28,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:28,985 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:28,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:28,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:28,991 INFO L85 PathProgramCache]: Analyzing trace with hash -934264968, now seen corresponding path program 1 times [2024-11-09 01:26:29,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:26:29,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651427270] [2024-11-09 01:26:29,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:29,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:26:29,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:26:29,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:26:29,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:26:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:29,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:26:29,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-09 01:26:29,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:26:29,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:26:29,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651427270] [2024-11-09 01:26:29,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651427270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:29,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:29,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:26:29,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514636448] [2024-11-09 01:26:29,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:29,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:26:29,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:26:29,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:26:29,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:26:29,360 INFO L87 Difference]: Start difference. First operand has 47 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:26:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:29,377 INFO L93 Difference]: Finished difference Result 87 states and 146 transitions. [2024-11-09 01:26:29,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:26:29,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2024-11-09 01:26:29,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:29,383 INFO L225 Difference]: With dead ends: 87 [2024-11-09 01:26:29,383 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 01:26:29,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:26:29,388 INFO L432 NwaCegarLoop]: 60 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, 60 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:29,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:26:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 01:26:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-09 01:26:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:26:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2024-11-09 01:26:29,418 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 100 [2024-11-09 01:26:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:29,419 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2024-11-09 01:26:29,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:26:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2024-11-09 01:26:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 01:26:29,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:29,422 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:29,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:26:29,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:26:29,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:29,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:29,624 INFO L85 PathProgramCache]: Analyzing trace with hash 905658301, now seen corresponding path program 1 times [2024-11-09 01:26:29,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:26:29,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435470666] [2024-11-09 01:26:29,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:29,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-09 01:26:29,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:26:29,628 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:26:29,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:26:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:29,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 01:26:29,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:00,466 WARN L286 SmtUtils]: Spent 13.23s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:27:36,900 WARN L286 SmtUtils]: Spent 16.70s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)