./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.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-72.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 81213420de67d7031374276867f37766c379eaf87e05b9017b1369e2411ba1d2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:58:32,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:58:32,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:58:32,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:58:32,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:58:32,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:58:32,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:58:32,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:58:32,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:58:32,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:58:32,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:58:32,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:58:32,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:58:32,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:58:32,665 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:58:32,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:58:32,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:58:32,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:58:32,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:58:32,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:58:32,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:58:32,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:58:32,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:58:32,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:58:32,672 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:58:32,672 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:58:32,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:58:32,672 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:58:32,673 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:58:32,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:58:32,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:58:32,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:58:32,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:58:32,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:58:32,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:58:32,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:58:32,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:58:32,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:58:32,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:58:32,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:58:32,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:58:32,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:58:32,677 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 -> 81213420de67d7031374276867f37766c379eaf87e05b9017b1369e2411ba1d2 [2024-11-10 04:58:32,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:58:32,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:58:32,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:58:32,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:58:32,929 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:58:32,930 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-72.i [2024-11-10 04:58:34,395 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:58:34,610 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:58:34,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.i [2024-11-10 04:58:34,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5409b1b17/ccf733bbbcbb491e89a63b66e9dcf422/FLAGf99b956aa [2024-11-10 04:58:34,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5409b1b17/ccf733bbbcbb491e89a63b66e9dcf422 [2024-11-10 04:58:34,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:58:34,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:58:34,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:58:34,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:58:34,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:58:34,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:58:34" (1/1) ... [2024-11-10 04:58:34,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c8d2e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:34, skipping insertion in model container [2024-11-10 04:58:34,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:58:34" (1/1) ... [2024-11-10 04:58:35,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:58:35,205 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-72.i[919,932] [2024-11-10 04:58:35,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:58:35,279 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:58:35,291 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-72.i[919,932] [2024-11-10 04:58:35,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:58:35,361 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:58:35,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:35 WrapperNode [2024-11-10 04:58:35,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:58:35,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:58:35,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:58:35,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:58:35,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:35" (1/1) ... [2024-11-10 04:58:35,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:35" (1/1) ... [2024-11-10 04:58:35,446 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 228 [2024-11-10 04:58:35,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:58:35,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:58:35,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:58:35,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:58:35,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:35" (1/1) ... [2024-11-10 04:58:35,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:35" (1/1) ... [2024-11-10 04:58:35,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:35" (1/1) ... [2024-11-10 04:58:35,499 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 04:58:35,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:35" (1/1) ... [2024-11-10 04:58:35,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:35" (1/1) ... [2024-11-10 04:58:35,512 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:35" (1/1) ... [2024-11-10 04:58:35,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:35" (1/1) ... [2024-11-10 04:58:35,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:35" (1/1) ... [2024-11-10 04:58:35,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:35" (1/1) ... [2024-11-10 04:58:35,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:58:35,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:58:35,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:58:35,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:58:35,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:35" (1/1) ... [2024-11-10 04:58:35,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:58:35,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:58:35,565 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 04:58:35,571 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 04:58:35,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:58:35,619 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:58:35,620 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:58:35,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:58:35,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:58:35,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:58:35,713 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:58:35,716 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:58:36,133 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-10 04:58:36,134 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:58:36,160 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:58:36,160 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:58:36,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:58:36 BoogieIcfgContainer [2024-11-10 04:58:36,161 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:58:36,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:58:36,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:58:36,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:58:36,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:58:34" (1/3) ... [2024-11-10 04:58:36,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ab3c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:58:36, skipping insertion in model container [2024-11-10 04:58:36,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:35" (2/3) ... [2024-11-10 04:58:36,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ab3c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:58:36, skipping insertion in model container [2024-11-10 04:58:36,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:58:36" (3/3) ... [2024-11-10 04:58:36,202 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.i [2024-11-10 04:58:36,245 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:58:36,245 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:58:36,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:58:36,333 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;@3a047afa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:58:36,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:58:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:58:36,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 04:58:36,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:58:36,356 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:36,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:58:36,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:58:36,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1241334819, now seen corresponding path program 1 times [2024-11-10 04:58:36,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:58:36,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137333579] [2024-11-10 04:58:36,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:36,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:58:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:58:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:58:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:58:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:58:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:58:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:58:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:58:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:58:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:58:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:58:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:58:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:58:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:58:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:58:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:58:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:58:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:58:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:58:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:58:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:58:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:58:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:58:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:58:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:58:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:58:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:58:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:58:36,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:58:36,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137333579] [2024-11-10 04:58:36,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137333579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:58:36,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:58:36,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:58:36,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179313097] [2024-11-10 04:58:36,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:58:36,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:58:36,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:58:37,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:58:37,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:58:37,011 INFO L87 Difference]: Start difference. First operand has 99 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:58:37,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:58:37,051 INFO L93 Difference]: Finished difference Result 190 states and 327 transitions. [2024-11-10 04:58:37,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:58:37,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 175 [2024-11-10 04:58:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:58:37,062 INFO L225 Difference]: With dead ends: 190 [2024-11-10 04:58:37,062 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 04:58:37,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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 04:58:37,069 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:58:37,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:58:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 04:58:37,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 04:58:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 66 states have internal predecessors, (93), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:58:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 145 transitions. [2024-11-10 04:58:37,118 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 145 transitions. Word has length 175 [2024-11-10 04:58:37,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:58:37,118 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 145 transitions. [2024-11-10 04:58:37,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:58:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 145 transitions. [2024-11-10 04:58:37,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 04:58:37,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:58:37,123 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:37,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:58:37,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:58:37,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:58:37,124 INFO L85 PathProgramCache]: Analyzing trace with hash -800821242, now seen corresponding path program 1 times [2024-11-10 04:58:37,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:58:37,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368895112] [2024-11-10 04:58:37,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:37,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:58:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:58:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:58:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:58:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:58:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:58:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:58:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:58:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:58:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:58:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:58:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:58:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:58:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:58:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:58:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:58:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:58:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:58:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:58:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:58:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:58:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:58:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:58:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:58:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:58:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:58:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:58:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:58:37,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:58:37,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368895112] [2024-11-10 04:58:37,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368895112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:58:37,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:58:37,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:58:37,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36529192] [2024-11-10 04:58:37,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:58:37,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:58:37,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:58:37,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:58:37,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:58:37,747 INFO L87 Difference]: Start difference. First operand 94 states and 145 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:58:37,831 INFO L93 Difference]: Finished difference Result 227 states and 352 transitions. [2024-11-10 04:58:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:58:37,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-10 04:58:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:58:37,838 INFO L225 Difference]: With dead ends: 227 [2024-11-10 04:58:37,838 INFO L226 Difference]: Without dead ends: 136 [2024-11-10 04:58:37,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:58:37,840 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 60 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:58:37,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 270 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:58:37,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-10 04:58:37,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 98. [2024-11-10 04:58:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:58:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 151 transitions. [2024-11-10 04:58:37,863 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 151 transitions. Word has length 175 [2024-11-10 04:58:37,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:58:37,864 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 151 transitions. [2024-11-10 04:58:37,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2024-11-10 04:58:37,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 04:58:37,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:58:37,868 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:37,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:58:37,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:58:37,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:58:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1859573579, now seen corresponding path program 1 times [2024-11-10 04:58:37,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:58:37,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783462298] [2024-11-10 04:58:37,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:37,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:58:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:58:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:58:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:58:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:58:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:58:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:58:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:58:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:58:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:58:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:58:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:58:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:58:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:58:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:58:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:58:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:58:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:58:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:58:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:58:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:58:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:58:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:58:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:58:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:58:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:58:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:58:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:58:38,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:58:38,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783462298] [2024-11-10 04:58:38,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783462298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:58:38,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:58:38,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:58:38,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001743923] [2024-11-10 04:58:38,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:58:38,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:58:38,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:58:38,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:58:38,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:58:38,241 INFO L87 Difference]: Start difference. First operand 98 states and 151 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:38,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:58:38,284 INFO L93 Difference]: Finished difference Result 194 states and 301 transitions. [2024-11-10 04:58:38,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:58:38,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-10 04:58:38,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:58:38,287 INFO L225 Difference]: With dead ends: 194 [2024-11-10 04:58:38,288 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 04:58:38,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:58:38,292 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:58:38,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:58:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 04:58:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-10 04:58:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:58:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 152 transitions. [2024-11-10 04:58:38,310 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 152 transitions. Word has length 176 [2024-11-10 04:58:38,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:58:38,311 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 152 transitions. [2024-11-10 04:58:38,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 152 transitions. [2024-11-10 04:58:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 04:58:38,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:58:38,317 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:38,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:58:38,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:58:38,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:58:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1178778553, now seen corresponding path program 1 times [2024-11-10 04:58:38,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:58:38,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284176891] [2024-11-10 04:58:38,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:38,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:58:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:58:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:58:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:58:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:58:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:58:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:58:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:58:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:58:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:58:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:58:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:58:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:58:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:58:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:58:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:58:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:58:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:58:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:58:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:58:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:58:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:58:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:58:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:58:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:58:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:58:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:58:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:58:38,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:58:38,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284176891] [2024-11-10 04:58:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284176891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:58:38,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:58:38,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:58:38,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544787765] [2024-11-10 04:58:38,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:58:38,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:58:38,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:58:38,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:58:38,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:58:38,932 INFO L87 Difference]: Start difference. First operand 99 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:58:39,184 INFO L93 Difference]: Finished difference Result 303 states and 463 transitions. [2024-11-10 04:58:39,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:58:39,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-10 04:58:39,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:58:39,189 INFO L225 Difference]: With dead ends: 303 [2024-11-10 04:58:39,190 INFO L226 Difference]: Without dead ends: 207 [2024-11-10 04:58:39,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:58:39,192 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 243 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:58:39,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 356 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:58:39,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-10 04:58:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 147. [2024-11-10 04:58:39,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 113 states have (on average 1.407079646017699) internal successors, (159), 114 states have internal predecessors, (159), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 04:58:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2024-11-10 04:58:39,214 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 177 [2024-11-10 04:58:39,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:58:39,214 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2024-11-10 04:58:39,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2024-11-10 04:58:39,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 04:58:39,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:58:39,217 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:39,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:58:39,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:58:39,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:58:39,218 INFO L85 PathProgramCache]: Analyzing trace with hash -628675910, now seen corresponding path program 1 times [2024-11-10 04:58:39,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:58:39,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410315928] [2024-11-10 04:58:39,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:39,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:58:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:58:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:58:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:58:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:58:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:58:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:58:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:58:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:58:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:58:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:58:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:58:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:58:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:58:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:58:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:58:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:58:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:58:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:58:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:58:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:58:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:58:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:58:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:58:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:58:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:58:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:58:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:58:39,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:58:39,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410315928] [2024-11-10 04:58:39,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410315928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:58:39,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488797457] [2024-11-10 04:58:39,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:39,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:58:39,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:58:39,689 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 04:58:39,691 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 04:58:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:39,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:58:39,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:58:40,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 435 proven. 60 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-10 04:58:40,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:58:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:58:40,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488797457] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:58:40,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:58:40,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 04:58:40,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342860464] [2024-11-10 04:58:40,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:58:40,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 04:58:40,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:58:40,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 04:58:40,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:58:40,378 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-10 04:58:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:58:40,624 INFO L93 Difference]: Finished difference Result 260 states and 391 transitions. [2024-11-10 04:58:40,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 04:58:40,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 177 [2024-11-10 04:58:40,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:58:40,627 INFO L225 Difference]: With dead ends: 260 [2024-11-10 04:58:40,627 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 04:58:40,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-10 04:58:40,628 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 144 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:58:40,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 316 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:58:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 04:58:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2024-11-10 04:58:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 80 states have internal predecessors, (106), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 04:58:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 168 transitions. [2024-11-10 04:58:40,640 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 168 transitions. Word has length 177 [2024-11-10 04:58:40,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:58:40,641 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 168 transitions. [2024-11-10 04:58:40,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-10 04:58:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 168 transitions. [2024-11-10 04:58:40,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 04:58:40,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:58:40,643 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:40,662 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 04:58:40,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:58:40,845 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:58:40,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:58:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash -859277736, now seen corresponding path program 1 times [2024-11-10 04:58:40,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:58:40,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541867825] [2024-11-10 04:58:40,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:40,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:58:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:58:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:58:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:58:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:58:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:58:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:58:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:58:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:58:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:58:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:58:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:58:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:58:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:58:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:58:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:58:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:58:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:58:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:58:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:58:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:58:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:58:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:58:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:58:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:58:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:58:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:58:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:58:41,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:58:41,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541867825] [2024-11-10 04:58:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541867825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:58:41,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:58:41,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:58:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157581571] [2024-11-10 04:58:41,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:58:41,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:58:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:58:41,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:58:41,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:58:41,315 INFO L87 Difference]: Start difference. First operand 113 states and 168 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:58:41,439 INFO L93 Difference]: Finished difference Result 278 states and 400 transitions. [2024-11-10 04:58:41,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:58:41,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-10 04:58:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:58:41,443 INFO L225 Difference]: With dead ends: 278 [2024-11-10 04:58:41,443 INFO L226 Difference]: Without dead ends: 178 [2024-11-10 04:58:41,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:58:41,444 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 184 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:58:41,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 358 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:58:41,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-10 04:58:41,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 173. [2024-11-10 04:58:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 125 states have (on average 1.312) internal successors, (164), 127 states have internal predecessors, (164), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 04:58:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 244 transitions. [2024-11-10 04:58:41,478 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 244 transitions. Word has length 177 [2024-11-10 04:58:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:58:41,479 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 244 transitions. [2024-11-10 04:58:41,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 244 transitions. [2024-11-10 04:58:41,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 04:58:41,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:58:41,481 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:41,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 04:58:41,482 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:58:41,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:58:41,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1628235097, now seen corresponding path program 1 times [2024-11-10 04:58:41,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:58:41,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777044700] [2024-11-10 04:58:41,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:41,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:58:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:58:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:58:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:58:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:58:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:58:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:58:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:58:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:58:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:58:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:58:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:58:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:58:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:58:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:58:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:58:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:58:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:58:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:58:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:58:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:58:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:58:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:58:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:58:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:58:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:58:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:58:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:58:41,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:58:41,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777044700] [2024-11-10 04:58:41,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777044700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:58:41,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:58:41,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:58:41,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528213172] [2024-11-10 04:58:41,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:58:41,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:58:41,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:58:41,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:58:41,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:58:41,685 INFO L87 Difference]: Start difference. First operand 173 states and 244 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:41,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:58:41,843 INFO L93 Difference]: Finished difference Result 388 states and 535 transitions. [2024-11-10 04:58:41,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 04:58:41,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-10 04:58:41,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:58:41,846 INFO L225 Difference]: With dead ends: 388 [2024-11-10 04:58:41,847 INFO L226 Difference]: Without dead ends: 235 [2024-11-10 04:58:41,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:58:41,848 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 199 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:58:41,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 589 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:58:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-10 04:58:41,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 158. [2024-11-10 04:58:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 120 states have (on average 1.375) internal successors, (165), 121 states have internal predecessors, (165), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 04:58:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 229 transitions. [2024-11-10 04:58:41,868 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 229 transitions. Word has length 177 [2024-11-10 04:58:41,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:58:41,869 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 229 transitions. [2024-11-10 04:58:41,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 229 transitions. [2024-11-10 04:58:41,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 04:58:41,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:58:41,871 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:41,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 04:58:41,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:58:41,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:58:41,871 INFO L85 PathProgramCache]: Analyzing trace with hash -921068222, now seen corresponding path program 1 times [2024-11-10 04:58:41,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:58:41,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625571465] [2024-11-10 04:58:41,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:41,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:58:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:41,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:58:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:58:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:58:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:58:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:58:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:58:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:58:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:58:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:58:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:58:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:58:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:58:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:58:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:58:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:58:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:58:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:58:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:58:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:58:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:58:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:58:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:58:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:58:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:58:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:58:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:58:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:58:42,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:58:42,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625571465] [2024-11-10 04:58:42,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625571465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:58:42,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:58:42,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:58:42,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514537635] [2024-11-10 04:58:42,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:58:42,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:58:42,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:58:42,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:58:42,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:58:42,051 INFO L87 Difference]: Start difference. First operand 158 states and 229 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:58:42,249 INFO L93 Difference]: Finished difference Result 433 states and 634 transitions. [2024-11-10 04:58:42,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:58:42,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2024-11-10 04:58:42,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:58:42,253 INFO L225 Difference]: With dead ends: 433 [2024-11-10 04:58:42,254 INFO L226 Difference]: Without dead ends: 294 [2024-11-10 04:58:42,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:58:42,256 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 156 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:58:42,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 476 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:58:42,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-10 04:58:42,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 161. [2024-11-10 04:58:42,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 123 states have (on average 1.3739837398373984) internal successors, (169), 124 states have internal predecessors, (169), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 04:58:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 233 transitions. [2024-11-10 04:58:42,279 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 233 transitions. Word has length 178 [2024-11-10 04:58:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:58:42,280 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 233 transitions. [2024-11-10 04:58:42,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 233 transitions. [2024-11-10 04:58:42,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 04:58:42,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:58:42,282 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:42,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 04:58:42,282 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:58:42,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:58:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1431602399, now seen corresponding path program 1 times [2024-11-10 04:58:42,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:58:42,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40156535] [2024-11-10 04:58:42,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:58:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:58:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:58:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:58:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:58:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:58:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:58:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:58:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:58:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:58:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:58:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:58:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:58:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:58:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:58:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:58:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:58:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:58:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:58:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:58:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:58:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:58:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:58:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:58:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:58:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:58:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:58:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 51 proven. 24 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:58:42,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:58:42,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40156535] [2024-11-10 04:58:42,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40156535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:58:42,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558768423] [2024-11-10 04:58:42,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:42,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:58:42,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:58:42,586 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 04:58:42,587 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 04:58:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:42,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:58:42,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:58:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 603 proven. 24 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2024-11-10 04:58:42,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:58:43,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 51 proven. 24 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:58:43,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558768423] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:58:43,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:58:43,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-10 04:58:43,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293799702] [2024-11-10 04:58:43,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:58:43,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 04:58:43,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:58:43,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 04:58:43,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 04:58:43,111 INFO L87 Difference]: Start difference. First operand 161 states and 233 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-10 04:58:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:58:43,371 INFO L93 Difference]: Finished difference Result 309 states and 447 transitions. [2024-11-10 04:58:43,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 04:58:43,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 178 [2024-11-10 04:58:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:58:43,374 INFO L225 Difference]: With dead ends: 309 [2024-11-10 04:58:43,374 INFO L226 Difference]: Without dead ends: 167 [2024-11-10 04:58:43,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:58:43,375 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 210 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:58:43,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 238 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:58:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-10 04:58:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2024-11-10 04:58:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 126 states have (on average 1.2936507936507937) internal successors, (163), 127 states have internal predecessors, (163), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 04:58:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 227 transitions. [2024-11-10 04:58:43,401 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 227 transitions. Word has length 178 [2024-11-10 04:58:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:58:43,401 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 227 transitions. [2024-11-10 04:58:43,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-10 04:58:43,402 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 227 transitions. [2024-11-10 04:58:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-10 04:58:43,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:58:43,404 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:43,423 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 04:58:43,608 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,SelfDestructingSolverStorable8 [2024-11-10 04:58:43,609 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:58:43,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:58:43,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1332675356, now seen corresponding path program 1 times [2024-11-10 04:58:43,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:58:43,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623449533] [2024-11-10 04:58:43,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:43,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:58:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:58:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:58:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:58:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:58:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:58:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:58:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:58:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:58:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:58:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:58:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:58:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:58:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:58:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:58:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:58:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:58:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:58:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:58:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:58:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:58:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:58:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:58:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:58:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:58:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:58:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:58:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:58:43,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:58:43,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623449533] [2024-11-10 04:58:43,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623449533] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:58:43,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604882078] [2024-11-10 04:58:43,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:43,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:58:43,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:58:43,898 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 04:58:43,899 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 04:58:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:44,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:58:44,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:58:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 403 proven. 12 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2024-11-10 04:58:44,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:58:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:58:44,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604882078] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:58:44,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:58:44,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-10 04:58:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180599243] [2024-11-10 04:58:44,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:58:44,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 04:58:44,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:58:44,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 04:58:44,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 04:58:44,318 INFO L87 Difference]: Start difference. First operand 165 states and 227 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2024-11-10 04:58:44,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:58:44,530 INFO L93 Difference]: Finished difference Result 317 states and 435 transitions. [2024-11-10 04:58:44,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 04:58:44,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 179 [2024-11-10 04:58:44,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:58:44,532 INFO L225 Difference]: With dead ends: 317 [2024-11-10 04:58:44,532 INFO L226 Difference]: Without dead ends: 171 [2024-11-10 04:58:44,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:58:44,533 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 146 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:58:44,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 249 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:58:44,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-10 04:58:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-11-10 04:58:44,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 129 states have (on average 1.2403100775193798) internal successors, (160), 130 states have internal predecessors, (160), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 04:58:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 224 transitions. [2024-11-10 04:58:44,558 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 224 transitions. Word has length 179 [2024-11-10 04:58:44,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:58:44,558 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 224 transitions. [2024-11-10 04:58:44,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2024-11-10 04:58:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 224 transitions. [2024-11-10 04:58:44,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-10 04:58:44,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:58:44,561 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:44,579 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 04:58:44,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:58:44,764 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:58:44,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:58:44,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1947580097, now seen corresponding path program 1 times [2024-11-10 04:58:44,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:58:44,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874279324] [2024-11-10 04:58:44,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:44,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:58:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:58:44,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [572690911] [2024-11-10 04:58:44,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:44,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:58:44,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:58:44,888 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 04:58:44,889 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 04:58:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:45,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 04:58:45,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:58:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:58:45,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:58:45,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:58:45,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874279324] [2024-11-10 04:58:45,531 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 04:58:45,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572690911] [2024-11-10 04:58:45,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572690911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:58:45,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:58:45,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:58:45,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317435286] [2024-11-10 04:58:45,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:58:45,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:58:45,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:58:45,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:58:45,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:58:45,534 INFO L87 Difference]: Start difference. First operand 169 states and 224 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:58:45,705 INFO L93 Difference]: Finished difference Result 456 states and 610 transitions. [2024-11-10 04:58:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:58:45,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2024-11-10 04:58:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:58:45,708 INFO L225 Difference]: With dead ends: 456 [2024-11-10 04:58:45,708 INFO L226 Difference]: Without dead ends: 306 [2024-11-10 04:58:45,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:58:45,709 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 102 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:58:45,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 392 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:58:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-10 04:58:45,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 219. [2024-11-10 04:58:45,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 155 states have (on average 1.2) internal successors, (186), 155 states have internal predecessors, (186), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 04:58:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 290 transitions. [2024-11-10 04:58:45,745 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 290 transitions. Word has length 180 [2024-11-10 04:58:45,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:58:45,745 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 290 transitions. [2024-11-10 04:58:45,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 290 transitions. [2024-11-10 04:58:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-10 04:58:45,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:58:45,749 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:45,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 04:58:45,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:58:45,950 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:58:45,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:58:45,951 INFO L85 PathProgramCache]: Analyzing trace with hash 651368702, now seen corresponding path program 1 times [2024-11-10 04:58:45,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:58:45,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341566756] [2024-11-10 04:58:45,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:45,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:58:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:58:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:58:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:58:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:58:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:58:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:58:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:58:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:58:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:58:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:58:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:58:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:58:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:58:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:58:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:58:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:58:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:58:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:58:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:58:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:58:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:58:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:58:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:58:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:58:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:58:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:58:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:58:46,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:58:46,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341566756] [2024-11-10 04:58:46,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341566756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:58:46,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:58:46,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:58:46,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476435004] [2024-11-10 04:58:46,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:58:46,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:58:46,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:58:46,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:58:46,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:58:46,112 INFO L87 Difference]: Start difference. First operand 219 states and 290 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:58:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:58:46,281 INFO L93 Difference]: Finished difference Result 515 states and 685 transitions. [2024-11-10 04:58:46,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:58:46,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 180 [2024-11-10 04:58:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:58:46,286 INFO L225 Difference]: With dead ends: 515 [2024-11-10 04:58:46,287 INFO L226 Difference]: Without dead ends: 365 [2024-11-10 04:58:46,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:58:46,288 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 241 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:58:46,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 246 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:58:46,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-10 04:58:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 219. [2024-11-10 04:58:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 155 states have (on average 1.2) internal successors, (186), 155 states have internal predecessors, (186), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 04:58:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 290 transitions. [2024-11-10 04:58:46,333 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 290 transitions. Word has length 180 [2024-11-10 04:58:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:58:46,334 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 290 transitions. [2024-11-10 04:58:46,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:58:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 290 transitions. [2024-11-10 04:58:46,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-10 04:58:46,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:58:46,336 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:46,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 04:58:46,336 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:58:46,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:58:46,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1319578791, now seen corresponding path program 1 times [2024-11-10 04:58:46,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:58:46,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668891860] [2024-11-10 04:58:46,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:46,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:58:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:58:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:58:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:58:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:58:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:58:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:58:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:58:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:58:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:58:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:58:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:58:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:58:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:58:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:58:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:58:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:58:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:58:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:58:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:58:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:58:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:58:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:58:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:58:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:58:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:58:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:58:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:58:46,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:58:46,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668891860] [2024-11-10 04:58:46,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668891860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:58:46,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:58:46,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:58:46,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388487883] [2024-11-10 04:58:46,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:58:46,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:58:46,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:58:46,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:58:46,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:58:46,593 INFO L87 Difference]: Start difference. First operand 219 states and 290 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:46,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:58:46,740 INFO L93 Difference]: Finished difference Result 451 states and 601 transitions. [2024-11-10 04:58:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:58:46,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 181 [2024-11-10 04:58:46,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:58:46,743 INFO L225 Difference]: With dead ends: 451 [2024-11-10 04:58:46,743 INFO L226 Difference]: Without dead ends: 301 [2024-11-10 04:58:46,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:58:46,744 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 92 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:58:46,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 384 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:58:46,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-10 04:58:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 220. [2024-11-10 04:58:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 156 states have (on average 1.1987179487179487) internal successors, (187), 156 states have internal predecessors, (187), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 04:58:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 291 transitions. [2024-11-10 04:58:46,787 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 291 transitions. Word has length 181 [2024-11-10 04:58:46,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:58:46,788 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 291 transitions. [2024-11-10 04:58:46,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 291 transitions. [2024-11-10 04:58:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-10 04:58:46,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:58:46,790 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:46,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 04:58:46,790 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:58:46,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:58:46,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1336702171, now seen corresponding path program 1 times [2024-11-10 04:58:46,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:58:46,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573030777] [2024-11-10 04:58:46,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:46,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:58:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:58:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:58:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:58:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 04:58:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:58:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:58:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:58:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 04:58:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:58:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 04:58:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 04:58:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:58:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 04:58:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:58:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:58:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:58:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:58:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:58:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 04:58:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:58:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:58:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:58:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:58:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:58:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:58:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 04:58:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:58:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:58:46,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:58:46,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573030777] [2024-11-10 04:58:46,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573030777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:58:46,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:58:46,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:58:46,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040375263] [2024-11-10 04:58:46,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:58:46,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:58:46,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:58:46,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:58:46,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:58:46,982 INFO L87 Difference]: Start difference. First operand 220 states and 291 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:47,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:58:47,156 INFO L93 Difference]: Finished difference Result 516 states and 685 transitions. [2024-11-10 04:58:47,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:58:47,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 181 [2024-11-10 04:58:47,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:58:47,159 INFO L225 Difference]: With dead ends: 516 [2024-11-10 04:58:47,159 INFO L226 Difference]: Without dead ends: 366 [2024-11-10 04:58:47,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:58:47,161 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 231 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:58:47,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 244 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:58:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-10 04:58:47,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 216. [2024-11-10 04:58:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 152 states have (on average 1.1907894736842106) internal successors, (181), 152 states have internal predecessors, (181), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 04:58:47,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 285 transitions. [2024-11-10 04:58:47,201 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 285 transitions. Word has length 181 [2024-11-10 04:58:47,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:58:47,202 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 285 transitions. [2024-11-10 04:58:47,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:58:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 285 transitions. [2024-11-10 04:58:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-10 04:58:47,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:58:47,204 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:47,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 04:58:47,205 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:58:47,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:58:47,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1294341187, now seen corresponding path program 1 times [2024-11-10 04:58:47,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:58:47,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898682933] [2024-11-10 04:58:47,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:47,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:58:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:58:47,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631428476] [2024-11-10 04:58:47,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:58:47,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:58:47,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:58:47,277 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:58:47,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 04:58:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:58:47,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:58:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:58:47,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:58:47,637 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:58:47,637 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:58:47,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 04:58:47,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 04:58:47,843 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:58:47,974 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:58:47,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:58:47 BoogieIcfgContainer [2024-11-10 04:58:47,977 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:58:47,978 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:58:47,978 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:58:47,978 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:58:47,979 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:58:36" (3/4) ... [2024-11-10 04:58:47,981 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:58:47,982 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:58:47,983 INFO L158 Benchmark]: Toolchain (without parser) took 13001.02ms. Allocated memory was 199.2MB in the beginning and 299.9MB in the end (delta: 100.7MB). Free memory was 129.0MB in the beginning and 129.5MB in the end (delta: -481.6kB). Peak memory consumption was 103.3MB. Max. memory is 16.1GB. [2024-11-10 04:58:47,983 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 127.9MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:58:47,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.58ms. Allocated memory is still 199.2MB. Free memory was 128.5MB in the beginning and 111.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 04:58:47,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.25ms. Allocated memory is still 199.2MB. Free memory was 111.6MB in the beginning and 108.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 04:58:47,984 INFO L158 Benchmark]: Boogie Preprocessor took 82.91ms. Allocated memory is still 199.2MB. Free memory was 108.1MB in the beginning and 103.9MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:58:47,984 INFO L158 Benchmark]: IcfgBuilder took 630.46ms. Allocated memory is still 199.2MB. Free memory was 103.9MB in the beginning and 76.7MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 04:58:47,985 INFO L158 Benchmark]: TraceAbstraction took 11794.09ms. Allocated memory was 199.2MB in the beginning and 299.9MB in the end (delta: 100.7MB). Free memory was 168.3MB in the beginning and 130.6MB in the end (delta: 37.7MB). Peak memory consumption was 137.3MB. Max. memory is 16.1GB. [2024-11-10 04:58:47,985 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 299.9MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:58:47,989 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.18ms. Allocated memory is still 127.9MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.58ms. Allocated memory is still 199.2MB. Free memory was 128.5MB in the beginning and 111.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.25ms. Allocated memory is still 199.2MB. Free memory was 111.6MB in the beginning and 108.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.91ms. Allocated memory is still 199.2MB. Free memory was 108.1MB in the beginning and 103.9MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 630.46ms. Allocated memory is still 199.2MB. Free memory was 103.9MB in the beginning and 76.7MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11794.09ms. Allocated memory was 199.2MB in the beginning and 299.9MB in the end (delta: 100.7MB). Free memory was 168.3MB in the beginning and 130.6MB in the end (delta: 37.7MB). Peak memory consumption was 137.3MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 299.9MB. Free memory is still 129.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 198. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_10 = 2; [L24] signed char var_1_11 = 1; [L25] float var_1_14 = 64.3; [L26] signed char var_1_16 = 32; [L27] unsigned char var_1_17 = 1; [L28] unsigned char var_1_18 = 0; [L29] unsigned char var_1_19 = 0; [L30] double var_1_20 = 9.25; [L31] double var_1_21 = 255.05; [L32] double var_1_22 = 25.5; [L33] unsigned char var_1_23 = 2; [L34] unsigned char var_1_25 = 1; [L35] unsigned short int var_1_26 = 5; [L36] unsigned char var_1_27 = 128; [L37] unsigned char var_1_28 = 1; [L38] signed long int var_1_29 = 128; [L39] unsigned long int var_1_31 = 1; [L40] unsigned long int var_1_32 = 64; [L41] unsigned long int var_1_37 = 3773873024; [L42] unsigned long int var_1_38 = 2296504360; [L43] unsigned long int var_1_39 = 16; [L44] unsigned long int var_1_40 = 2753961414; [L45] unsigned char var_1_41 = 8; [L46] signed short int var_1_43 = -50; [L47] signed char var_1_44 = -1; [L48] double var_1_47 = 255.2; [L49] double var_1_50 = 50.4; [L50] double var_1_51 = 49.25; [L51] double var_1_52 = 1000000.4; [L52] double var_1_53 = 256.2; [L53] signed char var_1_54 = -8; [L54] unsigned char last_1_var_1_17 = 1; [L55] double last_1_var_1_20 = 9.25; [L56] unsigned char last_1_var_1_23 = 2; [L57] unsigned short int last_1_var_1_26 = 5; [L58] signed long int last_1_var_1_29 = 128; VAL [isInitial=0, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L191] last_1_var_1_17 = var_1_17 [L192] last_1_var_1_20 = var_1_20 [L193] last_1_var_1_23 = var_1_23 [L194] last_1_var_1_26 = var_1_26 [L195] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L205] RET updateLastVariables() [L206] CALL updateVariables() [L147] var_1_11 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L148] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L149] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L149] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L150] var_1_14 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L151] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L152] var_1_16 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_16 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L153] RET assume_abort_if_not(var_1_16 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L154] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L154] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L155] var_1_18 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L156] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L157] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L157] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L158] var_1_19 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L159] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L160] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L160] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L161] var_1_21 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L162] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L163] var_1_22 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L164] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L165] var_1_25 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L166] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L167] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L167] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L168] var_1_27 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L169] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L170] CALL assume_abort_if_not(var_1_27 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L170] RET assume_abort_if_not(var_1_27 <= 255) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L171] var_1_28 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L172] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L173] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L173] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L174] var_1_37 = __VERIFIER_nondet_ulong() [L175] CALL assume_abort_if_not(var_1_37 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L175] RET assume_abort_if_not(var_1_37 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L176] CALL assume_abort_if_not(var_1_37 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L176] RET assume_abort_if_not(var_1_37 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L177] var_1_38 = __VERIFIER_nondet_ulong() [L178] CALL assume_abort_if_not(var_1_38 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L178] RET assume_abort_if_not(var_1_38 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L179] CALL assume_abort_if_not(var_1_38 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L179] RET assume_abort_if_not(var_1_38 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L180] var_1_40 = __VERIFIER_nondet_ulong() [L181] CALL assume_abort_if_not(var_1_40 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L181] RET assume_abort_if_not(var_1_40 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L182] CALL assume_abort_if_not(var_1_40 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L182] RET assume_abort_if_not(var_1_40 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L183] var_1_50 = __VERIFIER_nondet_double() [L184] CALL assume_abort_if_not((var_1_50 >= 0.0F && var_1_50 <= -1.0e-20F) || (var_1_50 <= 9223372.036854765600e+12F && var_1_50 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L184] RET assume_abort_if_not((var_1_50 >= 0.0F && var_1_50 <= -1.0e-20F) || (var_1_50 <= 9223372.036854765600e+12F && var_1_50 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L185] var_1_51 = __VERIFIER_nondet_double() [L186] CALL assume_abort_if_not((var_1_51 >= 0.0F && var_1_51 <= -1.0e-20F) || (var_1_51 <= 9223372.036854765600e+12F && var_1_51 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L186] RET assume_abort_if_not((var_1_51 >= 0.0F && var_1_51 <= -1.0e-20F) || (var_1_51 <= 9223372.036854765600e+12F && var_1_51 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L187] var_1_52 = __VERIFIER_nondet_double() [L188] CALL assume_abort_if_not((var_1_52 >= 0.0F && var_1_52 <= -1.0e-20F) || (var_1_52 <= 9223372.036854765600e+12F && var_1_52 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L188] RET assume_abort_if_not((var_1_52 >= 0.0F && var_1_52 <= -1.0e-20F) || (var_1_52 <= 9223372.036854765600e+12F && var_1_52 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L206] RET updateVariables() [L207] CALL step() [L62] COND FALSE !((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L65] COND TRUE last_1_var_1_17 || last_1_var_1_17 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L66] COND TRUE (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20) [L67] var_1_10 = (var_1_11 + var_1_16) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L75] COND TRUE (last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26 [L76] var_1_23 = var_1_25 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L78] var_1_17 = (var_1_18 && var_1_19) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L79] COND FALSE !(! var_1_18) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L82] COND TRUE 256 >= var_1_10 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=5, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L83] COND FALSE !(var_1_17 && (var_1_25 >= (var_1_27 - var_1_28))) [L86] var_1_26 = var_1_28 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L91] signed long int stepLocal_0 = var_1_23 * var_1_26; VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L92] COND FALSE !(((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) [L99] var_1_1 = -50 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L101] var_1_31 = var_1_26 [L102] var_1_29 = var_1_1 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L103] COND TRUE var_1_18 && var_1_19 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L104] COND FALSE !(var_1_26 <= var_1_29) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=16, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L108] COND TRUE (- var_1_38) <= (- var_1_37) [L109] var_1_39 = (2368197193u - var_1_23) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=2368197192, var_1_40=-2147483649, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L117] var_1_41 = var_1_25 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=2368197192, var_1_40=-2147483649, var_1_41=1, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L118] COND FALSE !(var_1_37 <= ((((var_1_26) > (var_1_25)) ? (var_1_26) : (var_1_25)))) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=2368197192, var_1_40=-2147483649, var_1_41=1, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L121] EXPR var_1_37 ^ var_1_40 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=2368197192, var_1_40=-2147483649, var_1_41=1, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L121] EXPR ((-8) > ((var_1_37 ^ var_1_40))) ? (-8) : ((var_1_37 ^ var_1_40)) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=2368197192, var_1_40=-2147483649, var_1_41=1, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L121] COND TRUE var_1_25 <= ((((-8) > ((var_1_37 ^ var_1_40))) ? (-8) : ((var_1_37 ^ var_1_40)))) [L122] COND TRUE \read(var_1_17) [L123] var_1_44 = ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=2368197192, var_1_40=-2147483649, var_1_41=1, var_1_43=-50, var_1_44=63, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L128] COND TRUE var_1_17 || var_1_19 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=2368197192, var_1_40=-2147483649, var_1_41=1, var_1_43=-50, var_1_44=63, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L129] COND TRUE var_1_11 >= var_1_11 [L130] var_1_47 = var_1_21 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_21=2, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=2368197192, var_1_40=-2147483649, var_1_41=1, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=1281/5, var_1_54=-8] [L143] var_1_53 = 5.5 [L144] var_1_54 = var_1_16 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_21=2, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=2368197192, var_1_40=-2147483649, var_1_41=1, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=11/2, var_1_54=63] [L207] RET step() [L208] CALL, EXPR property() [L198-L199] return ((((((((((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) ? (((var_1_23 * var_1_26) <= (~ var_1_26)) ? (var_1_1 == ((signed short int) (((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))) + var_1_23))) : (var_1_1 == ((signed short int) var_1_10))) : (var_1_1 == ((signed short int) -50))) && (((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) ? (var_1_10 == ((signed char) (var_1_11 + 10))) : ((last_1_var_1_17 || last_1_var_1_17) ? (((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20)) ? (var_1_10 == ((signed char) (var_1_11 + var_1_16))) : (var_1_10 == ((signed char) var_1_11))) : (var_1_10 == ((signed char) var_1_16))))) && (var_1_17 == ((unsigned char) (var_1_18 && var_1_19)))) && ((! var_1_18) ? (var_1_20 == ((double) ((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22))))) : 1)) && (((last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26) ? (var_1_23 == ((unsigned char) var_1_25)) : 1)) && ((256 >= var_1_10) ? ((var_1_17 && (var_1_25 >= (var_1_27 - var_1_28))) ? (var_1_26 == ((unsigned short int) 16)) : (var_1_26 == ((unsigned short int) var_1_28))) : (var_1_26 == ((unsigned short int) var_1_25)))) && (var_1_29 == ((signed long int) var_1_1))) && (var_1_31 == ((unsigned long int) var_1_26)) ; VAL [\result=0, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_21=2, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=2368197192, var_1_40=-2147483649, var_1_41=1, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=11/2, var_1_54=63] [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_21=2, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=2368197192, var_1_40=-2147483649, var_1_41=1, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=11/2, var_1_54=63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=126, var_1_11=63, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_21=2, var_1_23=1, var_1_25=1, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-2147483649, var_1_38=8589934590, var_1_39=2368197192, var_1_40=-2147483649, var_1_41=1, var_1_43=-50, var_1_44=63, var_1_47=2, var_1_53=11/2, var_1_54=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 15, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2051 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2008 mSDsluCounter, 4527 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2440 mSDsCounter, 589 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1010 IncrementalHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 589 mSolverCounterUnsat, 2087 mSDtfsCounter, 1010 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2022 GetRequests, 1968 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=13, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 784 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 3569 NumberOfCodeBlocks, 3569 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3539 ConstructedInterpolants, 0 QuantifiedInterpolants, 7085 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1715 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 25712/26000 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 04:58:48,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.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 81213420de67d7031374276867f37766c379eaf87e05b9017b1369e2411ba1d2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:58:50,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:58:50,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:58:50,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:58:50,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:58:50,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:58:50,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:58:50,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:58:50,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:58:50,409 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:58:50,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:58:50,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:58:50,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:58:50,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:58:50,411 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:58:50,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:58:50,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:58:50,411 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:58:50,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:58:50,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:58:50,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:58:50,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:58:50,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:58:50,415 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:58:50,415 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:58:50,415 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:58:50,415 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:58:50,415 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:58:50,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:58:50,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:58:50,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:58:50,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:58:50,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:58:50,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:58:50,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:58:50,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:58:50,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:58:50,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:58:50,420 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:58:50,420 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:58:50,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:58:50,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:58:50,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:58:50,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:58:50,421 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 -> 81213420de67d7031374276867f37766c379eaf87e05b9017b1369e2411ba1d2 [2024-11-10 04:58:50,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:58:50,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:58:50,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:58:50,740 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:58:50,740 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:58:50,742 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-72.i [2024-11-10 04:58:52,370 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:58:52,569 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:58:52,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.i [2024-11-10 04:58:52,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb09988c7/cf9d4e43f7bc4b7dbfa047620bb05cc3/FLAGd0bb43185 [2024-11-10 04:58:52,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb09988c7/cf9d4e43f7bc4b7dbfa047620bb05cc3 [2024-11-10 04:58:52,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:58:52,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:58:52,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:58:52,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:58:52,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:58:52,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:58:52" (1/1) ... [2024-11-10 04:58:52,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c1dc94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:52, skipping insertion in model container [2024-11-10 04:58:52,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:58:52" (1/1) ... [2024-11-10 04:58:52,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:58:53,201 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-72.i[919,932] [2024-11-10 04:58:53,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:58:53,315 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:58:53,330 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-72.i[919,932] [2024-11-10 04:58:53,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:58:53,401 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:58:53,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:53 WrapperNode [2024-11-10 04:58:53,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:58:53,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:58:53,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:58:53,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:58:53,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:53" (1/1) ... [2024-11-10 04:58:53,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:53" (1/1) ... [2024-11-10 04:58:53,469 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-10 04:58:53,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:58:53,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:58:53,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:58:53,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:58:53,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:53" (1/1) ... [2024-11-10 04:58:53,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:53" (1/1) ... [2024-11-10 04:58:53,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:53" (1/1) ... [2024-11-10 04:58:53,512 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 04:58:53,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:53" (1/1) ... [2024-11-10 04:58:53,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:53" (1/1) ... [2024-11-10 04:58:53,529 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:53" (1/1) ... [2024-11-10 04:58:53,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:53" (1/1) ... [2024-11-10 04:58:53,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:53" (1/1) ... [2024-11-10 04:58:53,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:53" (1/1) ... [2024-11-10 04:58:53,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:58:53,553 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:58:53,553 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:58:53,553 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:58:53,554 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:53" (1/1) ... [2024-11-10 04:58:53,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:58:53,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:58:53,604 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 04:58:53,607 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 04:58:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:58:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:58:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:58:53,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:58:53,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:58:53,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:58:53,753 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:58:53,754 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:59:01,919 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 04:59:01,920 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:59:01,932 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:59:01,933 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:59:01,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:59:01 BoogieIcfgContainer [2024-11-10 04:59:01,934 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:59:01,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:59:01,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:59:01,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:59:01,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:58:52" (1/3) ... [2024-11-10 04:59:01,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a403511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:59:01, skipping insertion in model container [2024-11-10 04:59:01,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:58:53" (2/3) ... [2024-11-10 04:59:01,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a403511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:59:01, skipping insertion in model container [2024-11-10 04:59:01,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:59:01" (3/3) ... [2024-11-10 04:59:01,942 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.i [2024-11-10 04:59:01,960 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:59:01,960 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:59:02,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:59:02,031 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;@3f49ab2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:59:02,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:59:02,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:59:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-10 04:59:02,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:59:02,052 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:59:02,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:59:02,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:59:02,058 INFO L85 PathProgramCache]: Analyzing trace with hash 169701047, now seen corresponding path program 1 times [2024-11-10 04:59:02,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:59:02,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963503997] [2024-11-10 04:59:02,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:59:02,074 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 04:59:02,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:59:02,078 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 04:59:02,080 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 04:59:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:59:02,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:59:02,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:59:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-11-10 04:59:02,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:59:02,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:59:02,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963503997] [2024-11-10 04:59:02,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963503997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:59:02,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:59:02,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:59:02,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192043457] [2024-11-10 04:59:02,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:59:02,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:59:02,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:59:02,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:59:02,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:59:02,700 INFO L87 Difference]: Start difference. First operand has 89 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:59:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:59:02,743 INFO L93 Difference]: Finished difference Result 170 states and 293 transitions. [2024-11-10 04:59:02,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:59:02,746 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2024-11-10 04:59:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:59:02,754 INFO L225 Difference]: With dead ends: 170 [2024-11-10 04:59:02,755 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 04:59:02,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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 04:59:02,762 INFO L432 NwaCegarLoop]: 126 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, 126 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 04:59:02,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:59:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 04:59:02,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 04:59:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:59:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions. [2024-11-10 04:59:02,802 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 126 transitions. Word has length 173 [2024-11-10 04:59:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:59:02,802 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 126 transitions. [2024-11-10 04:59:02,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:59:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2024-11-10 04:59:02,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 04:59:02,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:59:02,808 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:59:02,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 04:59:03,009 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 04:59:03,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:59:03,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:59:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1411808945, now seen corresponding path program 1 times [2024-11-10 04:59:03,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:59:03,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012319974] [2024-11-10 04:59:03,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:59:03,012 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 04:59:03,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:59:03,015 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 04:59:03,019 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 04:59:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:59:03,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 04:59:03,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:59:07,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:59:07,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:59:07,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:59:07,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012319974] [2024-11-10 04:59:07,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012319974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:59:07,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:59:07,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:59:07,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815490094] [2024-11-10 04:59:07,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:59:07,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:59:07,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:59:07,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:59:07,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:59:07,245 INFO L87 Difference]: Start difference. First operand 84 states and 126 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:59:11,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:59:15,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:59:20,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:59:21,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:59:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:59:21,717 INFO L93 Difference]: Finished difference Result 256 states and 386 transitions. [2024-11-10 04:59:21,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:59:21,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-10 04:59:21,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:59:21,767 INFO L225 Difference]: With dead ends: 256 [2024-11-10 04:59:21,767 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 04:59:21,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:59:21,769 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 90 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 53 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:59:21,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 363 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 21 Invalid, 3 Unknown, 0 Unchecked, 14.4s Time] [2024-11-10 04:59:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 04:59:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 134. [2024-11-10 04:59:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 79 states have internal predecessors, (97), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 04:59:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 201 transitions. [2024-11-10 04:59:21,816 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 201 transitions. Word has length 175 [2024-11-10 04:59:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:59:21,820 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 201 transitions. [2024-11-10 04:59:21,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:59:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 201 transitions. [2024-11-10 04:59:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 04:59:21,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:59:21,826 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:59:21,848 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 04:59:22,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:59:22,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:59:22,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:59:22,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1337481418, now seen corresponding path program 1 times [2024-11-10 04:59:22,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:59:22,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467136871] [2024-11-10 04:59:22,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:59:22,030 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 04:59:22,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:59:22,033 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:59:22,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 04:59:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:59:22,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 04:59:22,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:59:24,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:59:24,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:59:24,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:59:24,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467136871] [2024-11-10 04:59:24,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467136871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:59:24,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:59:24,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:59:24,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001552280] [2024-11-10 04:59:24,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:59:24,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:59:24,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:59:24,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:59:24,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:59:24,415 INFO L87 Difference]: Start difference. First operand 134 states and 201 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:59:28,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:59:30,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:59:34,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:59:34,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:59:34,965 INFO L93 Difference]: Finished difference Result 248 states and 373 transitions. [2024-11-10 04:59:35,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:59:35,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-10 04:59:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:59:35,014 INFO L225 Difference]: With dead ends: 248 [2024-11-10 04:59:35,014 INFO L226 Difference]: Without dead ends: 167 [2024-11-10 04:59:35,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:59:35,016 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 77 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-10 04:59:35,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 354 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2024-11-10 04:59:35,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-10 04:59:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 135. [2024-11-10 04:59:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 80 states have (on average 1.225) internal successors, (98), 80 states have internal predecessors, (98), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 04:59:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2024-11-10 04:59:35,045 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 176 [2024-11-10 04:59:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:59:35,048 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2024-11-10 04:59:35,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:59:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2024-11-10 04:59:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 04:59:35,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:59:35,051 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:59:35,075 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 (4)] Ended with exit code 0 [2024-11-10 04:59:35,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:59:35,254 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:59:35,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:59:35,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1106793427, now seen corresponding path program 1 times [2024-11-10 04:59:35,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:59:35,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917833854] [2024-11-10 04:59:35,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:59:35,256 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 04:59:35,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:59:35,260 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 04:59:35,262 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 04:59:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:59:35,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 04:59:35,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:59:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 435 proven. 60 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-10 04:59:37,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:59:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:59:38,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:59:38,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917833854] [2024-11-10 04:59:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917833854] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:59:38,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:59:38,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-10 04:59:38,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081758361] [2024-11-10 04:59:38,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:59:38,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 04:59:38,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:59:38,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 04:59:38,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:59:38,424 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-10 04:59:44,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:59:48,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:59:49,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:59:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:59:49,715 INFO L93 Difference]: Finished difference Result 228 states and 335 transitions. [2024-11-10 04:59:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 04:59:49,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 177 [2024-11-10 04:59:49,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:59:49,718 INFO L225 Difference]: With dead ends: 228 [2024-11-10 04:59:49,718 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 04:59:49,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-10 04:59:49,720 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 102 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:59:49,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 255 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 193 Invalid, 2 Unknown, 0 Unchecked, 11.1s Time] [2024-11-10 04:59:49,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 04:59:49,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2024-11-10 04:59:49,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 86 states have (on average 1.197674418604651) internal successors, (103), 86 states have internal predecessors, (103), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 04:59:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 207 transitions. [2024-11-10 04:59:49,749 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 207 transitions. Word has length 177 [2024-11-10 04:59:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:59:49,750 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 207 transitions. [2024-11-10 04:59:49,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-10 04:59:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 207 transitions. [2024-11-10 04:59:49,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 04:59:49,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:59:49,753 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:59:49,773 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 (5)] Forceful destruction successful, exit code 0 [2024-11-10 04:59:49,953 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 [2024-11-10 04:59:49,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:59:49,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:59:49,954 INFO L85 PathProgramCache]: Analyzing trace with hash 697969202, now seen corresponding path program 1 times [2024-11-10 04:59:49,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:59:49,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849275145] [2024-11-10 04:59:49,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:59:49,955 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 04:59:49,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:59:49,960 INFO L229 MonitoredProcess]: Starting monitored process 6 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 04:59:49,961 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 (6)] Waiting until timeout for monitored process [2024-11-10 04:59:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:59:50,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 04:59:50,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:59:53,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 531 proven. 111 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2024-11-10 04:59:53,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:59:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 114 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2024-11-10 04:59:55,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:59:55,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849275145] [2024-11-10 04:59:55,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849275145] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:59:55,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:59:55,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-10 04:59:55,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506735344] [2024-11-10 04:59:55,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:59:55,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 04:59:55,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:59:55,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 04:59:55,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-10 04:59:55,425 INFO L87 Difference]: Start difference. First operand 143 states and 207 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (46), 3 states have call predecessors, (46), 7 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47)