./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d73169866977dcaccdece02ee66e85657451dd2678c2f9b97d40486db7899feb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:44:30,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:44:30,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:44:30,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:44:30,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:44:30,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:44:30,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:44:30,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:44:30,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:44:30,209 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:44:30,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:44:30,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:44:30,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:44:30,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:44:30,214 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:44:30,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:44:30,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:44:30,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:44:30,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:44:30,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:44:30,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:44:30,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:44:30,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:44:30,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:44:30,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:44:30,220 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:44:30,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:44:30,220 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:44:30,220 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:44:30,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:44:30,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:44:30,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:44:30,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:44:30,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:44:30,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:44:30,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:44:30,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:44:30,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:44:30,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:44:30,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:44:30,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:44:30,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:44:30,224 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d73169866977dcaccdece02ee66e85657451dd2678c2f9b97d40486db7899feb [2024-11-10 06:44:30,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:44:30,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:44:30,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:44:30,514 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:44:30,514 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:44:30,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i [2024-11-10 06:44:32,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:44:32,376 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:44:32,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i [2024-11-10 06:44:32,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85829eb82/6318fbeb77c942018ceee8be6f03aca6/FLAGf0f5e2ca1 [2024-11-10 06:44:32,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85829eb82/6318fbeb77c942018ceee8be6f03aca6 [2024-11-10 06:44:32,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:44:32,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:44:32,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:44:32,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:44:32,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:44:32,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:44:32" (1/1) ... [2024-11-10 06:44:32,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42811719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:32, skipping insertion in model container [2024-11-10 06:44:32,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:44:32" (1/1) ... [2024-11-10 06:44:32,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:44:32,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i[916,929] [2024-11-10 06:44:32,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:44:32,678 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:44:32,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i[916,929] [2024-11-10 06:44:32,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:44:32,732 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:44:32,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:32 WrapperNode [2024-11-10 06:44:32,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:44:32,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:44:32,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:44:32,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:44:32,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:32" (1/1) ... [2024-11-10 06:44:32,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:32" (1/1) ... [2024-11-10 06:44:32,802 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-11-10 06:44:32,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:44:32,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:44:32,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:44:32,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:44:32,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:32" (1/1) ... [2024-11-10 06:44:32,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:32" (1/1) ... [2024-11-10 06:44:32,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:32" (1/1) ... [2024-11-10 06:44:32,876 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 06:44:32,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:32" (1/1) ... [2024-11-10 06:44:32,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:32" (1/1) ... [2024-11-10 06:44:32,908 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:32" (1/1) ... [2024-11-10 06:44:32,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:32" (1/1) ... [2024-11-10 06:44:32,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:32" (1/1) ... [2024-11-10 06:44:32,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:32" (1/1) ... [2024-11-10 06:44:32,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:44:32,920 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:44:32,920 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:44:32,920 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:44:32,921 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:32" (1/1) ... [2024-11-10 06:44:32,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:44:32,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:44:32,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:44:32,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:44:33,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:44:33,023 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:44:33,025 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:44:33,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:44:33,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:44:33,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:44:33,126 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:44:33,129 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:44:33,481 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 06:44:33,482 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:44:33,499 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:44:33,499 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:44:33,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:44:33 BoogieIcfgContainer [2024-11-10 06:44:33,500 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:44:33,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:44:33,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:44:33,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:44:33,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:44:32" (1/3) ... [2024-11-10 06:44:33,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c9dfcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:44:33, skipping insertion in model container [2024-11-10 06:44:33,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:32" (2/3) ... [2024-11-10 06:44:33,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c9dfcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:44:33, skipping insertion in model container [2024-11-10 06:44:33,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:44:33" (3/3) ... [2024-11-10 06:44:33,516 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-6.i [2024-11-10 06:44:33,534 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:44:33,535 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:44:33,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:44:33,609 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;@408f308f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:44:33,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:44:33,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 06:44:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 06:44:33,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:33,633 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:44:33,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:33,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:33,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2059201854, now seen corresponding path program 1 times [2024-11-10 06:44:33,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:33,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085379602] [2024-11-10 06:44:33,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:33,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:33,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:33,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:44:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:44:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:44:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:44:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:44:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:44:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:44:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:44:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:44:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:44:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:44:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:44:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:44:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:34,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:34,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085379602] [2024-11-10 06:44:34,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085379602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:34,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:34,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:44:34,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295245438] [2024-11-10 06:44:34,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:34,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:44:34,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:34,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:44:34,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:44:34,197 INFO L87 Difference]: Start difference. First operand has 59 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 06:44:34,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:34,235 INFO L93 Difference]: Finished difference Result 110 states and 184 transitions. [2024-11-10 06:44:34,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:44:34,240 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 122 [2024-11-10 06:44:34,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:34,249 INFO L225 Difference]: With dead ends: 110 [2024-11-10 06:44:34,250 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 06:44:34,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:44:34,261 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:34,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:44:34,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 06:44:34,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-10 06:44:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 06:44:34,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-11-10 06:44:34,324 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 122 [2024-11-10 06:44:34,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:34,325 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-11-10 06:44:34,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 06:44:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-11-10 06:44:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 06:44:34,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:34,331 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:44:34,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:44:34,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:34,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:34,333 INFO L85 PathProgramCache]: Analyzing trace with hash -372644935, now seen corresponding path program 1 times [2024-11-10 06:44:34,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:34,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398575776] [2024-11-10 06:44:34,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:34,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:44:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:44:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:44:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:34,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:44:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:44:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:44:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:44:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:44:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:44:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:44:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:44:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:44:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:44:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:35,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:35,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398575776] [2024-11-10 06:44:35,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398575776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:35,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:35,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:44:35,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25045734] [2024-11-10 06:44:35,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:35,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:44:35,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:35,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:44:35,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:44:35,137 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:35,293 INFO L93 Difference]: Finished difference Result 105 states and 153 transitions. [2024-11-10 06:44:35,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:44:35,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2024-11-10 06:44:35,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:35,300 INFO L225 Difference]: With dead ends: 105 [2024-11-10 06:44:35,300 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 06:44:35,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:44:35,304 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:35,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 74 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:44:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 06:44:35,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-10 06:44:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 06:44:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2024-11-10 06:44:35,319 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 122 [2024-11-10 06:44:35,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:35,321 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2024-11-10 06:44:35,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:35,322 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2024-11-10 06:44:35,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 06:44:35,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:35,328 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:44:35,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:44:35,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:35,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:35,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1370165400, now seen corresponding path program 1 times [2024-11-10 06:44:35,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:35,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391103327] [2024-11-10 06:44:35,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:35,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:44:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:44:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:44:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:44:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:44:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:44:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:44:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:44:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:44:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:44:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:44:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:44:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:44:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:35,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:35,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391103327] [2024-11-10 06:44:35,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391103327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:35,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:35,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:44:35,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620309220] [2024-11-10 06:44:35,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:35,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:44:35,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:35,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:44:35,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:44:35,761 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:35,845 INFO L93 Difference]: Finished difference Result 142 states and 201 transitions. [2024-11-10 06:44:35,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:44:35,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2024-11-10 06:44:35,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:35,852 INFO L225 Difference]: With dead ends: 142 [2024-11-10 06:44:35,852 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 06:44:35,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:44:35,856 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 48 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:35,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 178 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:44:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 06:44:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-10 06:44:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 55 states have internal predecessors, (63), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 06:44:35,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-11-10 06:44:35,892 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 122 [2024-11-10 06:44:35,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:35,892 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-11-10 06:44:35,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-11-10 06:44:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 06:44:35,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:35,898 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:44:35,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:44:35,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:35,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:35,901 INFO L85 PathProgramCache]: Analyzing trace with hash -437289063, now seen corresponding path program 1 times [2024-11-10 06:44:35,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:35,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302327146] [2024-11-10 06:44:35,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:35,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:39,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:39,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:39,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:44:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:39,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:39,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:44:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:39,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:39,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:44:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:39,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:39,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:39,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:44:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:39,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:44:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:39,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:44:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:39,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:44:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:39,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:44:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:39,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:44:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:44:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:44:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:44:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:44:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:40,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:40,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302327146] [2024-11-10 06:44:40,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302327146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:40,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:40,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 06:44:40,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153898694] [2024-11-10 06:44:40,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:40,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 06:44:40,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:40,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 06:44:40,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:44:40,025 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:42,794 INFO L93 Difference]: Finished difference Result 185 states and 256 transitions. [2024-11-10 06:44:42,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 06:44:42,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2024-11-10 06:44:42,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:42,803 INFO L225 Difference]: With dead ends: 185 [2024-11-10 06:44:42,805 INFO L226 Difference]: Without dead ends: 182 [2024-11-10 06:44:42,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-10 06:44:42,807 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 83 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:42,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 359 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 06:44:42,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-10 06:44:42,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 171. [2024-11-10 06:44:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 06:44:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 244 transitions. [2024-11-10 06:44:42,857 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 244 transitions. Word has length 122 [2024-11-10 06:44:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:42,859 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 244 transitions. [2024-11-10 06:44:42,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 244 transitions. [2024-11-10 06:44:42,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 06:44:42,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:42,861 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:44:42,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:44:42,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:42,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:42,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1528025972, now seen corresponding path program 1 times [2024-11-10 06:44:42,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:42,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829911945] [2024-11-10 06:44:42,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:42,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:44:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:44:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:44:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:44:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:44:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:44:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:44:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:44:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:44:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:44:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:44:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:44:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:44:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:43,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:43,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829911945] [2024-11-10 06:44:43,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829911945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:43,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:43,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:44:43,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019429882] [2024-11-10 06:44:43,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:43,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:44:43,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:43,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:44:43,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:44:43,569 INFO L87 Difference]: Start difference. First operand 171 states and 244 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:43,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:43,836 INFO L93 Difference]: Finished difference Result 407 states and 579 transitions. [2024-11-10 06:44:43,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:44:43,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 123 [2024-11-10 06:44:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:43,841 INFO L225 Difference]: With dead ends: 407 [2024-11-10 06:44:43,841 INFO L226 Difference]: Without dead ends: 239 [2024-11-10 06:44:43,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:44:43,844 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 45 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:43,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 224 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:44:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-10 06:44:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 220. [2024-11-10 06:44:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 135 states have (on average 1.1703703703703703) internal successors, (158), 137 states have internal predecessors, (158), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-10 06:44:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 316 transitions. [2024-11-10 06:44:43,905 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 316 transitions. Word has length 123 [2024-11-10 06:44:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:43,908 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 316 transitions. [2024-11-10 06:44:43,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:43,908 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 316 transitions. [2024-11-10 06:44:43,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 06:44:43,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:43,911 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:44:43,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 06:44:43,911 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:43,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1499396821, now seen corresponding path program 1 times [2024-11-10 06:44:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:43,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765398744] [2024-11-10 06:44:43,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:44:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:44:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:44:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:44:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:44:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:44:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:44:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:44:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:44:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:44:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:44:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:44:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:44:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:47,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:47,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765398744] [2024-11-10 06:44:47,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765398744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:47,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:47,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 06:44:47,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170610708] [2024-11-10 06:44:47,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:47,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 06:44:47,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:47,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 06:44:47,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:44:47,765 INFO L87 Difference]: Start difference. First operand 220 states and 316 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:50,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:50,368 INFO L93 Difference]: Finished difference Result 235 states and 329 transitions. [2024-11-10 06:44:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 06:44:50,369 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 123 [2024-11-10 06:44:50,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:50,373 INFO L225 Difference]: With dead ends: 235 [2024-11-10 06:44:50,373 INFO L226 Difference]: Without dead ends: 232 [2024-11-10 06:44:50,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-10 06:44:50,377 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 88 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:50,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 395 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 06:44:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-10 06:44:50,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 220. [2024-11-10 06:44:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 135 states have (on average 1.1703703703703703) internal successors, (158), 137 states have internal predecessors, (158), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-10 06:44:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 316 transitions. [2024-11-10 06:44:50,431 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 316 transitions. Word has length 123 [2024-11-10 06:44:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:50,432 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 316 transitions. [2024-11-10 06:44:50,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:50,433 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 316 transitions. [2024-11-10 06:44:50,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 06:44:50,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:50,434 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:44:50,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 06:44:50,435 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:50,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:50,435 INFO L85 PathProgramCache]: Analyzing trace with hash 17570186, now seen corresponding path program 1 times [2024-11-10 06:44:50,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:50,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873217346] [2024-11-10 06:44:50,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:50,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:44:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:44:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:44:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:44:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:44:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:44:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:44:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:44:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:44:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:44:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:44:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:44:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:44:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:52,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:52,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873217346] [2024-11-10 06:44:52,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873217346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:52,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:52,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 06:44:52,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006848659] [2024-11-10 06:44:52,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:52,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 06:44:52,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:52,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 06:44:52,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:44:52,324 INFO L87 Difference]: Start difference. First operand 220 states and 316 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:52,919 INFO L93 Difference]: Finished difference Result 275 states and 381 transitions. [2024-11-10 06:44:52,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 06:44:52,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 123 [2024-11-10 06:44:52,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:52,924 INFO L225 Difference]: With dead ends: 275 [2024-11-10 06:44:52,925 INFO L226 Difference]: Without dead ends: 272 [2024-11-10 06:44:52,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-10 06:44:52,926 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 75 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:52,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 381 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:44:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-10 06:44:52,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2024-11-10 06:44:52,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 144 states have (on average 1.1875) internal successors, (171), 146 states have internal predecessors, (171), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-10 06:44:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 329 transitions. [2024-11-10 06:44:52,976 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 329 transitions. Word has length 123 [2024-11-10 06:44:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:52,977 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 329 transitions. [2024-11-10 06:44:52,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 329 transitions. [2024-11-10 06:44:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 06:44:52,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:52,979 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:44:52,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 06:44:52,980 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:52,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:52,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1789884277, now seen corresponding path program 1 times [2024-11-10 06:44:52,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:52,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231038642] [2024-11-10 06:44:52,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:52,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:44:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 06:44:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:44:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 06:44:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:44:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 06:44:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:44:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:44:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:44:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:44:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:44:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:44:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:44:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:44:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:44:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:44:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:44:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:44:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:44:55,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:55,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231038642] [2024-11-10 06:44:55,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231038642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:55,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:55,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 06:44:55,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542236125] [2024-11-10 06:44:55,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:55,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 06:44:55,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:55,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 06:44:55,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-10 06:44:55,886 INFO L87 Difference]: Start difference. First operand 229 states and 329 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:59,158 INFO L93 Difference]: Finished difference Result 261 states and 362 transitions. [2024-11-10 06:44:59,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 06:44:59,159 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 123 [2024-11-10 06:44:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:59,162 INFO L225 Difference]: With dead ends: 261 [2024-11-10 06:44:59,162 INFO L226 Difference]: Without dead ends: 258 [2024-11-10 06:44:59,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-10 06:44:59,164 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 84 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:59,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 387 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 06:44:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-10 06:44:59,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 238. [2024-11-10 06:44:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 153 states have (on average 1.1895424836601307) internal successors, (182), 155 states have internal predecessors, (182), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-10 06:44:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 340 transitions. [2024-11-10 06:44:59,199 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 340 transitions. Word has length 123 [2024-11-10 06:44:59,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:59,199 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 340 transitions. [2024-11-10 06:44:59,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:44:59,199 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 340 transitions. [2024-11-10 06:44:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 06:44:59,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:59,201 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:44:59,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 06:44:59,201 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:59,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:59,201 INFO L85 PathProgramCache]: Analyzing trace with hash -178943319, now seen corresponding path program 1 times [2024-11-10 06:44:59,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:59,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731689414] [2024-11-10 06:44:59,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:59,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:44:59,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925383455] [2024-11-10 06:44:59,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:59,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:44:59,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:44:59,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:44:59,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 06:44:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:44:59,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:44:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:44:59,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:44:59,774 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:44:59,775 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:44:59,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 06:44:59,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:44:59,985 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:45:00,077 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:45:00,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:45:00 BoogieIcfgContainer [2024-11-10 06:45:00,081 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:45:00,081 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:45:00,081 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:45:00,082 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:45:00,082 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:44:33" (3/4) ... [2024-11-10 06:45:00,085 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:45:00,086 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:45:00,086 INFO L158 Benchmark]: Toolchain (without parser) took 27680.26ms. Allocated memory was 192.9MB in the beginning and 408.9MB in the end (delta: 216.0MB). Free memory was 125.4MB in the beginning and 144.2MB in the end (delta: -18.8MB). Peak memory consumption was 199.1MB. Max. memory is 16.1GB. [2024-11-10 06:45:00,086 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory is still 69.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:45:00,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.29ms. Allocated memory is still 192.9MB. Free memory was 125.2MB in the beginning and 110.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 06:45:00,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.32ms. Allocated memory is still 192.9MB. Free memory was 110.4MB in the beginning and 107.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:45:00,087 INFO L158 Benchmark]: Boogie Preprocessor took 116.01ms. Allocated memory is still 192.9MB. Free memory was 107.6MB in the beginning and 163.0MB in the end (delta: -55.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-11-10 06:45:00,087 INFO L158 Benchmark]: IcfgBuilder took 579.87ms. Allocated memory is still 192.9MB. Free memory was 163.0MB in the beginning and 144.1MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 06:45:00,087 INFO L158 Benchmark]: TraceAbstraction took 26575.12ms. Allocated memory was 192.9MB in the beginning and 408.9MB in the end (delta: 216.0MB). Free memory was 143.6MB in the beginning and 144.2MB in the end (delta: -664.6kB). Peak memory consumption was 218.5MB. Max. memory is 16.1GB. [2024-11-10 06:45:00,088 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 408.9MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:45:00,089 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.19ms. Allocated memory is still 104.9MB. Free memory is still 69.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.29ms. Allocated memory is still 192.9MB. Free memory was 125.2MB in the beginning and 110.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.32ms. Allocated memory is still 192.9MB. Free memory was 110.4MB in the beginning and 107.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.01ms. Allocated memory is still 192.9MB. Free memory was 107.6MB in the beginning and 163.0MB in the end (delta: -55.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * IcfgBuilder took 579.87ms. Allocated memory is still 192.9MB. Free memory was 163.0MB in the beginning and 144.1MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26575.12ms. Allocated memory was 192.9MB in the beginning and 408.9MB in the end (delta: 216.0MB). Free memory was 143.6MB in the beginning and 144.2MB in the end (delta: -664.6kB). Peak memory consumption was 218.5MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 408.9MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 0; [L23] unsigned short int var_1_4 = 32; [L24] unsigned short int var_1_6 = 10; [L25] signed long int var_1_7 = 4; [L26] signed long int var_1_8 = 2; [L27] double var_1_9 = 0.0; [L28] double var_1_10 = 64.2; [L29] double var_1_11 = 0.0; [L30] double var_1_12 = 0.25; [L31] unsigned short int var_1_13 = 36833; [L32] unsigned char var_1_14 = 0; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] signed long int var_1_18 = -32; [L36] unsigned long int var_1_20 = 50; [L37] unsigned long int var_1_21 = 2655070710; [L38] unsigned char last_1_var_1_14 = 0; [L39] signed long int last_1_var_1_18 = -32; [L40] unsigned long int last_1_var_1_20 = 50; VAL [isInitial=0, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=32, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L101] last_1_var_1_14 = var_1_14 [L102] last_1_var_1_18 = var_1_18 [L103] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=32, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L69] var_1_4 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L70] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L71] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L72] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=2, var_1_9=0] [L74] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=2, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_7 <= 17) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=2, var_1_9=0] [L75] RET assume_abort_if_not(var_1_7 <= 17) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=2, var_1_9=0] [L76] var_1_8 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0, var_1_9=0] [L77] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_8 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0, var_1_9=0] [L78] RET assume_abort_if_not(var_1_8 <= 16) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0, var_1_9=0] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= 4611686.018427387900e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L80] RET assume_abort_if_not((var_1_9 >= 4611686.018427387900e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427387900e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L82] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427387900e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L84] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L85] var_1_12 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L86] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L87] var_1_13 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_13 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L88] RET assume_abort_if_not(var_1_13 >= 32767) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L89] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L89] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L90] var_1_16 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L91] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L92] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L92] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L93] var_1_17 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L94] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L95] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L95] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L96] var_1_21 = __VERIFIER_nondet_ulong() [L97] CALL assume_abort_if_not(var_1_21 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=4294967294, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=4294967294, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L97] RET assume_abort_if_not(var_1_21 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=4294967294, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L98] CALL assume_abort_if_not(var_1_21 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=4294967294, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=4294967294, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L98] RET assume_abort_if_not(var_1_21 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=4294967294, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L114] RET updateVariables() [L115] CALL step() [L44] COND TRUE (var_1_4 - last_1_var_1_20) == last_1_var_1_18 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=4294967294, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L45] COND FALSE !(((var_1_9 - var_1_10) - var_1_11) > var_1_12) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=4294967294, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L51] COND TRUE var_1_13 > var_1_6 [L52] var_1_18 = (((((var_1_6) < (var_1_13)) ? (var_1_6) : (var_1_13))) - var_1_6) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=4294967294, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L54] COND FALSE !(\read(last_1_var_1_14)) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=4294967294, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L57] var_1_20 = ((((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) < ((var_1_21 - var_1_7))) ? (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) : ((var_1_21 - var_1_7)))) [L58] unsigned long int stepLocal_1 = var_1_20; [L59] unsigned long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, stepLocal_0=50, stepLocal_1=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=4294967294, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L60] COND FALSE !((((((var_1_18) > (var_1_18)) ? (var_1_18) : (var_1_18))) / var_1_4) > stepLocal_1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, stepLocal_0=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=4294967294, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return ((((((((((var_1_18) > (var_1_18)) ? (var_1_18) : (var_1_18))) / var_1_4) > var_1_20) ? ((var_1_20 == var_1_18) ? (var_1_1 == ((unsigned long int) 1000000000u)) : (var_1_1 == ((unsigned long int) 128u))) : 1) && (((var_1_4 - last_1_var_1_20) == last_1_var_1_18) ? ((((var_1_9 - var_1_10) - var_1_11) > var_1_12) ? (var_1_6 == ((unsigned short int) (var_1_13 - var_1_8))) : 1) : (var_1_6 == ((unsigned short int) var_1_13)))) && (last_1_var_1_14 ? (var_1_14 == ((unsigned char) (var_1_16 && var_1_17))) : 1)) && ((var_1_13 > var_1_6) ? (var_1_18 == ((signed long int) (((((var_1_6) < (var_1_13)) ? (var_1_6) : (var_1_13))) - var_1_6))) : 1)) && (var_1_20 == ((unsigned long int) ((((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) < ((var_1_21 - var_1_7))) ? (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) : ((var_1_21 - var_1_7)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=4294967294, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=4294967294, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=98303, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=4294967294, var_1_4=18, var_1_6=10, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.4s, OverallIterations: 9, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 481 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 481 mSDsluCounter, 2076 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1437 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 639 mSDtfsCounter, 1012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=8, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 109 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 1226 NumberOfCodeBlocks, 1226 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 972 ConstructedInterpolants, 0 QuantifiedInterpolants, 5158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 5472/5472 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 06:45:00,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d73169866977dcaccdece02ee66e85657451dd2678c2f9b97d40486db7899feb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:45:02,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:45:02,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:45:02,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:45:02,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:45:02,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:45:02,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:45:02,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:45:02,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:45:02,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:45:02,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:45:02,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:45:02,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:45:02,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:45:02,548 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:45:02,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:45:02,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:45:02,549 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:45:02,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:45:02,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:45:02,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:45:02,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:45:02,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:45:02,554 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:45:02,554 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:45:02,554 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:45:02,555 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:45:02,555 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:45:02,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:45:02,555 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:45:02,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:45:02,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:45:02,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:45:02,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:45:02,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:45:02,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:45:02,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:45:02,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:45:02,559 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:45:02,559 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:45:02,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:45:02,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:45:02,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:45:02,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:45:02,561 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d73169866977dcaccdece02ee66e85657451dd2678c2f9b97d40486db7899feb [2024-11-10 06:45:02,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:45:02,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:45:02,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:45:02,907 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:45:02,908 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:45:02,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i [2024-11-10 06:45:04,584 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:45:04,784 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:45:04,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i [2024-11-10 06:45:04,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f72f270/ccd1b3c87c094e328383df375ec4236a/FLAGb7828a6fd [2024-11-10 06:45:04,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f72f270/ccd1b3c87c094e328383df375ec4236a [2024-11-10 06:45:04,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:45:04,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:45:04,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:45:04,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:45:04,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:45:04,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710c7a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04, skipping insertion in model container [2024-11-10 06:45:04,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:45:05,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i[916,929] [2024-11-10 06:45:05,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:45:05,176 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:45:05,208 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-6.i[916,929] [2024-11-10 06:45:05,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:45:05,285 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:45:05,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:05 WrapperNode [2024-11-10 06:45:05,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:45:05,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:45:05,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:45:05,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:45:05,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:05" (1/1) ... [2024-11-10 06:45:05,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:05" (1/1) ... [2024-11-10 06:45:05,349 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-10 06:45:05,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:45:05,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:45:05,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:45:05,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:45:05,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:05" (1/1) ... [2024-11-10 06:45:05,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:05" (1/1) ... [2024-11-10 06:45:05,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:05" (1/1) ... [2024-11-10 06:45:05,398 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 06:45:05,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:05" (1/1) ... [2024-11-10 06:45:05,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:05" (1/1) ... [2024-11-10 06:45:05,406 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:05" (1/1) ... [2024-11-10 06:45:05,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:05" (1/1) ... [2024-11-10 06:45:05,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:05" (1/1) ... [2024-11-10 06:45:05,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:05" (1/1) ... [2024-11-10 06:45:05,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:45:05,423 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:45:05,423 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:45:05,424 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:45:05,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:05" (1/1) ... [2024-11-10 06:45:05,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:45:05,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:45:05,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:45:05,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:45:05,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:45:05,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:45:05,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:45:05,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:45:05,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:45:05,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:45:05,612 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:45:05,617 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:45:09,211 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 06:45:09,211 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:45:09,225 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:45:09,226 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:45:09,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:45:09 BoogieIcfgContainer [2024-11-10 06:45:09,226 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:45:09,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:45:09,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:45:09,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:45:09,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:45:04" (1/3) ... [2024-11-10 06:45:09,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721d746b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:45:09, skipping insertion in model container [2024-11-10 06:45:09,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:05" (2/3) ... [2024-11-10 06:45:09,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721d746b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:45:09, skipping insertion in model container [2024-11-10 06:45:09,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:45:09" (3/3) ... [2024-11-10 06:45:09,236 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-6.i [2024-11-10 06:45:09,256 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:45:09,257 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:45:09,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:45:09,347 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;@33c84d0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:45:09,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:45:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 06:45:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 06:45:09,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:45:09,374 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:45:09,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:45:09,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:45:09,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2059201854, now seen corresponding path program 1 times [2024-11-10 06:45:09,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:45:09,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697454007] [2024-11-10 06:45:09,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:45:09,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:45:09,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:45:09,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:45:09,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 06:45:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:09,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:45:09,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:45:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-10 06:45:09,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:45:09,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:45:09,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697454007] [2024-11-10 06:45:09,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697454007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:45:09,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:45:09,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:45:09,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992815979] [2024-11-10 06:45:09,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:45:09,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:45:09,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:45:09,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:45:09,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:45:09,860 INFO L87 Difference]: Start difference. First operand has 59 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 06:45:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:45:09,896 INFO L93 Difference]: Finished difference Result 110 states and 184 transitions. [2024-11-10 06:45:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:45:09,898 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 122 [2024-11-10 06:45:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:45:09,907 INFO L225 Difference]: With dead ends: 110 [2024-11-10 06:45:09,908 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 06:45:09,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:45:09,915 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:45:09,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:45:09,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 06:45:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-10 06:45:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 06:45:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-11-10 06:45:09,959 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 122 [2024-11-10 06:45:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:45:09,959 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-11-10 06:45:09,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 06:45:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-11-10 06:45:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 06:45:09,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:45:09,964 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:45:09,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 06:45:10,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:45:10,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:45:10,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:45:10,166 INFO L85 PathProgramCache]: Analyzing trace with hash -372644935, now seen corresponding path program 1 times [2024-11-10 06:45:10,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:45:10,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579512557] [2024-11-10 06:45:10,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:45:10,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:45:10,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:45:10,173 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:45:10,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 06:45:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:10,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 06:45:10,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:45:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:45:10,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:45:10,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:45:10,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579512557] [2024-11-10 06:45:10,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579512557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:45:10,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:45:10,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:45:10,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948367555] [2024-11-10 06:45:10,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:45:10,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:45:10,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:45:10,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:45:10,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:45:10,606 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:45:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:45:11,705 INFO L93 Difference]: Finished difference Result 142 states and 204 transitions. [2024-11-10 06:45:11,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:45:11,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2024-11-10 06:45:11,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:45:11,710 INFO L225 Difference]: With dead ends: 142 [2024-11-10 06:45:11,710 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 06:45:11,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:45:11,715 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:45:11,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 180 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 06:45:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 06:45:11,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-10 06:45:11,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 55 states have internal predecessors, (65), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 06:45:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2024-11-10 06:45:11,744 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 122 [2024-11-10 06:45:11,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:45:11,745 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2024-11-10 06:45:11,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:45:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2024-11-10 06:45:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 06:45:11,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:45:11,748 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:45:11,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 06:45:11,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:45:11,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:45:11,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:45:11,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2114867898, now seen corresponding path program 1 times [2024-11-10 06:45:11,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:45:11,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447559631] [2024-11-10 06:45:11,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:45:11,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:45:11,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:45:11,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:45:11,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 06:45:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:12,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 06:45:12,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:45:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 06:45:12,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:45:12,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:45:12,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447559631] [2024-11-10 06:45:12,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447559631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:45:12,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:45:12,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:45:12,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734841706] [2024-11-10 06:45:12,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:45:12,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:45:12,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:45:12,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:45:12,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:45:12,798 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:45:14,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:45:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:45:14,439 INFO L93 Difference]: Finished difference Result 171 states and 247 transitions. [2024-11-10 06:45:14,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:45:14,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2024-11-10 06:45:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:45:14,468 INFO L225 Difference]: With dead ends: 171 [2024-11-10 06:45:14,468 INFO L226 Difference]: Without dead ends: 87 [2024-11-10 06:45:14,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:45:14,470 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 06:45:14,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 74 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 06:45:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-10 06:45:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-10 06:45:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 55 states have internal predecessors, (63), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 06:45:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-11-10 06:45:14,492 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 122 [2024-11-10 06:45:14,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:45:14,493 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-11-10 06:45:14,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-10 06:45:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-11-10 06:45:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 06:45:14,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:45:14,497 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:45:14,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 06:45:14,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:45:14,698 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:45:14,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:45:14,703 INFO L85 PathProgramCache]: Analyzing trace with hash -437289063, now seen corresponding path program 1 times [2024-11-10 06:45:14,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:45:14,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970672319] [2024-11-10 06:45:14,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:45:14,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:45:14,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:45:14,707 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:45:14,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 06:45:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:14,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 06:45:15,003 INFO L278 TraceCheckSpWp]: Computing forward predicates...