./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.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 83837f94fc7bd30360fd01d655750d82d3cc2bacf5947cc8d97518c23fb519c1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:51:09,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:51:09,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:51:09,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:51:09,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:51:09,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:51:09,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:51:09,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:51:09,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:51:09,244 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:51:09,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:51:09,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:51:09,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:51:09,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:51:09,248 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:51:09,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:51:09,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:51:09,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:51:09,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:51:09,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:51:09,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:51:09,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:51:09,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:51:09,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:51:09,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:51:09,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:51:09,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:51:09,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:51:09,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:51:09,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:51:09,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:51:09,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:51:09,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:51:09,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:51:09,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:51:09,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:51:09,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:51:09,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:51:09,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:51:09,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:51:09,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:51:09,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:51:09,261 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 -> 83837f94fc7bd30360fd01d655750d82d3cc2bacf5947cc8d97518c23fb519c1 [2024-10-13 05:51:09,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:51:09,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:51:09,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:51:09,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:51:09,587 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:51:09,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.i [2024-10-13 05:51:11,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:51:11,268 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:51:11,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.i [2024-10-13 05:51:11,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42e1f7ab6/4cca982378a64e4d9606746cdd40f5ea/FLAG781b5a8b9 [2024-10-13 05:51:11,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42e1f7ab6/4cca982378a64e4d9606746cdd40f5ea [2024-10-13 05:51:11,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:51:11,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:51:11,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:51:11,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:51:11,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:51:11,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:51:11" (1/1) ... [2024-10-13 05:51:11,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c27ba27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:11, skipping insertion in model container [2024-10-13 05:51:11,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:51:11" (1/1) ... [2024-10-13 05:51:11,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:51:11,495 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.i[912,925] [2024-10-13 05:51:11,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:51:11,543 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:51:11,558 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.i[912,925] [2024-10-13 05:51:11,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:51:11,597 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:51:11,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:11 WrapperNode [2024-10-13 05:51:11,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:51:11,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:51:11,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:51:11,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:51:11,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:11" (1/1) ... [2024-10-13 05:51:11,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:11" (1/1) ... [2024-10-13 05:51:11,648 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-13 05:51:11,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:51:11,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:51:11,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:51:11,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:51:11,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:11" (1/1) ... [2024-10-13 05:51:11,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:11" (1/1) ... [2024-10-13 05:51:11,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:11" (1/1) ... [2024-10-13 05:51:11,677 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:51:11,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:11" (1/1) ... [2024-10-13 05:51:11,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:11" (1/1) ... [2024-10-13 05:51:11,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:11" (1/1) ... [2024-10-13 05:51:11,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:11" (1/1) ... [2024-10-13 05:51:11,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:11" (1/1) ... [2024-10-13 05:51:11,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:11" (1/1) ... [2024-10-13 05:51:11,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:51:11,699 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:51:11,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:51:11,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:51:11,700 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:11" (1/1) ... [2024-10-13 05:51:11,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:51:11,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:51:11,746 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-10-13 05:51:11,750 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-10-13 05:51:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:51:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:51:11,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:51:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:51:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:51:11,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:51:11,885 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:51:11,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:51:12,285 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 05:51:12,286 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:51:12,352 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:51:12,352 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:51:12,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:51:12 BoogieIcfgContainer [2024-10-13 05:51:12,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:51:12,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:51:12,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:51:12,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:51:12,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:51:11" (1/3) ... [2024-10-13 05:51:12,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2311a567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:51:12, skipping insertion in model container [2024-10-13 05:51:12,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:11" (2/3) ... [2024-10-13 05:51:12,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2311a567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:51:12, skipping insertion in model container [2024-10-13 05:51:12,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:51:12" (3/3) ... [2024-10-13 05:51:12,363 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-8.i [2024-10-13 05:51:12,380 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:51:12,380 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:51:12,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:51:12,463 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;@31578eea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:51:12,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:51:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:51:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 05:51:12,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:51:12,482 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:51:12,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:51:12,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:51:12,489 INFO L85 PathProgramCache]: Analyzing trace with hash -899899240, now seen corresponding path program 1 times [2024-10-13 05:51:12,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:51:12,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133717182] [2024-10-13 05:51:12,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:51:12,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:51:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:12,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:51:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:12,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:51:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:12,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:51:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:12,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:51:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:12,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:51:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:12,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:51:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:12,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:51:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:12,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:51:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:12,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:51:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:12,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 05:51:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:12,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 05:51:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:12,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:51:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:12,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 05:51:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:12,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 05:51:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:51:12,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:51:12,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133717182] [2024-10-13 05:51:12,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133717182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:51:12,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:51:12,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:51:12,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829402717] [2024-10-13 05:51:12,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:51:12,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:51:12,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:51:12,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:51:12,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:51:12,898 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:51:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:51:12,947 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2024-10-13 05:51:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:51:12,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2024-10-13 05:51:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:51:12,961 INFO L225 Difference]: With dead ends: 79 [2024-10-13 05:51:12,961 INFO L226 Difference]: Without dead ends: 39 [2024-10-13 05:51:12,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:51:12,973 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:51:12,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:51:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-13 05:51:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-13 05:51:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:51:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2024-10-13 05:51:13,032 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 88 [2024-10-13 05:51:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:51:13,034 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2024-10-13 05:51:13,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:51:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2024-10-13 05:51:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 05:51:13,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:51:13,040 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:51:13,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:51:13,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:51:13,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:51:13,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1587462192, now seen corresponding path program 1 times [2024-10-13 05:51:13,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:51:13,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059052729] [2024-10-13 05:51:13,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:51:13,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:51:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:13,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:51:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:13,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:51:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:13,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:51:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:51:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:13,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:51:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:51:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:13,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:51:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:13,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:51:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:13,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:51:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:13,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 05:51:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:13,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 05:51:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:13,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:51:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:13,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 05:51:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:13,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 05:51:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:51:13,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:51:13,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059052729] [2024-10-13 05:51:13,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059052729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:51:13,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:51:13,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:51:13,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804786952] [2024-10-13 05:51:13,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:51:13,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:51:13,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:51:13,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:51:13,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:51:13,405 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:51:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:51:13,565 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2024-10-13 05:51:13,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:51:13,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2024-10-13 05:51:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:51:13,568 INFO L225 Difference]: With dead ends: 77 [2024-10-13 05:51:13,568 INFO L226 Difference]: Without dead ends: 39 [2024-10-13 05:51:13,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:51:13,570 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 49 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:51:13,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 65 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:51:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-13 05:51:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-13 05:51:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:51:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2024-10-13 05:51:13,582 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 88 [2024-10-13 05:51:13,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:51:13,586 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2024-10-13 05:51:13,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:51:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2024-10-13 05:51:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 05:51:13,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:51:13,588 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:51:13,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:51:13,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:51:13,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:51:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1585615150, now seen corresponding path program 1 times [2024-10-13 05:51:13,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:51:13,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189864140] [2024-10-13 05:51:13,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:51:13,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:51:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:51:13,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:51:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:51:13,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:51:13,845 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:51:13,847 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:51:13,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:51:13,852 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 05:51:13,932 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:51:13,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:51:13 BoogieIcfgContainer [2024-10-13 05:51:13,937 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:51:13,939 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:51:13,939 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:51:13,939 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:51:13,940 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:51:12" (3/4) ... [2024-10-13 05:51:13,942 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:51:13,943 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:51:13,945 INFO L158 Benchmark]: Toolchain (without parser) took 2638.73ms. Allocated memory is still 157.3MB. Free memory was 126.4MB in the beginning and 114.7MB in the end (delta: 11.6MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-10-13 05:51:13,946 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:51:13,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.19ms. Allocated memory is still 157.3MB. Free memory was 126.4MB in the beginning and 112.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 05:51:13,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.62ms. Allocated memory is still 157.3MB. Free memory was 112.9MB in the beginning and 109.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:51:13,949 INFO L158 Benchmark]: Boogie Preprocessor took 48.94ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 107.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:51:13,949 INFO L158 Benchmark]: RCFGBuilder took 654.78ms. Allocated memory is still 157.3MB. Free memory was 107.6MB in the beginning and 117.5MB in the end (delta: -9.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 05:51:13,950 INFO L158 Benchmark]: TraceAbstraction took 1581.37ms. Allocated memory is still 157.3MB. Free memory was 117.5MB in the beginning and 115.8MB in the end (delta: 1.7MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. [2024-10-13 05:51:13,950 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 157.3MB. Free memory was 115.8MB in the beginning and 114.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:51:13,951 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 109.1MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.19ms. Allocated memory is still 157.3MB. Free memory was 126.4MB in the beginning and 112.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.62ms. Allocated memory is still 157.3MB. Free memory was 112.9MB in the beginning and 109.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.94ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 107.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 654.78ms. Allocated memory is still 157.3MB. Free memory was 107.6MB in the beginning and 117.5MB in the end (delta: -9.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1581.37ms. Allocated memory is still 157.3MB. Free memory was 117.5MB in the beginning and 115.8MB in the end (delta: 1.7MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 157.3MB. Free memory was 115.8MB in the beginning and 114.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryArithmeticFLOAToperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] signed long int var_1_8 = 64; [L28] float var_1_12 = 2.4; [L29] float var_1_13 = 127.75; [L30] float var_1_14 = 0.0; [L31] float var_1_15 = 31.4; [L32] float var_1_16 = 256.75; [L33] float var_1_17 = 256.6; [L34] signed long int var_1_18 = 0; [L35] unsigned char var_1_19 = 32; [L36] unsigned char var_1_20 = 100; [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L67] var_1_4 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L68] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L69] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L69] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L72] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L72] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L73] var_1_6 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L75] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L75] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L76] var_1_7 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L77] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L78] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L78] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L79] var_1_13 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L80] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L81] var_1_14 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L82] RET assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L83] var_1_15 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L84] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L85] var_1_16 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L86] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L87] var_1_20 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L88] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L89] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L89] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L102] RET updateVariables() [L103] CALL step() [L40] var_1_17 = var_1_14 [L41] var_1_19 = var_1_20 [L42] var_1_18 = var_1_19 [L43] unsigned char stepLocal_1 = var_1_19; [L44] signed long int stepLocal_0 = (var_1_18 * var_1_18) * (var_1_19 - var_1_19); VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_12=12/5, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L45] COND FALSE !(stepLocal_0 >= 1u) [L52] var_1_8 = var_1_19 VAL [isInitial=1, stepLocal_1=0, var_1_12=12/5, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L54] signed long int stepLocal_2 = var_1_8; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, var_1_12=12/5, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L55] COND FALSE !(var_1_19 > stepLocal_2) [L58] var_1_12 = (var_1_16 - (var_1_14 + var_1_15)) VAL [isInitial=1, stepLocal_1=0, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L60] COND TRUE var_1_18 >= (8u * var_1_8) [L61] var_1_1 = (! (var_1_4 || (var_1_5 || var_1_6))) VAL [isInitial=1, stepLocal_1=0, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L103] RET step() [L104] CALL, EXPR property() [L94-L95] return ((((((var_1_18 >= (8u * var_1_8)) ? (var_1_1 == ((unsigned char) (! (var_1_4 || (var_1_5 || var_1_6))))) : (var_1_1 == ((unsigned char) var_1_7))) && ((((var_1_18 * var_1_18) * (var_1_19 - var_1_19)) >= 1u) ? ((var_1_18 <= var_1_19) ? (var_1_8 == ((signed long int) var_1_19)) : (var_1_8 == ((signed long int) var_1_19))) : (var_1_8 == ((signed long int) var_1_19)))) && ((var_1_19 > var_1_8) ? (var_1_12 == ((float) (var_1_13 + ((var_1_14 - var_1_15) - var_1_16)))) : (var_1_12 == ((float) (var_1_16 - (var_1_14 + var_1_15)))))) && (var_1_17 == ((float) var_1_14))) && (var_1_18 == ((signed long int) var_1_19))) && (var_1_19 == ((unsigned char) var_1_20)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 101 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 728/728 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 05:51:13,989 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.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 83837f94fc7bd30360fd01d655750d82d3cc2bacf5947cc8d97518c23fb519c1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:51:16,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:51:16,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:51:16,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:51:16,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:51:16,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:51:16,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:51:16,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:51:16,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:51:16,495 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:51:16,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:51:16,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:51:16,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:51:16,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:51:16,497 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:51:16,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:51:16,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:51:16,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:51:16,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:51:16,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:51:16,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:51:16,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:51:16,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:51:16,505 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:51:16,505 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:51:16,506 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:51:16,506 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:51:16,506 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:51:16,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:51:16,506 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:51:16,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:51:16,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:51:16,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:51:16,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:51:16,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:51:16,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:51:16,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:51:16,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:51:16,510 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:51:16,510 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:51:16,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:51:16,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:51:16,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:51:16,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:51:16,512 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:51:16,512 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 -> 83837f94fc7bd30360fd01d655750d82d3cc2bacf5947cc8d97518c23fb519c1 [2024-10-13 05:51:16,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:51:16,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:51:16,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:51:16,898 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:51:16,899 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:51:16,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.i [2024-10-13 05:51:18,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:51:18,636 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:51:18,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.i [2024-10-13 05:51:18,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d23536bed/e5cac4f34d1b4510bfb541f5c0d61086/FLAG715f5bc0f [2024-10-13 05:51:18,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d23536bed/e5cac4f34d1b4510bfb541f5c0d61086 [2024-10-13 05:51:18,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:51:18,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:51:18,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:51:18,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:51:18,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:51:18,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:51:18" (1/1) ... [2024-10-13 05:51:18,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a273851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:18, skipping insertion in model container [2024-10-13 05:51:18,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:51:18" (1/1) ... [2024-10-13 05:51:19,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:51:19,214 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.i[912,925] [2024-10-13 05:51:19,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:51:19,278 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:51:19,291 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.i[912,925] [2024-10-13 05:51:19,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:51:19,342 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:51:19,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:19 WrapperNode [2024-10-13 05:51:19,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:51:19,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:51:19,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:51:19,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:51:19,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:19" (1/1) ... [2024-10-13 05:51:19,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:19" (1/1) ... [2024-10-13 05:51:19,387 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-13 05:51:19,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:51:19,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:51:19,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:51:19,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:51:19,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:19" (1/1) ... [2024-10-13 05:51:19,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:19" (1/1) ... [2024-10-13 05:51:19,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:19" (1/1) ... [2024-10-13 05:51:19,422 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:51:19,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:19" (1/1) ... [2024-10-13 05:51:19,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:19" (1/1) ... [2024-10-13 05:51:19,430 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:19" (1/1) ... [2024-10-13 05:51:19,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:19" (1/1) ... [2024-10-13 05:51:19,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:19" (1/1) ... [2024-10-13 05:51:19,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:19" (1/1) ... [2024-10-13 05:51:19,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:51:19,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:51:19,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:51:19,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:51:19,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:19" (1/1) ... [2024-10-13 05:51:19,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:51:19,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:51:19,480 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-10-13 05:51:19,484 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-10-13 05:51:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:51:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:51:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:51:19,521 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:51:19,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:51:19,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:51:19,596 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:51:19,598 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:51:21,467 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 05:51:21,467 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:51:21,538 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:51:21,539 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:51:21,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:51:21 BoogieIcfgContainer [2024-10-13 05:51:21,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:51:21,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:51:21,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:51:21,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:51:21,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:51:18" (1/3) ... [2024-10-13 05:51:21,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2941b140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:51:21, skipping insertion in model container [2024-10-13 05:51:21,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:51:19" (2/3) ... [2024-10-13 05:51:21,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2941b140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:51:21, skipping insertion in model container [2024-10-13 05:51:21,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:51:21" (3/3) ... [2024-10-13 05:51:21,552 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-8.i [2024-10-13 05:51:21,569 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:51:21,570 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:51:21,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:51:21,629 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;@746f5b3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:51:21,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:51:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:51:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 05:51:21,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:51:21,645 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:51:21,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:51:21,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:51:21,652 INFO L85 PathProgramCache]: Analyzing trace with hash -899899240, now seen corresponding path program 1 times [2024-10-13 05:51:21,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:51:21,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075825172] [2024-10-13 05:51:21,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:51:21,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:51:21,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:51:21,671 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-10-13 05:51:21,672 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-10-13 05:51:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:22,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:51:22,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:51:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-10-13 05:51:22,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:51:22,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:51:22,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075825172] [2024-10-13 05:51:22,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075825172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:51:22,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:51:22,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:51:22,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199407897] [2024-10-13 05:51:22,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:51:22,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:51:22,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:51:22,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:51:22,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:51:22,109 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:51:23,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:51:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:51:23,209 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2024-10-13 05:51:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:51:23,228 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2024-10-13 05:51:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:51:23,234 INFO L225 Difference]: With dead ends: 79 [2024-10-13 05:51:23,234 INFO L226 Difference]: Without dead ends: 39 [2024-10-13 05:51:23,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:51:23,240 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:51:23,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 05:51:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-13 05:51:23,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-13 05:51:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:51:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2024-10-13 05:51:23,289 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 88 [2024-10-13 05:51:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:51:23,290 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2024-10-13 05:51:23,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:51:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2024-10-13 05:51:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 05:51:23,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:51:23,296 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:51:23,307 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-10-13 05:51:23,497 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-10-13 05:51:23,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:51:23,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:51:23,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1587462192, now seen corresponding path program 1 times [2024-10-13 05:51:23,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:51:23,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141815929] [2024-10-13 05:51:23,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:51:23,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:51:23,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:51:23,502 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-10-13 05:51:23,504 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-10-13 05:51:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:23,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 05:51:23,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:51:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:51:24,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:51:24,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:51:24,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141815929] [2024-10-13 05:51:24,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141815929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:51:24,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:51:24,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:51:24,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294882363] [2024-10-13 05:51:24,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:51:24,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:51:24,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:51:24,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:51:24,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:51:24,075 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:51:27,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:51:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:51:27,458 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2024-10-13 05:51:27,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:51:27,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2024-10-13 05:51:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:51:27,462 INFO L225 Difference]: With dead ends: 105 [2024-10-13 05:51:27,462 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 05:51:27,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:51:27,464 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 71 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:51:27,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 140 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-13 05:51:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 05:51:27,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 39. [2024-10-13 05:51:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:51:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2024-10-13 05:51:27,491 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 88 [2024-10-13 05:51:27,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:51:27,493 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2024-10-13 05:51:27,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:51:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2024-10-13 05:51:27,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 05:51:27,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:51:27,497 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:51:27,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 05:51:27,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:51:27,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:51:27,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:51:27,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1585615150, now seen corresponding path program 1 times [2024-10-13 05:51:27,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:51:27,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166686351] [2024-10-13 05:51:27,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:51:27,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:51:27,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:51:27,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:51:27,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 05:51:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:51:28,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 05:51:28,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:51:57,446 WARN L286 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 05:52:06,488 WARN L286 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 05:52:26,806 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 05:52:33,685 WARN L286 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)