./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.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_fillercode_fillercodestructure_filler-pe-ci_file-83.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 f4a7b1082e4333573d8474d420161db05f750e6258474388ff1e21304d367b67 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:59:58,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:59:58,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:59:58,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:59:58,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:59:58,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:59:58,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:59:58,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:59:58,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:59:58,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:59:58,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:59:58,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:59:58,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:59:58,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:59:58,681 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:59:58,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:59:58,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:59:58,682 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:59:58,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:59:58,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:59:58,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:59:58,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:59:58,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:59:58,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:59:58,687 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:59:58,687 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:59:58,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:59:58,688 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:59:58,688 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:59:58,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:59:58,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:59:58,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:59:58,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:59:58,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:59:58,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:59:58,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:59:58,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:59:58,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:59:58,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:59:58,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:59:58,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:59:58,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:59:58,695 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 -> f4a7b1082e4333573d8474d420161db05f750e6258474388ff1e21304d367b67 [2024-11-10 04:59:58,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:59:58,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:59:58,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:59:58,953 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:59:58,953 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:59:58,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i [2024-11-10 05:00:00,439 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:00:00,678 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:00:00,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i [2024-11-10 05:00:00,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63f4a5c3/259de093f9974d209a88e0c39f7149cb/FLAG8f2ae5364 [2024-11-10 05:00:00,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63f4a5c3/259de093f9974d209a88e0c39f7149cb [2024-11-10 05:00:00,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:00:00,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:00:00,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:00:00,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:00:00,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:00:00,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:00:00" (1/1) ... [2024-11-10 05:00:00,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62068acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:00, skipping insertion in model container [2024-11-10 05:00:00,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:00:00" (1/1) ... [2024-11-10 05:00:00,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:00:00,934 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_fillercode_fillercodestructure_filler-pe-ci_file-83.i[919,932] [2024-11-10 05:00:01,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:00:01,054 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:00:01,067 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_fillercode_fillercodestructure_filler-pe-ci_file-83.i[919,932] [2024-11-10 05:00:01,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:00:01,133 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:00:01,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:01 WrapperNode [2024-11-10 05:00:01,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:00:01,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:00:01,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:00:01,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:00:01,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:01" (1/1) ... [2024-11-10 05:00:01,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:01" (1/1) ... [2024-11-10 05:00:01,215 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2024-11-10 05:00:01,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:00:01,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:00:01,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:00:01,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:00:01,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:01" (1/1) ... [2024-11-10 05:00:01,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:01" (1/1) ... [2024-11-10 05:00:01,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:01" (1/1) ... [2024-11-10 05:00:01,270 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 05:00:01,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:01" (1/1) ... [2024-11-10 05:00:01,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:01" (1/1) ... [2024-11-10 05:00:01,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:01" (1/1) ... [2024-11-10 05:00:01,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:01" (1/1) ... [2024-11-10 05:00:01,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:01" (1/1) ... [2024-11-10 05:00:01,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:01" (1/1) ... [2024-11-10 05:00:01,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:00:01,318 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:00:01,318 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:00:01,318 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:00:01,322 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:01" (1/1) ... [2024-11-10 05:00:01,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:00:01,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:00:01,357 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 05:00:01,361 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 05:00:01,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:00:01,409 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:00:01,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:00:01,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:00:01,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:00:01,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:00:01,508 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:00:01,511 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:00:02,024 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L156: havoc property_#t~ite22#1;havoc property_#t~bitwise20#1;havoc property_#t~bitwise21#1;havoc property_#t~short23#1; [2024-11-10 05:00:02,062 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-10 05:00:02,065 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:00:02,095 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:00:02,095 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:00:02,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:00:02 BoogieIcfgContainer [2024-11-10 05:00:02,096 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:00:02,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:00:02,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:00:02,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:00:02,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:00:00" (1/3) ... [2024-11-10 05:00:02,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8a4850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:00:02, skipping insertion in model container [2024-11-10 05:00:02,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:01" (2/3) ... [2024-11-10 05:00:02,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8a4850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:00:02, skipping insertion in model container [2024-11-10 05:00:02,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:00:02" (3/3) ... [2024-11-10 05:00:02,104 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i [2024-11-10 05:00:02,118 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:00:02,119 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:00:02,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:00:02,194 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;@1103f57f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:00:02,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:00:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 82 states have (on average 1.524390243902439) internal successors, (125), 83 states have internal predecessors, (125), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 05:00:02,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 05:00:02,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:00:02,219 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:02,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:00:02,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:00:02,224 INFO L85 PathProgramCache]: Analyzing trace with hash -39728800, now seen corresponding path program 1 times [2024-11-10 05:00:02,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:00:02,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570844667] [2024-11-10 05:00:02,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:02,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:00:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:00:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:00:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:00:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:00:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:00:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:00:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:00:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:00:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:00:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:00:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:00:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:00:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:00:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:00:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:00:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:00:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:00:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:00:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:00:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:00:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:00:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 05:00:02,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:00:02,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570844667] [2024-11-10 05:00:02,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570844667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:00:02,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:00:02,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:00:02,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602153328] [2024-11-10 05:00:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:00:02,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:00:02,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:00:02,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:00:02,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:00:02,833 INFO L87 Difference]: Start difference. First operand has 106 states, 82 states have (on average 1.524390243902439) internal successors, (125), 83 states have internal predecessors, (125), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 05:00:02,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:00:02,881 INFO L93 Difference]: Finished difference Result 204 states and 348 transitions. [2024-11-10 05:00:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:00:02,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 148 [2024-11-10 05:00:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:00:02,894 INFO L225 Difference]: With dead ends: 204 [2024-11-10 05:00:02,894 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 05:00:02,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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 05:00:02,905 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:00:02,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:00:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 05:00:02,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-10 05:00:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.5) internal successors, (117), 78 states have internal predecessors, (117), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 05:00:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 159 transitions. [2024-11-10 05:00:02,965 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 159 transitions. Word has length 148 [2024-11-10 05:00:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:00:02,966 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 159 transitions. [2024-11-10 05:00:02,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 05:00:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 159 transitions. [2024-11-10 05:00:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 05:00:02,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:00:02,974 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:02,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:00:02,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:00:02,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:00:02,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1959031549, now seen corresponding path program 1 times [2024-11-10 05:00:02,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:00:02,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165737921] [2024-11-10 05:00:02,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:02,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:00:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:00:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:00:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:00:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:00:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:00:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:00:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:00:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:00:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:00:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:00:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:00:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:00:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:00:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:00:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:00:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:00:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:00:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:00:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:00:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:00:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:00:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-10 05:00:03,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:00:03,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165737921] [2024-11-10 05:00:03,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165737921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:00:03,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350295729] [2024-11-10 05:00:03,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:03,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:00:03,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:00:03,917 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 05:00:03,919 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 05:00:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:04,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 05:00:04,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:00:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-10 05:00:04,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:00:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-10 05:00:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350295729] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:00:04,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:00:04,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-10 05:00:04,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062179976] [2024-11-10 05:00:04,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:00:04,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 05:00:04,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:00:04,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 05:00:04,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-10 05:00:04,752 INFO L87 Difference]: Start difference. First operand 101 states and 159 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 3 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2024-11-10 05:00:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:00:05,282 INFO L93 Difference]: Finished difference Result 243 states and 372 transitions. [2024-11-10 05:00:05,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 05:00:05,285 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 3 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) Word has length 148 [2024-11-10 05:00:05,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:00:05,288 INFO L225 Difference]: With dead ends: 243 [2024-11-10 05:00:05,289 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 05:00:05,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2024-11-10 05:00:05,291 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 164 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 05:00:05,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 507 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 05:00:05,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 05:00:05,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2024-11-10 05:00:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 110 states have (on average 1.3818181818181818) internal successors, (152), 111 states have internal predecessors, (152), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 05:00:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 198 transitions. [2024-11-10 05:00:05,311 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 198 transitions. Word has length 148 [2024-11-10 05:00:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:00:05,312 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 198 transitions. [2024-11-10 05:00:05,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 3 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2024-11-10 05:00:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 198 transitions. [2024-11-10 05:00:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 05:00:05,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:00:05,315 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:05,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 05:00:05,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:00:05,520 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:00:05,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:00:05,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2088114268, now seen corresponding path program 1 times [2024-11-10 05:00:05,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:00:05,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461863827] [2024-11-10 05:00:05,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:05,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:00:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:00:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:00:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:00:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:00:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:00:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:00:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:00:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:00:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:00:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:00:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:00:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:00:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:00:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:00:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:00:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:00:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:00:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:00:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:00:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:00:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:00:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 42 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-10 05:00:05,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:00:05,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461863827] [2024-11-10 05:00:05,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461863827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:00:05,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973224606] [2024-11-10 05:00:05,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:05,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:00:05,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:00:05,961 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:00:05,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 05:00:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:06,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 05:00:06,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:00:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 368 proven. 42 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2024-11-10 05:00:06,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:00:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 42 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-10 05:00:06,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973224606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:00:06,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:00:06,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-10 05:00:06,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607441997] [2024-11-10 05:00:06,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:00:06,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 05:00:06,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:00:06,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 05:00:06,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-10 05:00:06,565 INFO L87 Difference]: Start difference. First operand 137 states and 198 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2024-11-10 05:00:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:00:06,845 INFO L93 Difference]: Finished difference Result 245 states and 355 transitions. [2024-11-10 05:00:06,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 05:00:06,846 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) Word has length 148 [2024-11-10 05:00:06,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:00:06,848 INFO L225 Difference]: With dead ends: 245 [2024-11-10 05:00:06,848 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 05:00:06,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-10 05:00:06,853 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 90 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:00:06,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 428 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:00:06,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 05:00:06,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-11-10 05:00:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 05:00:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-10 05:00:06,865 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 148 [2024-11-10 05:00:06,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:00:06,866 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-10 05:00:06,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2024-11-10 05:00:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-10 05:00:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 05:00:06,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:00:06,869 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:06,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 05:00:07,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-10 05:00:07,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:00:07,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:00:07,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1913450021, now seen corresponding path program 1 times [2024-11-10 05:00:07,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:00:07,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812877674] [2024-11-10 05:00:07,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:00:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:07,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:00:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:07,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:00:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:07,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:00:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:07,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:00:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:07,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:00:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:07,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:00:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:07,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:00:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:07,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:00:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:07,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:00:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:07,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:00:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:07,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:00:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:07,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:00:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:07,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:00:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:00:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:07,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:00:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:08,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:00:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:08,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:00:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:08,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:00:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:08,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:00:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:08,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:00:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:00:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:08,040 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 99 proven. 105 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2024-11-10 05:00:08,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:00:08,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812877674] [2024-11-10 05:00:08,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812877674] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:00:08,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51680237] [2024-11-10 05:00:08,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:08,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:00:08,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:00:08,043 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:00:08,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 05:00:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:08,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 05:00:08,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:00:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 522 proven. 177 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-10 05:00:09,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:00:10,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51680237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:00:10,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:00:10,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 22 [2024-11-10 05:00:10,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693558313] [2024-11-10 05:00:10,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:00:10,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 05:00:10,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:00:10,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 05:00:10,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2024-11-10 05:00:10,258 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 9 states have call successors, (35), 6 states have call predecessors, (35), 10 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) [2024-11-10 05:00:11,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:00:11,319 INFO L93 Difference]: Finished difference Result 239 states and 331 transitions. [2024-11-10 05:00:11,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 05:00:11,320 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 9 states have call successors, (35), 6 states have call predecessors, (35), 10 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) Word has length 148 [2024-11-10 05:00:11,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:00:11,322 INFO L225 Difference]: With dead ends: 239 [2024-11-10 05:00:11,322 INFO L226 Difference]: Without dead ends: 133 [2024-11-10 05:00:11,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=691, Invalid=1961, Unknown=0, NotChecked=0, Total=2652 [2024-11-10 05:00:11,329 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 314 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 05:00:11,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 385 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 05:00:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-10 05:00:11,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2024-11-10 05:00:11,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 96 states have internal predecessors, (125), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 05:00:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 167 transitions. [2024-11-10 05:00:11,359 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 167 transitions. Word has length 148 [2024-11-10 05:00:11,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:00:11,360 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 167 transitions. [2024-11-10 05:00:11,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 9 states have call successors, (35), 6 states have call predecessors, (35), 10 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) [2024-11-10 05:00:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2024-11-10 05:00:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-10 05:00:11,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:00:11,365 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:11,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 05:00:11,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:00:11,567 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:00:11,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:00:11,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1162099362, now seen corresponding path program 1 times [2024-11-10 05:00:11,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:00:11,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854242883] [2024-11-10 05:00:11,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:11,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:00:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:00:11,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1809554611] [2024-11-10 05:00:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:11,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:00:11,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:00:11,700 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:00:11,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 05:00:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:00:12,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 05:00:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:00:12,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 05:00:12,284 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 05:00:12,285 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 05:00:12,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 05:00:12,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:00:12,493 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 05:00:12,628 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 05:00:12,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:00:12 BoogieIcfgContainer [2024-11-10 05:00:12,634 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 05:00:12,635 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 05:00:12,635 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 05:00:12,635 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 05:00:12,636 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:00:02" (3/4) ... [2024-11-10 05:00:12,639 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 05:00:12,640 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 05:00:12,642 INFO L158 Benchmark]: Toolchain (without parser) took 11935.49ms. Allocated memory was 161.5MB in the beginning and 302.0MB in the end (delta: 140.5MB). Free memory was 125.8MB in the beginning and 219.3MB in the end (delta: -93.6MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2024-11-10 05:00:12,642 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:00:12,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.52ms. Allocated memory is still 161.5MB. Free memory was 125.8MB in the beginning and 107.9MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 05:00:12,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.88ms. Allocated memory is still 161.5MB. Free memory was 107.9MB in the beginning and 100.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 05:00:12,643 INFO L158 Benchmark]: Boogie Preprocessor took 100.02ms. Allocated memory is still 161.5MB. Free memory was 100.6MB in the beginning and 92.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 05:00:12,644 INFO L158 Benchmark]: IcfgBuilder took 778.15ms. Allocated memory is still 161.5MB. Free memory was 92.2MB in the beginning and 52.4MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-10 05:00:12,644 INFO L158 Benchmark]: TraceAbstraction took 10536.29ms. Allocated memory was 161.5MB in the beginning and 302.0MB in the end (delta: 140.5MB). Free memory was 51.3MB in the beginning and 220.4MB in the end (delta: -169.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:00:12,644 INFO L158 Benchmark]: Witness Printer took 5.42ms. Allocated memory is still 302.0MB. Free memory was 220.4MB in the beginning and 219.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 05:00:12,646 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.17ms. Allocated memory is still 117.4MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.52ms. Allocated memory is still 161.5MB. Free memory was 125.8MB in the beginning and 107.9MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.88ms. Allocated memory is still 161.5MB. Free memory was 107.9MB in the beginning and 100.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.02ms. Allocated memory is still 161.5MB. Free memory was 100.6MB in the beginning and 92.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 778.15ms. Allocated memory is still 161.5MB. Free memory was 92.2MB in the beginning and 52.4MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10536.29ms. Allocated memory was 161.5MB in the beginning and 302.0MB in the end (delta: 140.5MB). Free memory was 51.3MB in the beginning and 220.4MB in the end (delta: -169.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.42ms. Allocated memory is still 302.0MB. Free memory was 220.4MB in the beginning and 219.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryArithmeticFLOAToperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -25; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1230640054; [L25] signed long int var_1_6 = 1508873667; [L26] unsigned char var_1_7 = 64; [L27] unsigned char var_1_8 = 200; [L28] unsigned char var_1_9 = 16; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_11 = 8; [L31] float var_1_12 = 15.4; [L32] float var_1_16 = 10000000000000.375; [L33] float var_1_17 = 16.4; [L34] float var_1_18 = 8.5; [L35] float var_1_19 = 64.75; [L36] unsigned char var_1_20 = 16; [L37] signed char var_1_22 = 0; [L38] unsigned char var_1_23 = 16; [L39] unsigned char var_1_24 = 128; [L40] signed short int var_1_30 = -256; [L41] signed short int var_1_31 = 2; [L42] signed short int var_1_34 = -2; [L43] signed short int var_1_36 = -50; [L44] unsigned char var_1_37 = 4; [L45] unsigned char var_1_38 = 64; [L46] float var_1_40 = 0.8; [L47] signed short int var_1_44 = 1; [L48] signed long int var_1_45 = 4; [L49] float var_1_46 = 1000000000000.375; VAL [isInitial=0, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=0, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L160] isInitial = 1 [L161] FCALL initially() [L162] COND TRUE 1 [L163] FCALL updateLastVariables() [L164] CALL updateVariables() [L120] var_1_2 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L121] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L122] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L122] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1230640054, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L123] var_1_3 = __VERIFIER_nondet_long() [L124] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L124] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L125] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L125] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L126] var_1_6 = __VERIFIER_nondet_long() [L127] CALL assume_abort_if_not(var_1_6 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L127] RET assume_abort_if_not(var_1_6 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L128] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L128] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L129] var_1_8 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_8 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=16] [L130] RET assume_abort_if_not(var_1_8 >= 190) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=16] [L131] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=16] [L131] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=16] [L132] var_1_9 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766] [L133] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766] [L134] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L134] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L135] var_1_10 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L136] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L137] CALL assume_abort_if_not(var_1_10 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L137] RET assume_abort_if_not(var_1_10 <= 32) VAL [isInitial=1, var_1_10=-512, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L138] var_1_11 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L139] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-512, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L140] CALL assume_abort_if_not(var_1_11 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L140] RET assume_abort_if_not(var_1_11 <= 31) VAL [isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L141] var_1_17 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L142] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L143] var_1_18 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L144] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L145] var_1_20 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_20 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L146] RET assume_abort_if_not(var_1_20 >= 1) VAL [isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L147] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L147] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L148] CALL assume_abort_if_not(var_1_20 != 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L148] RET assume_abort_if_not(var_1_20 != 127) VAL [isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=64, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L149] var_1_38 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_38 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L150] RET assume_abort_if_not(var_1_38 >= 63) VAL [isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L151] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L151] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=64, var_1_8=766, var_1_9=319] [L164] RET updateVariables() [L165] CALL step() [L53] var_1_7 = ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11))) [L54] var_1_16 = (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) VAL [isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=16, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L55] COND FALSE !((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) [L62] var_1_23 = var_1_20 VAL [isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=126, var_1_22=0, var_1_23=126, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L64] COND TRUE \read(var_1_2) [L65] var_1_1 = ((var_1_3 - var_1_7) - var_1_7) VAL [isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=0, var_1_23=126, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L69] signed long int stepLocal_1 = var_1_9 % (var_1_8 - var_1_20); VAL [isInitial=1, stepLocal_1=63, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=0, var_1_23=126, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L70] EXPR var_1_7 ^ var_1_10 VAL [isInitial=1, stepLocal_1=63, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=0, var_1_23=126, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L70] signed long int stepLocal_0 = var_1_7 ^ var_1_10; [L71] COND FALSE !(stepLocal_1 > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) VAL [isInitial=1, stepLocal_0=122, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=0, var_1_23=126, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L76] COND TRUE (var_1_11 % var_1_20) < var_1_1 [L77] var_1_22 = ((((10) > (var_1_10)) ? (10) : (var_1_10))) VAL [isInitial=1, stepLocal_0=122, var_1_10=-512, var_1_11=287, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=10, var_1_23=126, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L79] COND TRUE ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f)) [L80] var_1_12 = 31.5f VAL [isInitial=1, stepLocal_0=122, var_1_10=-512, var_1_11=287, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=10, var_1_23=126, var_1_24=128, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L82] COND TRUE (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) >= (var_1_23 % var_1_3)) || var_1_2 [L83] var_1_24 = ((((var_1_8 - 8) < 0 ) ? -(var_1_8 - 8) : (var_1_8 - 8))) VAL [isInitial=1, stepLocal_0=122, var_1_10=-512, var_1_11=287, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=10, var_1_23=126, var_1_24=246, var_1_2=1, var_1_30=-256, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L87] var_1_30 = var_1_8 VAL [isInitial=1, stepLocal_0=122, var_1_10=-512, var_1_11=287, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=10, var_1_23=126, var_1_24=246, var_1_2=1, var_1_30=254, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L88] COND FALSE !(((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) < var_1_18) VAL [isInitial=1, stepLocal_0=122, var_1_10=-512, var_1_11=287, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=10, var_1_23=126, var_1_24=246, var_1_2=1, var_1_30=254, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L93] COND FALSE !(1 >= var_1_20) VAL [isInitial=1, stepLocal_0=122, var_1_10=-512, var_1_11=287, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=10, var_1_23=126, var_1_24=246, var_1_2=1, var_1_30=254, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L98] EXPR var_1_7 & var_1_10 VAL [isInitial=1, stepLocal_0=122, var_1_10=-512, var_1_11=287, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=10, var_1_23=126, var_1_24=246, var_1_2=1, var_1_30=254, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=4, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L98] COND FALSE !(var_1_8 <= (var_1_7 & var_1_10)) [L101] COND TRUE var_1_3 >= ((((32) > (var_1_8)) ? (32) : (var_1_8))) [L102] var_1_37 = (var_1_8 - (var_1_38 - var_1_11)) VAL [isInitial=1, stepLocal_0=122, var_1_10=-512, var_1_11=287, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=10, var_1_23=126, var_1_24=246, var_1_2=1, var_1_30=254, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=222, var_1_38=63, var_1_3=1073741822, var_1_40=4/5, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L106] COND TRUE \read(var_1_2) [L107] var_1_40 = ((((var_1_18) > ((var_1_17 + var_1_17))) ? (var_1_18) : ((var_1_17 + var_1_17)))) VAL [isInitial=1, stepLocal_0=122, var_1_10=-512, var_1_11=287, var_1_12=63/2, var_1_18=2, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=10, var_1_23=126, var_1_24=246, var_1_2=1, var_1_30=254, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=222, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L109] COND FALSE !(var_1_17 != var_1_16) VAL [isInitial=1, stepLocal_0=122, var_1_10=-512, var_1_11=287, var_1_12=63/2, var_1_18=2, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=10, var_1_23=126, var_1_24=246, var_1_2=1, var_1_30=254, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=222, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=4, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L114] COND TRUE \read(var_1_2) [L115] var_1_45 = (((((var_1_11 + var_1_38)) < (var_1_11)) ? ((var_1_11 + var_1_38)) : (var_1_11))) VAL [isInitial=1, stepLocal_0=122, var_1_10=-512, var_1_11=287, var_1_12=63/2, var_1_18=2, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=10, var_1_23=126, var_1_24=246, var_1_2=1, var_1_30=254, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=222, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=31, var_1_46=8000000000003/8, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L117] var_1_46 = var_1_17 VAL [isInitial=1, stepLocal_0=122, var_1_10=-512, var_1_11=287, var_1_12=63/2, var_1_17=3, var_1_18=2, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=10, var_1_23=126, var_1_24=246, var_1_2=1, var_1_30=254, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=222, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=31, var_1_46=3, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L165] RET step() [L166] CALL, EXPR property() [L156] EXPR ((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1) VAL [isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=63/2, var_1_17=3, var_1_18=2, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=10, var_1_23=126, var_1_24=246, var_1_2=1, var_1_30=254, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=222, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=31, var_1_46=3, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L156-L157] return ((((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1)) && (((var_1_11 % var_1_20) < var_1_1) ? (var_1_22 == ((signed char) ((((10) > (var_1_10)) ? (10) : (var_1_10))))) : 1)) && (((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) ? ((var_1_10 > var_1_7) ? (var_1_23 == ((unsigned char) ((((var_1_20) < ((var_1_8 - var_1_9))) ? (var_1_20) : ((var_1_8 - var_1_9)))))) : (var_1_23 == ((unsigned char) (((((var_1_20) > (64)) ? (var_1_20) : (64))) + var_1_11)))) : (var_1_23 == ((unsigned char) var_1_20))) ; [L166] RET, EXPR property() [L166] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=63/2, var_1_17=3, var_1_18=2, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=10, var_1_23=126, var_1_24=246, var_1_2=1, var_1_30=254, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=222, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=31, var_1_46=3, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] [L19] reach_error() VAL [isInitial=1, var_1_10=-512, var_1_11=287, var_1_12=63/2, var_1_17=3, var_1_18=2, var_1_19=259/4, var_1_1=1073741578, var_1_20=126, var_1_22=10, var_1_23=126, var_1_24=246, var_1_2=1, var_1_30=254, var_1_31=2, var_1_34=-2, var_1_36=-50, var_1_37=222, var_1_38=63, var_1_3=1073741822, var_1_40=2, var_1_44=1, var_1_45=31, var_1_46=3, var_1_6=1073741822, var_1_7=122, var_1_8=766, var_1_9=319] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 5, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 579 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 568 mSDsluCounter, 1472 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1030 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1383 IncrementalHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 442 mSDtfsCounter, 1383 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1075 GetRequests, 996 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=2, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1334 NumberOfCodeBlocks, 1334 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1323 ConstructedInterpolants, 0 QuantifiedInterpolants, 4698 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1048 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 6990/7560 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 05:00:12,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.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 f4a7b1082e4333573d8474d420161db05f750e6258474388ff1e21304d367b67 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:00:15,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:00:15,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 05:00:15,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:00:15,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:00:15,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:00:15,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:00:15,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:00:15,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:00:15,199 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:00:15,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:00:15,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:00:15,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:00:15,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:00:15,204 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:00:15,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:00:15,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:00:15,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:00:15,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:00:15,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:00:15,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:00:15,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:00:15,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:00:15,206 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 05:00:15,207 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 05:00:15,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:00:15,217 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 05:00:15,217 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:00:15,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:00:15,218 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:00:15,218 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:00:15,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:00:15,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:00:15,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:00:15,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:00:15,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:00:15,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:00:15,220 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:00:15,220 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 05:00:15,220 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 05:00:15,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:00:15,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:00:15,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:00:15,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:00:15,223 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 -> f4a7b1082e4333573d8474d420161db05f750e6258474388ff1e21304d367b67 [2024-11-10 05:00:15,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:00:15,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:00:15,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:00:15,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:00:15,607 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:00:15,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i [2024-11-10 05:00:17,225 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:00:17,453 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:00:17,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i [2024-11-10 05:00:17,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77cbcfa4a/491262d036b34581afd24eceff2d6573/FLAG1e0ee43f2 [2024-11-10 05:00:17,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77cbcfa4a/491262d036b34581afd24eceff2d6573 [2024-11-10 05:00:17,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:00:17,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:00:17,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:00:17,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:00:17,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:00:17,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:00:17" (1/1) ... [2024-11-10 05:00:17,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ba94df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:17, skipping insertion in model container [2024-11-10 05:00:17,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:00:17" (1/1) ... [2024-11-10 05:00:17,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:00:17,746 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_fillercode_fillercodestructure_filler-pe-ci_file-83.i[919,932] [2024-11-10 05:00:17,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:00:17,854 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:00:17,866 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_fillercode_fillercodestructure_filler-pe-ci_file-83.i[919,932] [2024-11-10 05:00:17,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:00:17,937 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:00:17,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:17 WrapperNode [2024-11-10 05:00:17,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:00:17,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:00:17,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:00:17,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:00:17,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:17" (1/1) ... [2024-11-10 05:00:17,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:17" (1/1) ... [2024-11-10 05:00:18,003 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-11-10 05:00:18,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:00:18,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:00:18,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:00:18,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:00:18,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:17" (1/1) ... [2024-11-10 05:00:18,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:17" (1/1) ... [2024-11-10 05:00:18,023 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:17" (1/1) ... [2024-11-10 05:00:18,042 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 05:00:18,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:17" (1/1) ... [2024-11-10 05:00:18,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:17" (1/1) ... [2024-11-10 05:00:18,051 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:17" (1/1) ... [2024-11-10 05:00:18,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:17" (1/1) ... [2024-11-10 05:00:18,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:17" (1/1) ... [2024-11-10 05:00:18,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:17" (1/1) ... [2024-11-10 05:00:18,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:00:18,059 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:00:18,059 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:00:18,059 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:00:18,060 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:17" (1/1) ... [2024-11-10 05:00:18,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:00:18,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:00:18,098 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 05:00:18,102 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 05:00:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:00:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 05:00:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:00:18,146 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:00:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:00:18,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:00:18,229 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:00:18,231 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:00:19,937 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 05:00:19,939 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:00:19,953 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:00:19,953 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:00:19,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:00:19 BoogieIcfgContainer [2024-11-10 05:00:19,954 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:00:19,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:00:19,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:00:19,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:00:19,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:00:17" (1/3) ... [2024-11-10 05:00:19,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d54e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:00:19, skipping insertion in model container [2024-11-10 05:00:19,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:00:17" (2/3) ... [2024-11-10 05:00:19,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d54e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:00:19, skipping insertion in model container [2024-11-10 05:00:19,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:00:19" (3/3) ... [2024-11-10 05:00:19,961 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-83.i [2024-11-10 05:00:19,978 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:00:19,978 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:00:20,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:00:20,044 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;@660259f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:00:20,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:00:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 05:00:20,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 05:00:20,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:00:20,060 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:20,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:00:20,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:00:20,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1602124674, now seen corresponding path program 1 times [2024-11-10 05:00:20,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:00:20,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873665134] [2024-11-10 05:00:20,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:20,087 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 05:00:20,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:00:20,091 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 05:00:20,092 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 05:00:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:20,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 05:00:20,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:00:20,662 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-10 05:00:20,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:00:20,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:00:20,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873665134] [2024-11-10 05:00:20,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873665134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:00:20,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:00:20,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:00:20,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732970437] [2024-11-10 05:00:20,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:00:20,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:00:20,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:00:20,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:00:20,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:00:20,712 INFO L87 Difference]: Start difference. First operand has 75 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 05:00:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:00:20,755 INFO L93 Difference]: Finished difference Result 142 states and 246 transitions. [2024-11-10 05:00:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:00:20,758 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 143 [2024-11-10 05:00:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:00:20,767 INFO L225 Difference]: With dead ends: 142 [2024-11-10 05:00:20,767 INFO L226 Difference]: Without dead ends: 70 [2024-11-10 05:00:20,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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 05:00:20,777 INFO L432 NwaCegarLoop]: 108 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, 108 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 05:00:20,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:00:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-10 05:00:20,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-10 05:00:20,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 05:00:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 108 transitions. [2024-11-10 05:00:20,831 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 108 transitions. Word has length 143 [2024-11-10 05:00:20,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:00:20,833 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 108 transitions. [2024-11-10 05:00:20,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-10 05:00:20,834 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 108 transitions. [2024-11-10 05:00:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 05:00:20,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:00:20,841 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:20,862 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 05:00:21,042 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 05:00:21,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:00:21,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:00:21,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1960067585, now seen corresponding path program 1 times [2024-11-10 05:00:21,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:00:21,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368530840] [2024-11-10 05:00:21,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:21,045 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 05:00:21,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:00:21,047 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 05:00:21,048 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 05:00:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:21,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 05:00:21,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:00:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 536 proven. 66 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-10 05:00:22,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:00:22,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:00:22,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368530840] [2024-11-10 05:00:22,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368530840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:00:22,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [782431312] [2024-11-10 05:00:22,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:22,997 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 05:00:22,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 05:00:23,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 05:00:23,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-10 05:00:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:23,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 05:00:23,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:00:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 05:00:23,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:00:23,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [782431312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:00:23,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 05:00:23,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-10 05:00:23,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747359142] [2024-11-10 05:00:23,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:00:23,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:00:23,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:00:23,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:00:23,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 05:00:23,484 INFO L87 Difference]: Start difference. First operand 70 states and 108 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 05:00:24,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:00:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:00:24,812 INFO L93 Difference]: Finished difference Result 165 states and 256 transitions. [2024-11-10 05:00:24,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:00:24,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2024-11-10 05:00:24,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:00:24,816 INFO L225 Difference]: With dead ends: 165 [2024-11-10 05:00:24,816 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 05:00:24,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 05:00:24,818 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 35 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:00:24,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 222 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 05:00:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 05:00:24,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2024-11-10 05:00:24,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.46875) internal successors, (94), 64 states have internal predecessors, (94), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 05:00:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2024-11-10 05:00:24,830 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 136 transitions. Word has length 143 [2024-11-10 05:00:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:00:24,832 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 136 transitions. [2024-11-10 05:00:24,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 05:00:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2024-11-10 05:00:24,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 05:00:24,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:00:24,838 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:24,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-11-10 05:00:25,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 05:00:25,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 05:00:25,239 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:00:25,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:00:25,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1447396030, now seen corresponding path program 1 times [2024-11-10 05:00:25,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:00:25,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577145872] [2024-11-10 05:00:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:25,241 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 05:00:25,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:00:25,244 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 05:00:25,245 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 05:00:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:25,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 05:00:25,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:00:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 536 proven. 66 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-10 05:00:26,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:00:27,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:00:27,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577145872] [2024-11-10 05:00:27,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577145872] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:00:27,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [953298738] [2024-11-10 05:00:27,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:27,087 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 05:00:27,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 05:00:27,089 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 05:00:27,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-10 05:00:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:27,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 05:00:27,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:00:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 05:00:27,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:00:27,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [953298738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:00:27,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 05:00:27,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-10 05:00:27,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663499470] [2024-11-10 05:00:27,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:00:27,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:00:27,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:00:27,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:00:27,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 05:00:27,592 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 05:00:29,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:00:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:00:29,291 INFO L93 Difference]: Finished difference Result 182 states and 280 transitions. [2024-11-10 05:00:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:00:29,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2024-11-10 05:00:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:00:29,322 INFO L225 Difference]: With dead ends: 182 [2024-11-10 05:00:29,322 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 05:00:29,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 05:00:29,325 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 30 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 05:00:29,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 193 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 05:00:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 05:00:29,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2024-11-10 05:00:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 05:00:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2024-11-10 05:00:29,351 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 143 [2024-11-10 05:00:29,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:00:29,352 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2024-11-10 05:00:29,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-10 05:00:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2024-11-10 05:00:29,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 05:00:29,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:00:29,355 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:29,374 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 (5)] Ended with exit code 0 [2024-11-10 05:00:29,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-10 05:00:29,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 05:00:29,756 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:00:29,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:00:29,757 INFO L85 PathProgramCache]: Analyzing trace with hash 527445248, now seen corresponding path program 1 times [2024-11-10 05:00:29,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:00:29,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889118869] [2024-11-10 05:00:29,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:29,758 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 05:00:29,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:00:29,759 INFO L229 MonitoredProcess]: Starting monitored process 7 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 05:00:29,760 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 (7)] Waiting until timeout for monitored process [2024-11-10 05:00:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:30,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 05:00:30,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:00:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 536 proven. 66 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-10 05:00:30,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:00:31,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:00:31,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889118869] [2024-11-10 05:00:31,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889118869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:00:31,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1211849632] [2024-11-10 05:00:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:31,171 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 05:00:31,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 05:00:31,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 05:00:31,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-10 05:00:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:32,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 05:00:32,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:00:33,260 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 536 proven. 66 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-10 05:00:33,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:00:33,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1211849632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:00:33,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:00:33,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-10 05:00:33,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688143453] [2024-11-10 05:00:33,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:00:33,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 05:00:33,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:00:33,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 05:00:33,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 05:00:33,382 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-10 05:00:36,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 05:00:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:00:36,166 INFO L93 Difference]: Finished difference Result 183 states and 273 transitions. [2024-11-10 05:00:36,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 05:00:36,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 143 [2024-11-10 05:00:36,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:00:36,202 INFO L225 Difference]: With dead ends: 183 [2024-11-10 05:00:36,202 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 05:00:36,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 05:00:36,208 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 50 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-10 05:00:36,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 209 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-10 05:00:36,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 05:00:36,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-11-10 05:00:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 05:00:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-10 05:00:36,226 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 143 [2024-11-10 05:00:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:00:36,233 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-10 05:00:36,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-10 05:00:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-10 05:00:36,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 05:00:36,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:00:36,235 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:00:36,259 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 (7)] Ended with exit code 0 [2024-11-10 05:00:36,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-10 05:00:36,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 05:00:36,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:00:36,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:00:36,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1269506111, now seen corresponding path program 1 times [2024-11-10 05:00:36,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:00:36,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710495387] [2024-11-10 05:00:36,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:00:36,638 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 05:00:36,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:00:36,642 INFO L229 MonitoredProcess]: Starting monitored process 9 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 05:00:36,643 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 (9)] Waiting until timeout for monitored process [2024-11-10 05:00:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:00:37,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 05:00:37,173 INFO L278 TraceCheckSpWp]: Computing forward predicates...