./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-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9946b8f2044511113ae8f74201f189348f6c8338b35f7642acfb4580613f868c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:09:17,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:09:17,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:09:17,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:09:17,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:09:17,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:09:17,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:09:17,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:09:17,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:09:17,303 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:09:17,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:09:17,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:09:17,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:09:17,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:09:17,306 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:09:17,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:09:17,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:09:17,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:09:17,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:09:17,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:09:17,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:09:17,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:09:17,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:09:17,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:09:17,312 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:09:17,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:09:17,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:09:17,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:09:17,313 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:09:17,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:09:17,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:09:17,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:09:17,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:09:17,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:09:17,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:09:17,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:09:17,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:09:17,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:09:17,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:09:17,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:09:17,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:09:17,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:09:17,317 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9946b8f2044511113ae8f74201f189348f6c8338b35f7642acfb4580613f868c [2024-10-11 13:09:17,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:09:17,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:09:17,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:09:17,630 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:09:17,631 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:09:17,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i [2024-10-11 13:09:19,094 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:09:19,272 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:09:19,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i [2024-10-11 13:09:19,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/290bfe9c0/291011bc481e4ee68ab7302cb3855ab9/FLAG2b4102e71 [2024-10-11 13:09:19,294 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/290bfe9c0/291011bc481e4ee68ab7302cb3855ab9 [2024-10-11 13:09:19,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:09:19,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:09:19,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:09:19,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:09:19,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:09:19,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:09:19" (1/1) ... [2024-10-11 13:09:19,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35aa38d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:19, skipping insertion in model container [2024-10-11 13:09:19,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:09:19" (1/1) ... [2024-10-11 13:09:19,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:09:19,502 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-69.i[913,926] [2024-10-11 13:09:19,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:09:19,583 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:09:19,594 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-69.i[913,926] [2024-10-11 13:09:19,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:09:19,646 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:09:19,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:19 WrapperNode [2024-10-11 13:09:19,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:09:19,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:09:19,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:09:19,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:09:19,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:19" (1/1) ... [2024-10-11 13:09:19,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:19" (1/1) ... [2024-10-11 13:09:19,700 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-11 13:09:19,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:09:19,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:09:19,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:09:19,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:09:19,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:19" (1/1) ... [2024-10-11 13:09:19,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:19" (1/1) ... [2024-10-11 13:09:19,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:19" (1/1) ... [2024-10-11 13:09:19,744 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 13:09:19,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:19" (1/1) ... [2024-10-11 13:09:19,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:19" (1/1) ... [2024-10-11 13:09:19,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:19" (1/1) ... [2024-10-11 13:09:19,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:19" (1/1) ... [2024-10-11 13:09:19,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:19" (1/1) ... [2024-10-11 13:09:19,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:19" (1/1) ... [2024-10-11 13:09:19,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:09:19,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:09:19,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:09:19,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:09:19,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:19" (1/1) ... [2024-10-11 13:09:19,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:09:19,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:09:19,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:09:19,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:09:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:09:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:09:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:09:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:09:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:09:19,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:09:19,910 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:09:19,912 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:09:20,184 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 13:09:20,184 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:09:20,230 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:09:20,230 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:09:20,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:09:20 BoogieIcfgContainer [2024-10-11 13:09:20,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:09:20,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:09:20,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:09:20,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:09:20,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:09:19" (1/3) ... [2024-10-11 13:09:20,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a36bb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:09:20, skipping insertion in model container [2024-10-11 13:09:20,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:19" (2/3) ... [2024-10-11 13:09:20,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a36bb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:09:20, skipping insertion in model container [2024-10-11 13:09:20,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:09:20" (3/3) ... [2024-10-11 13:09:20,239 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-69.i [2024-10-11 13:09:20,256 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:09:20,257 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:09:20,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:09:20,322 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;@c0183c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:09:20,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:09:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:09:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 13:09:20,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:09:20,336 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:09:20,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:09:20,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:09:20,341 INFO L85 PathProgramCache]: Analyzing trace with hash -718405474, now seen corresponding path program 1 times [2024-10-11 13:09:20,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:09:20,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534579449] [2024-10-11 13:09:20,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:09:20,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:09:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:09:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:09:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:09:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:09:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:09:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:09:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:09:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:09:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:09:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:09:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:09:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:09:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:09:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:09:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:09:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 13:09:20,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:09:20,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534579449] [2024-10-11 13:09:20,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534579449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:09:20,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:09:20,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:09:20,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444952491] [2024-10-11 13:09:20,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:09:20,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:09:20,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:09:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:09:20,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:09:20,734 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:09:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:09:20,776 INFO L93 Difference]: Finished difference Result 89 states and 155 transitions. [2024-10-11 13:09:20,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:09:20,779 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 93 [2024-10-11 13:09:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:09:20,787 INFO L225 Difference]: With dead ends: 89 [2024-10-11 13:09:20,788 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 13:09:20,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:09:20,798 INFO L432 NwaCegarLoop]: 63 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, 63 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:09:20,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:09:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 13:09:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 13:09:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:09:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2024-10-11 13:09:20,841 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 93 [2024-10-11 13:09:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:09:20,841 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2024-10-11 13:09:20,842 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:09:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2024-10-11 13:09:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 13:09:20,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:09:20,846 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:09:20,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:09:20,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:09:20,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:09:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1042311708, now seen corresponding path program 1 times [2024-10-11 13:09:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:09:20,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076825831] [2024-10-11 13:09:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:09:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:09:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:09:20,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1717586245] [2024-10-11 13:09:20,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:09:20,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:09:20,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:09:20,985 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:09:20,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:09:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:09:21,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:09:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:09:21,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:09:21,277 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:09:21,279 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:09:21,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:09:21,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:09:21,485 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 13:09:21,556 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:09:21,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:09:21 BoogieIcfgContainer [2024-10-11 13:09:21,559 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:09:21,560 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:09:21,560 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:09:21,560 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:09:21,561 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:09:20" (3/4) ... [2024-10-11 13:09:21,562 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:09:21,563 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:09:21,564 INFO L158 Benchmark]: Toolchain (without parser) took 2265.53ms. Allocated memory is still 169.9MB. Free memory was 121.5MB in the beginning and 67.9MB in the end (delta: 53.7MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2024-10-11 13:09:21,564 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:09:21,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.43ms. Allocated memory is still 169.9MB. Free memory was 120.9MB in the beginning and 106.8MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:09:21,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.74ms. Allocated memory is still 169.9MB. Free memory was 106.8MB in the beginning and 104.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:09:21,565 INFO L158 Benchmark]: Boogie Preprocessor took 52.18ms. Allocated memory is still 169.9MB. Free memory was 104.7MB in the beginning and 102.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:09:21,566 INFO L158 Benchmark]: RCFGBuilder took 473.16ms. Allocated memory is still 169.9MB. Free memory was 102.6MB in the beginning and 128.7MB in the end (delta: -26.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 13:09:21,566 INFO L158 Benchmark]: TraceAbstraction took 1326.30ms. Allocated memory is still 169.9MB. Free memory was 127.6MB in the beginning and 67.9MB in the end (delta: 59.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-10-11 13:09:21,566 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 169.9MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:09:21,573 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.16ms. Allocated memory is still 100.7MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.43ms. Allocated memory is still 169.9MB. Free memory was 120.9MB in the beginning and 106.8MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.74ms. Allocated memory is still 169.9MB. Free memory was 106.8MB in the beginning and 104.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.18ms. Allocated memory is still 169.9MB. Free memory was 104.7MB in the beginning and 102.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.16ms. Allocated memory is still 169.9MB. Free memory was 102.6MB in the beginning and 128.7MB in the end (delta: -26.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1326.30ms. Allocated memory is still 169.9MB. Free memory was 127.6MB in the beginning and 67.9MB in the end (delta: 59.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 169.9MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -100; [L23] unsigned long int var_1_2 = 0; [L24] unsigned long int var_1_3 = 8; [L25] unsigned long int var_1_4 = 256; [L26] unsigned long int var_1_5 = 500; [L27] signed char var_1_7 = -64; [L28] signed char var_1_8 = -8; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 4.625; [L32] double var_1_13 = 15.5; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L76] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L77] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L78] var_1_3 = __VERIFIER_nondet_ulong() [L79] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L79] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L80] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L81] var_1_4 = __VERIFIER_nondet_ulong() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_4 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L83] RET assume_abort_if_not(var_1_4 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L84] var_1_5 = __VERIFIER_nondet_ulong() [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L86] CALL assume_abort_if_not(var_1_5 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L86] RET assume_abort_if_not(var_1_5 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L87] var_1_8 = __VERIFIER_nondet_char() [L88] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L90] var_1_9 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0] [L91] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0] [L92] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L93] var_1_10 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L96] var_1_13 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L110] RET updateVariables() [L111] CALL step() [L36] COND TRUE var_1_2 < (((((var_1_4 * var_1_5)) > (var_1_3)) ? ((var_1_4 * var_1_5)) : (var_1_3))) [L37] var_1_7 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=4294967296, var_1_3=-4294967295, var_1_4=1, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L49] unsigned long int stepLocal_1 = var_1_5; [L50] unsigned long int stepLocal_0 = var_1_2 * ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))); VAL [isInitial=1, stepLocal_0=4294967296, stepLocal_1=0, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=4294967296, var_1_3=-4294967295, var_1_4=1, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L51] COND FALSE !(stepLocal_0 < var_1_5) VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=4294967296, var_1_3=-4294967295, var_1_4=1, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L58] unsigned char stepLocal_3 = var_1_9; [L59] signed long int stepLocal_2 = var_1_1 + var_1_7; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=-100, stepLocal_3=0, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=4294967296, var_1_3=-4294967295, var_1_4=1, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L60] COND FALSE !(((var_1_7 + var_1_8) == var_1_4) && stepLocal_3) [L71] var_1_11 = var_1_13 VAL [isInitial=1, stepLocal_1=0, stepLocal_2=-100, var_1_10=0, var_1_11=2, var_1_13=2, var_1_1=-100, var_1_2=4294967296, var_1_3=-4294967295, var_1_4=1, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L111] RET step() [L112] CALL, EXPR property() [L102-L103] return ((((var_1_2 * ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < var_1_5) ? ((var_1_5 > var_1_2) ? (var_1_1 == ((signed short int) var_1_7)) : (var_1_1 == ((signed short int) var_1_7))) : 1) && ((var_1_2 < (((((var_1_4 * var_1_5)) > (var_1_3)) ? ((var_1_4 * var_1_5)) : (var_1_3)))) ? (var_1_7 == ((signed char) var_1_8)) : ((var_1_9 || var_1_10) ? (var_1_7 == ((signed char) var_1_8)) : ((var_1_3 < var_1_4) ? (var_1_7 == ((signed char) var_1_8)) : (var_1_7 == ((signed char) -4)))))) && ((((var_1_7 + var_1_8) == var_1_4) && var_1_9) ? ((! var_1_10) ? (((var_1_1 + var_1_7) != var_1_8) ? (var_1_11 == ((double) var_1_13)) : (var_1_11 == ((double) var_1_13))) : (var_1_11 == ((double) var_1_13))) : (var_1_11 == ((double) var_1_13))) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_13=2, var_1_1=-100, var_1_2=4294967296, var_1_3=-4294967295, var_1_4=1, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_13=2, var_1_1=-100, var_1_2=4294967296, var_1_3=-4294967295, var_1_4=1, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 63 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 92 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 420/420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:09:21,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9946b8f2044511113ae8f74201f189348f6c8338b35f7642acfb4580613f868c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:09:23,950 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:09:24,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:09:24,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:09:24,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:09:24,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:09:24,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:09:24,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:09:24,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:09:24,093 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:09:24,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:09:24,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:09:24,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:09:24,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:09:24,096 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:09:24,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:09:24,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:09:24,098 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:09:24,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:09:24,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:09:24,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:09:24,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:09:24,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:09:24,101 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:09:24,101 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:09:24,101 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:09:24,102 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:09:24,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:09:24,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:09:24,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:09:24,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:09:24,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:09:24,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:09:24,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:09:24,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:09:24,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:09:24,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:09:24,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:09:24,105 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:09:24,105 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:09:24,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:09:24,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:09:24,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:09:24,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:09:24,107 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:09:24,107 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9946b8f2044511113ae8f74201f189348f6c8338b35f7642acfb4580613f868c [2024-10-11 13:09:24,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:09:24,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:09:24,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:09:24,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:09:24,476 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:09:24,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i [2024-10-11 13:09:26,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:09:26,256 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:09:26,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i [2024-10-11 13:09:26,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/77fac4acd/4699b83d79354d2d95cdca2b520c70ee/FLAG6b2ab55c5 [2024-10-11 13:09:26,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/77fac4acd/4699b83d79354d2d95cdca2b520c70ee [2024-10-11 13:09:26,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:09:26,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:09:26,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:09:26,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:09:26,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:09:26,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:09:26" (1/1) ... [2024-10-11 13:09:26,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f8db27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:26, skipping insertion in model container [2024-10-11 13:09:26,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:09:26" (1/1) ... [2024-10-11 13:09:26,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:09:26,530 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-69.i[913,926] [2024-10-11 13:09:26,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:09:26,640 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:09:26,656 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-69.i[913,926] [2024-10-11 13:09:26,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:09:26,722 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:09:26,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:26 WrapperNode [2024-10-11 13:09:26,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:09:26,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:09:26,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:09:26,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:09:26,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:26" (1/1) ... [2024-10-11 13:09:26,748 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:26" (1/1) ... [2024-10-11 13:09:26,779 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-10-11 13:09:26,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:09:26,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:09:26,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:09:26,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:09:26,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:26" (1/1) ... [2024-10-11 13:09:26,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:26" (1/1) ... [2024-10-11 13:09:26,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:26" (1/1) ... [2024-10-11 13:09:26,829 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 13:09:26,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:26" (1/1) ... [2024-10-11 13:09:26,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:26" (1/1) ... [2024-10-11 13:09:26,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:26" (1/1) ... [2024-10-11 13:09:26,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:26" (1/1) ... [2024-10-11 13:09:26,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:26" (1/1) ... [2024-10-11 13:09:26,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:26" (1/1) ... [2024-10-11 13:09:26,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:09:26,872 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:09:26,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:09:26,872 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:09:26,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:26" (1/1) ... [2024-10-11 13:09:26,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:09:26,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:09:26,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:09:26,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:09:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:09:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:09:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:09:26,963 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:09:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:09:26,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:09:27,041 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:09:27,043 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:09:27,376 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 13:09:27,376 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:09:27,445 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:09:27,446 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:09:27,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:09:27 BoogieIcfgContainer [2024-10-11 13:09:27,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:09:27,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:09:27,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:09:27,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:09:27,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:09:26" (1/3) ... [2024-10-11 13:09:27,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200eee04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:09:27, skipping insertion in model container [2024-10-11 13:09:27,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:09:26" (2/3) ... [2024-10-11 13:09:27,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200eee04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:09:27, skipping insertion in model container [2024-10-11 13:09:27,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:09:27" (3/3) ... [2024-10-11 13:09:27,465 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-69.i [2024-10-11 13:09:27,478 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:09:27,479 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:09:27,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:09:27,543 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;@26948e7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:09:27,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:09:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:09:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 13:09:27,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:09:27,560 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:09:27,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:09:27,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:09:27,567 INFO L85 PathProgramCache]: Analyzing trace with hash -718405474, now seen corresponding path program 1 times [2024-10-11 13:09:27,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:09:27,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796741691] [2024-10-11 13:09:27,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:09:27,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:09:27,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:09:27,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:09:27,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:09:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:27,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:09:27,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:09:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-11 13:09:27,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:09:27,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:09:27,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796741691] [2024-10-11 13:09:27,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796741691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:09:27,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:09:27,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:09:27,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207598179] [2024-10-11 13:09:27,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:09:27,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:09:27,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:09:27,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:09:27,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:09:27,856 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:09:27,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:09:27,931 INFO L93 Difference]: Finished difference Result 89 states and 155 transitions. [2024-10-11 13:09:27,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:09:27,940 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 93 [2024-10-11 13:09:27,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:09:27,950 INFO L225 Difference]: With dead ends: 89 [2024-10-11 13:09:27,950 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 13:09:27,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:09:27,960 INFO L432 NwaCegarLoop]: 63 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, 63 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:09:27,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:09:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 13:09:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 13:09:28,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:09:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2024-10-11 13:09:28,014 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 93 [2024-10-11 13:09:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:09:28,014 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2024-10-11 13:09:28,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 13:09:28,015 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2024-10-11 13:09:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 13:09:28,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:09:28,019 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:09:28,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:09:28,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:09:28,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:09:28,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:09:28,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1042311708, now seen corresponding path program 1 times [2024-10-11 13:09:28,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:09:28,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384827419] [2024-10-11 13:09:28,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:09:28,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:09:28,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:09:28,226 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:09:28,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:09:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:28,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 13:09:28,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:09:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 13:09:49,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:09:49,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:09:49,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384827419] [2024-10-11 13:09:49,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384827419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:09:49,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:09:49,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:09:49,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925763762] [2024-10-11 13:09:49,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:09:49,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:09:49,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:09:49,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:09:49,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:09:49,695 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:09:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:09:55,734 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2024-10-11 13:09:55,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:09:55,743 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 93 [2024-10-11 13:09:55,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:09:55,744 INFO L225 Difference]: With dead ends: 73 [2024-10-11 13:09:55,745 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 13:09:55,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:09:55,746 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 127 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:09:55,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 133 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 13:09:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 13:09:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 56. [2024-10-11 13:09:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:09:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2024-10-11 13:09:55,759 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 93 [2024-10-11 13:09:55,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:09:55,760 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2024-10-11 13:09:55,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:09:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2024-10-11 13:09:55,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 13:09:55,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:09:55,763 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:09:55,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 13:09:55,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:09:55,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:09:55,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:09:55,965 INFO L85 PathProgramCache]: Analyzing trace with hash -718867702, now seen corresponding path program 1 times [2024-10-11 13:09:55,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:09:55,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532449961] [2024-10-11 13:09:55,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:09:55,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:09:55,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:09:55,968 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:09:55,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 13:09:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:56,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:09:56,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:10:07,989 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 13:10:07,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:10:07,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:10:07,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532449961] [2024-10-11 13:10:07,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532449961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:10:07,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:10:07,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:10:07,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203931819] [2024-10-11 13:10:07,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:10:07,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:10:07,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:10:07,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:10:07,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:10:07,995 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:10:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:10:10,286 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2024-10-11 13:10:10,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:10:10,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-11 13:10:10,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:10:10,289 INFO L225 Difference]: With dead ends: 71 [2024-10-11 13:10:10,289 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 13:10:10,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:10:10,291 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 97 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:10:10,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 128 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 13:10:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 13:10:10,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2024-10-11 13:10:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:10:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2024-10-11 13:10:10,308 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 94 [2024-10-11 13:10:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:10:10,309 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2024-10-11 13:10:10,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:10:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2024-10-11 13:10:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 13:10:10,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:10:10,311 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:10:10,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 13:10:10,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:10:10,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:10:10,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:10:10,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1120856753, now seen corresponding path program 1 times [2024-10-11 13:10:10,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:10:10,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43146609] [2024-10-11 13:10:10,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:10:10,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:10:10,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:10:10,516 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:10:10,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 13:10:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:10,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:10:10,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:10:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 13:10:20,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:10:20,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:10:20,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43146609] [2024-10-11 13:10:20,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43146609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:10:20,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:10:20,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:10:20,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877926381] [2024-10-11 13:10:20,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:10:20,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:10:20,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:10:20,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:10:20,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:10:20,122 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:10:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:10:26,508 INFO L93 Difference]: Finished difference Result 84 states and 118 transitions. [2024-10-11 13:10:26,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 13:10:26,514 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-11 13:10:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:10:26,516 INFO L225 Difference]: With dead ends: 84 [2024-10-11 13:10:26,516 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 13:10:26,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:10:26,518 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 104 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:10:26,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 171 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 13:10:26,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 13:10:26,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 59. [2024-10-11 13:10:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:10:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-10-11 13:10:26,527 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 94 [2024-10-11 13:10:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:10:26,528 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-10-11 13:10:26,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:10:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-10-11 13:10:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 13:10:26,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:10:26,530 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:10:26,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 13:10:26,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:10:26,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:10:26,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:10:26,731 INFO L85 PathProgramCache]: Analyzing trace with hash 664514775, now seen corresponding path program 1 times [2024-10-11 13:10:26,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:10:26,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794836136] [2024-10-11 13:10:26,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:10:26,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:10:26,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:10:26,734 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:10:26,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 13:10:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:26,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:10:26,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:10:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 13:10:32,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:10:32,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:10:32,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794836136] [2024-10-11 13:10:32,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794836136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:10:32,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:10:32,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:10:32,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029057117] [2024-10-11 13:10:32,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:10:32,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:10:32,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:10:32,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:10:32,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:10:32,385 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:10:38,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:10:38,197 INFO L93 Difference]: Finished difference Result 159 states and 229 transitions. [2024-10-11 13:10:38,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:10:38,202 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2024-10-11 13:10:38,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:10:38,203 INFO L225 Difference]: With dead ends: 159 [2024-10-11 13:10:38,204 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 13:10:38,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:10:38,205 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 120 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:10:38,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 185 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 13:10:38,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 13:10:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 68. [2024-10-11 13:10:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:10:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2024-10-11 13:10:38,216 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 95 [2024-10-11 13:10:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:10:38,217 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2024-10-11 13:10:38,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:10:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2024-10-11 13:10:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 13:10:38,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:10:38,219 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:10:38,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 13:10:38,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:10:38,420 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:10:38,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:10:38,420 INFO L85 PathProgramCache]: Analyzing trace with hash -144831851, now seen corresponding path program 1 times [2024-10-11 13:10:38,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:10:38,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552352926] [2024-10-11 13:10:38,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:10:38,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:10:38,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:10:38,422 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:10:38,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 13:10:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:38,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:10:38,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:10:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 13:10:44,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:10:44,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:10:44,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552352926] [2024-10-11 13:10:44,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552352926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:10:44,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:10:44,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:10:44,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393362722] [2024-10-11 13:10:44,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:10:44,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:10:44,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:10:44,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:10:44,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:10:44,034 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:10:49,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:10:49,819 INFO L93 Difference]: Finished difference Result 109 states and 150 transitions. [2024-10-11 13:10:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:10:49,823 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2024-10-11 13:10:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:10:49,825 INFO L225 Difference]: With dead ends: 109 [2024-10-11 13:10:49,825 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 13:10:49,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:10:49,826 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 109 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:10:49,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 205 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 13:10:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 13:10:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 66. [2024-10-11 13:10:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 13:10:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2024-10-11 13:10:49,836 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 95 [2024-10-11 13:10:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:10:49,836 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2024-10-11 13:10:49,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 13:10:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2024-10-11 13:10:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 13:10:49,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:10:49,838 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:10:49,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 13:10:50,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:10:50,043 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:10:50,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:10:50,043 INFO L85 PathProgramCache]: Analyzing trace with hash 942386743, now seen corresponding path program 1 times [2024-10-11 13:10:50,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:10:50,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744381034] [2024-10-11 13:10:50,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:10:50,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:10:50,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:10:50,045 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:10:50,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 13:10:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:50,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 13:10:50,126 INFO L278 TraceCheckSpWp]: Computing forward predicates...