./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_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-wip.fs.cvc5-61a6796-m [2024-10-14 09:07:51,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:07:51,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:07:51,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:07:51,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:07:51,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:07:51,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:07:51,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:07:51,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:07:51,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:07:51,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:07:51,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:07:51,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:07:51,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:07:51,790 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:07:51,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:07:51,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:07:51,791 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:07:51,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:07:51,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:07:51,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:07:51,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:07:51,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:07:51,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:07:51,794 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:07:51,794 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:07:51,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:07:51,795 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:07:51,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:07:51,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:07:51,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:07:51,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:07:51,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:07:51,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:07:51,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:07:51,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:07:51,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:07:51,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:07:51,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:07:51,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:07:51,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:07:51,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:07:51,800 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-10-14 09:07:52,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:07:52,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:07:52,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:07:52,074 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:07:52,075 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:07:52,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.i [2024-10-14 09:07:53,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:07:53,778 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:07:53,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.i [2024-10-14 09:07:53,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/288f075bb/c33b69aa85d847898b4a626114839504/FLAG245d7584d [2024-10-14 09:07:53,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/288f075bb/c33b69aa85d847898b4a626114839504 [2024-10-14 09:07:53,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:07:53,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:07:53,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:07:53,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:07:53,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:07:53,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:07:53" (1/1) ... [2024-10-14 09:07:53,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40013c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:53, skipping insertion in model container [2024-10-14 09:07:53,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:07:53" (1/1) ... [2024-10-14 09:07:53,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:07:54,001 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.i[919,932] [2024-10-14 09:07:54,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:07:54,088 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:07:54,100 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.i[919,932] [2024-10-14 09:07:54,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:07:54,161 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:07:54,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:54 WrapperNode [2024-10-14 09:07:54,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:07:54,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:07:54,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:07:54,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:07:54,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:54" (1/1) ... [2024-10-14 09:07:54,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:54" (1/1) ... [2024-10-14 09:07:54,237 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 229 [2024-10-14 09:07:54,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:07:54,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:07:54,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:07:54,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:07:54,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:54" (1/1) ... [2024-10-14 09:07:54,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:54" (1/1) ... [2024-10-14 09:07:54,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:54" (1/1) ... [2024-10-14 09:07:54,292 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 09:07:54,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:54" (1/1) ... [2024-10-14 09:07:54,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:54" (1/1) ... [2024-10-14 09:07:54,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:54" (1/1) ... [2024-10-14 09:07:54,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:54" (1/1) ... [2024-10-14 09:07:54,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:54" (1/1) ... [2024-10-14 09:07:54,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:54" (1/1) ... [2024-10-14 09:07:54,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:07:54,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:07:54,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:07:54,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:07:54,338 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:54" (1/1) ... [2024-10-14 09:07:54,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:07:54,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:07:54,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 09:07:54,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 09:07:54,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:07:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:07:54,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:07:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:07:54,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:07:54,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:07:54,523 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:07:54,525 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:07:54,981 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-14 09:07:54,982 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:07:55,035 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:07:55,035 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:07:55,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:07:55 BoogieIcfgContainer [2024-10-14 09:07:55,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:07:55,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:07:55,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:07:55,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:07:55,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:07:53" (1/3) ... [2024-10-14 09:07:55,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412ac499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:07:55, skipping insertion in model container [2024-10-14 09:07:55,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:54" (2/3) ... [2024-10-14 09:07:55,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412ac499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:07:55, skipping insertion in model container [2024-10-14 09:07:55,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:07:55" (3/3) ... [2024-10-14 09:07:55,046 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.i [2024-10-14 09:07:55,066 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:07:55,067 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:07:55,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:07:55,156 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;@78938a54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:07:55,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:07:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 61 states have internal predecessors, (92), 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-10-14 09:07:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-14 09:07:55,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:07:55,178 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] [2024-10-14 09:07:55,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:07:55,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:07:55,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1932308411, now seen corresponding path program 1 times [2024-10-14 09:07:55,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:07:55,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960072593] [2024-10-14 09:07:55,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:07:55,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:07:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:07:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:07:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:07:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:07:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:07:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:07:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:07:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:07:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:07:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:07:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:07:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:07:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:07:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:07:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:07:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:07:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:07:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:07:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:07:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:07:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:07:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:07:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:07:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:07:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:07:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:07:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:07:55,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:07:55,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960072593] [2024-10-14 09:07:55,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960072593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:07:55,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:07:55,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:07:55,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476878364] [2024-10-14 09:07:55,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:07:55,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:07:55,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:07:55,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:07:55,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:07:55,760 INFO L87 Difference]: Start difference. First operand has 89 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 61 states have internal predecessors, (92), 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 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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-10-14 09:07:55,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:07:55,823 INFO L93 Difference]: Finished difference Result 175 states and 312 transitions. [2024-10-14 09:07:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:07:55,827 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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 168 [2024-10-14 09:07:55,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:07:55,836 INFO L225 Difference]: With dead ends: 175 [2024-10-14 09:07:55,836 INFO L226 Difference]: Without dead ends: 87 [2024-10-14 09:07:55,840 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-10-14 09:07:55,844 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:07:55,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:07:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-14 09:07:55,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-14 09:07:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 59 states have internal predecessors, (86), 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-10-14 09:07:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 138 transitions. [2024-10-14 09:07:55,891 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 138 transitions. Word has length 168 [2024-10-14 09:07:55,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:07:55,892 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 138 transitions. [2024-10-14 09:07:55,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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-10-14 09:07:55,894 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 138 transitions. [2024-10-14 09:07:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-14 09:07:55,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:07:55,900 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] [2024-10-14 09:07:55,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:07:55,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:07:55,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:07:55,903 INFO L85 PathProgramCache]: Analyzing trace with hash -595212685, now seen corresponding path program 1 times [2024-10-14 09:07:55,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:07:55,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194909062] [2024-10-14 09:07:55,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:07:55,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:07:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:07:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:07:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:07:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:07:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:07:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:07:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:07:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:07:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:07:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:07:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:07:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:07:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:07:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:07:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:07:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:07:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:07:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:07:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:07:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:07:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:07:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:07:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:07:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:07:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:07:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:07:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:07:56,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:07:56,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194909062] [2024-10-14 09:07:56,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194909062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:07:56,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:07:56,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:07:56,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469918145] [2024-10-14 09:07:56,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:07:56,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:07:56,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:07:56,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:07:56,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:07:56,309 INFO L87 Difference]: Start difference. First operand 87 states and 138 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (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-10-14 09:07:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:07:56,374 INFO L93 Difference]: Finished difference Result 194 states and 302 transitions. [2024-10-14 09:07:56,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:07:56,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (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 168 [2024-10-14 09:07:56,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:07:56,379 INFO L225 Difference]: With dead ends: 194 [2024-10-14 09:07:56,379 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 09:07:56,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-10-14 09:07:56,381 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 29 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:07:56,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 260 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:07:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 09:07:56,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-10-14 09:07:56,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.391304347826087) internal successors, (96), 70 states have internal predecessors, (96), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 09:07:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 162 transitions. [2024-10-14 09:07:56,402 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 162 transitions. Word has length 168 [2024-10-14 09:07:56,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:07:56,404 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 162 transitions. [2024-10-14 09:07:56,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (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-10-14 09:07:56,405 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 162 transitions. [2024-10-14 09:07:56,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-14 09:07:56,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:07:56,410 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] [2024-10-14 09:07:56,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:07:56,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:07:56,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:07:56,412 INFO L85 PathProgramCache]: Analyzing trace with hash -602839181, now seen corresponding path program 1 times [2024-10-14 09:07:56,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:07:56,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850654786] [2024-10-14 09:07:56,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:07:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:07:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:07:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:07:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:07:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:07:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:07:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:07:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:07:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:07:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:07:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:07:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:07:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:07:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:07:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:07:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:07:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:07:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:07:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:07:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:07:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:07:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:07:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:07:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:07:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:07:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:07:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:07:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:07:56,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:07:56,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850654786] [2024-10-14 09:07:56,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850654786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:07:56,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:07:56,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:07:56,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556859859] [2024-10-14 09:07:56,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:07:56,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:07:56,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:07:56,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:07:56,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:07:56,985 INFO L87 Difference]: Start difference. First operand 105 states and 162 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (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-10-14 09:07:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:07:57,067 INFO L93 Difference]: Finished difference Result 250 states and 387 transitions. [2024-10-14 09:07:57,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:07:57,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (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 168 [2024-10-14 09:07:57,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:07:57,079 INFO L225 Difference]: With dead ends: 250 [2024-10-14 09:07:57,079 INFO L226 Difference]: Without dead ends: 146 [2024-10-14 09:07:57,080 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-10-14 09:07:57,081 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 54 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:07:57,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 253 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:07:57,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-14 09:07:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 109. [2024-10-14 09:07:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 74 states have internal predecessors, (102), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 09:07:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 168 transitions. [2024-10-14 09:07:57,113 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 168 transitions. Word has length 168 [2024-10-14 09:07:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:07:57,116 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 168 transitions. [2024-10-14 09:07:57,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (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-10-14 09:07:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 168 transitions. [2024-10-14 09:07:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 09:07:57,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:07:57,119 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] [2024-10-14 09:07:57,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 09:07:57,123 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:07:57,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:07:57,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1644567361, now seen corresponding path program 1 times [2024-10-14 09:07:57,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:07:57,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86816394] [2024-10-14 09:07:57,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:07:57,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:07:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:07:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:07:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:07:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:07:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:07:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:07:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:07:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:07:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:07:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:07:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:07:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:07:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:07:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:07:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:07:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:07:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:07:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:07:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:07:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:07:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:07:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:07:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:07:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:07:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:07:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:07:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:07:57,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:07:57,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86816394] [2024-10-14 09:07:57,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86816394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:07:57,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:07:57,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:07:57,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564955678] [2024-10-14 09:07:57,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:07:57,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:07:57,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:07:57,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:07:57,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:07:57,670 INFO L87 Difference]: Start difference. First operand 109 states and 168 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-14 09:07:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:07:57,916 INFO L93 Difference]: Finished difference Result 316 states and 486 transitions. [2024-10-14 09:07:57,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:07:57,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 169 [2024-10-14 09:07:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:07:57,920 INFO L225 Difference]: With dead ends: 316 [2024-10-14 09:07:57,921 INFO L226 Difference]: Without dead ends: 208 [2024-10-14 09:07:57,922 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-10-14 09:07:57,925 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 96 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:07:57,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 384 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:07:57,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-14 09:07:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 165. [2024-10-14 09:07:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 101 states have (on average 1.316831683168317) internal successors, (133), 102 states have internal predecessors, (133), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-14 09:07:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2024-10-14 09:07:57,971 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 169 [2024-10-14 09:07:57,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:07:57,971 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2024-10-14 09:07:57,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-14 09:07:57,972 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2024-10-14 09:07:57,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 09:07:57,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:07:57,974 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] [2024-10-14 09:07:57,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:07:57,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:07:57,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:07:57,975 INFO L85 PathProgramCache]: Analyzing trace with hash -826918911, now seen corresponding path program 1 times [2024-10-14 09:07:57,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:07:57,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510813818] [2024-10-14 09:07:57,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:07:57,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:07:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:07:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:07:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:07:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:07:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:07:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:07:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:07:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:07:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:07:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:07:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:07:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:07:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:07:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:07:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:07:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:07:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:07:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:07:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:07:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:07:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:07:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:07:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:07:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:07:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:07:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:07:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:07:58,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:07:58,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510813818] [2024-10-14 09:07:58,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510813818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:07:58,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:07:58,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:07:58,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000557063] [2024-10-14 09:07:58,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:07:58,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:07:58,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:07:58,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:07:58,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:07:58,238 INFO L87 Difference]: Start difference. First operand 165 states and 251 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-14 09:07:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:07:58,294 INFO L93 Difference]: Finished difference Result 274 states and 420 transitions. [2024-10-14 09:07:58,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:07:58,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 169 [2024-10-14 09:07:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:07:58,297 INFO L225 Difference]: With dead ends: 274 [2024-10-14 09:07:58,297 INFO L226 Difference]: Without dead ends: 166 [2024-10-14 09:07:58,297 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-10-14 09:07:58,298 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 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-10-14 09:07:58,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:07:58,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-14 09:07:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-14 09:07:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 103 states have internal predecessors, (134), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-14 09:07:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 252 transitions. [2024-10-14 09:07:58,331 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 252 transitions. Word has length 169 [2024-10-14 09:07:58,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:07:58,332 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 252 transitions. [2024-10-14 09:07:58,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-14 09:07:58,332 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 252 transitions. [2024-10-14 09:07:58,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-14 09:07:58,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:07:58,333 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] [2024-10-14 09:07:58,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 09:07:58,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:07:58,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:07:58,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1419026842, now seen corresponding path program 1 times [2024-10-14 09:07:58,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:07:58,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997890376] [2024-10-14 09:07:58,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:07:58,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:07:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:07:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:07:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:07:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:07:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:07:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:07:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:07:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:07:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:07:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:07:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:07:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:07:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:07:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:07:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:07:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:07:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:07:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:07:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:07:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:07:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:07:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:07:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:07:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:07:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:07:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:07:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-14 09:07:58,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:07:58,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997890376] [2024-10-14 09:07:58,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997890376] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:07:58,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402526445] [2024-10-14 09:07:58,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:07:58,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:07:58,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:07:58,744 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-10-14 09:07:58,745 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-10-14 09:07:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:58,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:07:58,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:07:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 435 proven. 60 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-14 09:07:59,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:07:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-14 09:07:59,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402526445] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:07:59,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:07:59,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-14 09:07:59,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639794677] [2024-10-14 09:07:59,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:07:59,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:07:59,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:07:59,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:07:59,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:07:59,523 INFO L87 Difference]: Start difference. First operand 166 states and 252 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-10-14 09:07:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:07:59,788 INFO L93 Difference]: Finished difference Result 291 states and 433 transitions. [2024-10-14 09:07:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 09:07:59,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 170 [2024-10-14 09:07:59,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:07:59,793 INFO L225 Difference]: With dead ends: 291 [2024-10-14 09:07:59,793 INFO L226 Difference]: Without dead ends: 182 [2024-10-14 09:07:59,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 387 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-14 09:07:59,797 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 132 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:07:59,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 265 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:07:59,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-14 09:07:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2024-10-14 09:07:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 112 states have internal predecessors, (141), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-14 09:07:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2024-10-14 09:07:59,833 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 170 [2024-10-14 09:07:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:07:59,834 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2024-10-14 09:07:59,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-10-14 09:07:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2024-10-14 09:07:59,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-14 09:07:59,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:07:59,836 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] [2024-10-14 09:07:59,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 09:08:00,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 09:08:00,037 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:00,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:00,037 INFO L85 PathProgramCache]: Analyzing trace with hash -269916900, now seen corresponding path program 1 times [2024-10-14 09:08:00,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:08:00,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446605502] [2024-10-14 09:08:00,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:00,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:08:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:08:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:08:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:08:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:08:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:08:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:08:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:08:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:08:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:08:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:08:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:08:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:08:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:08:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:08:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:08:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:08:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:08:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:08:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:08:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:08:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:08:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:08:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:08:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:08:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:08:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:08:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:08:00,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:08:00,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446605502] [2024-10-14 09:08:00,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446605502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:08:00,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:08:00,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:08:00,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665977606] [2024-10-14 09:08:00,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:08:00,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:08:00,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:08:00,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:08:00,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:08:00,245 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-10-14 09:08:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:08:00,429 INFO L93 Difference]: Finished difference Result 370 states and 531 transitions. [2024-10-14 09:08:00,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 09:08:00,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 170 [2024-10-14 09:08:00,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:08:00,432 INFO L225 Difference]: With dead ends: 370 [2024-10-14 09:08:00,432 INFO L226 Difference]: Without dead ends: 253 [2024-10-14 09:08:00,433 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-10-14 09:08:00,433 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 200 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:08:00,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 506 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:08:00,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-14 09:08:00,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 221. [2024-10-14 09:08:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 153 states have internal predecessors, (204), 59 states have call successors, (59), 9 states have call predecessors, (59), 9 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-14 09:08:00,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 322 transitions. [2024-10-14 09:08:00,462 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 322 transitions. Word has length 170 [2024-10-14 09:08:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:08:00,463 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 322 transitions. [2024-10-14 09:08:00,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-10-14 09:08:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 322 transitions. [2024-10-14 09:08:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-14 09:08:00,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:00,465 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] [2024-10-14 09:08:00,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 09:08:00,465 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:00,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash -327175202, now seen corresponding path program 1 times [2024-10-14 09:08:00,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:08:00,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029438101] [2024-10-14 09:08:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:08:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:08:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:08:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:08:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:08:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:08:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:08:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:08:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:08:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:08:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:08:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:08:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:08:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:08:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:08:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:08:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:08:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:08:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:08:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:08:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:08:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:08:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:08:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:08:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:08:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:08:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:08:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:08:00,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:08:00,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029438101] [2024-10-14 09:08:00,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029438101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:08:00,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:08:00,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:08:00,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967169881] [2024-10-14 09:08:00,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:08:00,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:08:00,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:08:00,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:08:00,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:08:00,966 INFO L87 Difference]: Start difference. First operand 221 states and 322 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-10-14 09:08:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:08:01,113 INFO L93 Difference]: Finished difference Result 388 states and 562 transitions. [2024-10-14 09:08:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:08:01,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 170 [2024-10-14 09:08:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:08:01,116 INFO L225 Difference]: With dead ends: 388 [2024-10-14 09:08:01,116 INFO L226 Difference]: Without dead ends: 228 [2024-10-14 09:08:01,117 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-10-14 09:08:01,120 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 143 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:08:01,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 362 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:08:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-14 09:08:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 195. [2024-10-14 09:08:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 135 states have (on average 1.3555555555555556) internal successors, (183), 135 states have internal predecessors, (183), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:08:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 287 transitions. [2024-10-14 09:08:01,154 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 287 transitions. Word has length 170 [2024-10-14 09:08:01,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:08:01,154 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 287 transitions. [2024-10-14 09:08:01,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-10-14 09:08:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 287 transitions. [2024-10-14 09:08:01,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 09:08:01,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:01,158 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] [2024-10-14 09:08:01,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 09:08:01,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:01,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:01,159 INFO L85 PathProgramCache]: Analyzing trace with hash 866328276, now seen corresponding path program 1 times [2024-10-14 09:08:01,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:08:01,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459533934] [2024-10-14 09:08:01,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:01,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:08:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:08:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:08:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:08:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:08:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:08:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:08:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:08:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:08:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:08:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:08:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:08:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:08:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:08:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:08:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:08:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:08:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:08:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:08:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:08:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:08:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:08:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:08:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:08:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:08:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:08:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:08:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:08:01,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:08:01,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459533934] [2024-10-14 09:08:01,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459533934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:08:01,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:08:01,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:08:01,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513615827] [2024-10-14 09:08:01,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:08:01,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:08:01,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:08:01,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:08:01,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:08:01,347 INFO L87 Difference]: Start difference. First operand 195 states and 287 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-10-14 09:08:01,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:08:01,560 INFO L93 Difference]: Finished difference Result 460 states and 682 transitions. [2024-10-14 09:08:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:08:01,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 171 [2024-10-14 09:08:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:08:01,563 INFO L225 Difference]: With dead ends: 460 [2024-10-14 09:08:01,564 INFO L226 Difference]: Without dead ends: 326 [2024-10-14 09:08:01,564 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-10-14 09:08:01,566 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 146 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:08:01,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 456 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:08:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-14 09:08:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 198. [2024-10-14 09:08:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 138 states have (on average 1.355072463768116) internal successors, (187), 138 states have internal predecessors, (187), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:08:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 291 transitions. [2024-10-14 09:08:01,606 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 291 transitions. Word has length 171 [2024-10-14 09:08:01,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:08:01,608 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 291 transitions. [2024-10-14 09:08:01,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-10-14 09:08:01,608 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 291 transitions. [2024-10-14 09:08:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 09:08:01,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:01,610 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] [2024-10-14 09:08:01,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 09:08:01,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:01,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:01,610 INFO L85 PathProgramCache]: Analyzing trace with hash 279522262, now seen corresponding path program 1 times [2024-10-14 09:08:01,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:08:01,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198134397] [2024-10-14 09:08:01,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:01,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:08:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:01,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:08:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:08:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:08:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:08:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:08:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:08:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:08:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:08:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:08:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:08:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:08:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:08:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:08:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:08:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:08:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:08:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:08:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:08:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:08:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:08:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:08:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:08:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:08:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:08:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:08:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:08:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:08:02,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:08:02,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198134397] [2024-10-14 09:08:02,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198134397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:08:02,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:08:02,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:08:02,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782188169] [2024-10-14 09:08:02,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:08:02,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:08:02,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:08:02,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:08:02,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:08:02,047 INFO L87 Difference]: Start difference. First operand 198 states and 291 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-10-14 09:08:02,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:08:02,173 INFO L93 Difference]: Finished difference Result 361 states and 530 transitions. [2024-10-14 09:08:02,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:08:02,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 171 [2024-10-14 09:08:02,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:08:02,176 INFO L225 Difference]: With dead ends: 361 [2024-10-14 09:08:02,176 INFO L226 Difference]: Without dead ends: 224 [2024-10-14 09:08:02,177 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-10-14 09:08:02,177 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 106 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:08:02,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 429 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:08:02,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-14 09:08:02,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 206. [2024-10-14 09:08:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 146 states have (on average 1.3356164383561644) internal successors, (195), 146 states have internal predecessors, (195), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:08:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 299 transitions. [2024-10-14 09:08:02,211 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 299 transitions. Word has length 171 [2024-10-14 09:08:02,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:08:02,212 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 299 transitions. [2024-10-14 09:08:02,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-10-14 09:08:02,212 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 299 transitions. [2024-10-14 09:08:02,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 09:08:02,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:02,214 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] [2024-10-14 09:08:02,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 09:08:02,214 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:02,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:02,215 INFO L85 PathProgramCache]: Analyzing trace with hash 222263960, now seen corresponding path program 1 times [2024-10-14 09:08:02,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:08:02,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721467250] [2024-10-14 09:08:02,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:02,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:08:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:08:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:08:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:08:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:08:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:08:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:08:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:08:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:08:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:08:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:08:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:08:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:08:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:08:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:08:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:08:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:08:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:08:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:08:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:08:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:08:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:08:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:08:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:08:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:08:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:08:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:08:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 51 proven. 24 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-14 09:08:02,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:08:02,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721467250] [2024-10-14 09:08:02,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721467250] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:08:02,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209659834] [2024-10-14 09:08:02,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:02,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:08:02,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:08:02,552 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-10-14 09:08:02,553 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-10-14 09:08:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:02,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:08:02,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:08:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 603 proven. 24 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2024-10-14 09:08:02,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:08:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 51 proven. 24 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-14 09:08:03,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209659834] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:08:03,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:08:03,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-14 09:08:03,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015776012] [2024-10-14 09:08:03,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:08:03,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 09:08:03,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:08:03,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 09:08:03,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:08:03,067 INFO L87 Difference]: Start difference. First operand 206 states and 299 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-10-14 09:08:03,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:08:03,353 INFO L93 Difference]: Finished difference Result 363 states and 521 transitions. [2024-10-14 09:08:03,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 09:08:03,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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 171 [2024-10-14 09:08:03,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:08:03,356 INFO L225 Difference]: With dead ends: 363 [2024-10-14 09:08:03,356 INFO L226 Difference]: Without dead ends: 218 [2024-10-14 09:08:03,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 389 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-14 09:08:03,357 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 189 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:08:03,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 208 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:08:03,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-14 09:08:03,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2024-10-14 09:08:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 152 states have (on average 1.263157894736842) internal successors, (192), 152 states have internal predecessors, (192), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:08:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 296 transitions. [2024-10-14 09:08:03,406 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 296 transitions. Word has length 171 [2024-10-14 09:08:03,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:08:03,408 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 296 transitions. [2024-10-14 09:08:03,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-10-14 09:08:03,408 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 296 transitions. [2024-10-14 09:08:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 09:08:03,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:03,410 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] [2024-10-14 09:08:03,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 09:08:03,610 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,SelfDestructingSolverStorable10 [2024-10-14 09:08:03,611 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:03,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:03,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1314129846, now seen corresponding path program 1 times [2024-10-14 09:08:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:08:03,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578034827] [2024-10-14 09:08:03,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:03,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:08:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:08:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:08:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:08:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:08:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:08:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:08:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:08:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:08:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:08:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:08:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:08:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:08:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:08:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:08:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:08:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:08:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:08:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:08:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:08:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:08:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:08:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:08:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:08:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:08:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:08:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:08:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-14 09:08:03,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:08:03,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578034827] [2024-10-14 09:08:03,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578034827] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:08:03,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563432162] [2024-10-14 09:08:03,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:03,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:08:03,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:08:03,941 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-10-14 09:08:03,943 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-10-14 09:08:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:04,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:08:04,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:08:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 403 proven. 12 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2024-10-14 09:08:04,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:08:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-14 09:08:04,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563432162] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:08:04,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:08:04,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-14 09:08:04,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416036320] [2024-10-14 09:08:04,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:08:04,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 09:08:04,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:08:04,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 09:08:04,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:08:04,363 INFO L87 Difference]: Start difference. First operand 214 states and 296 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-10-14 09:08:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:08:04,625 INFO L93 Difference]: Finished difference Result 375 states and 512 transitions. [2024-10-14 09:08:04,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 09:08:04,626 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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 172 [2024-10-14 09:08:04,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:08:04,628 INFO L225 Difference]: With dead ends: 375 [2024-10-14 09:08:04,628 INFO L226 Difference]: Without dead ends: 226 [2024-10-14 09:08:04,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 391 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-14 09:08:04,630 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 132 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:08:04,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 220 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:08:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-14 09:08:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 222. [2024-10-14 09:08:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 158 states have (on average 1.2151898734177216) internal successors, (192), 158 states have internal predecessors, (192), 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-10-14 09:08:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 296 transitions. [2024-10-14 09:08:04,690 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 296 transitions. Word has length 172 [2024-10-14 09:08:04,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:08:04,690 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 296 transitions. [2024-10-14 09:08:04,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-10-14 09:08:04,691 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 296 transitions. [2024-10-14 09:08:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-14 09:08:04,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:04,693 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-10-14 09:08:04,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 09:08:04,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:08:04,894 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:04,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:04,894 INFO L85 PathProgramCache]: Analyzing trace with hash -346168357, now seen corresponding path program 1 times [2024-10-14 09:08:04,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:08:04,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951012614] [2024-10-14 09:08:04,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:04,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:08:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:08:04,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1871787252] [2024-10-14 09:08:04,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:04,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:08:04,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:08:04,962 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-10-14 09:08:04,963 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-10-14 09:08:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:05,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 09:08:05,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:08:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:08:05,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:08:05,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:08:05,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951012614] [2024-10-14 09:08:05,762 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 09:08:05,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871787252] [2024-10-14 09:08:05,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871787252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:08:05,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:08:05,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:08:05,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146064752] [2024-10-14 09:08:05,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:08:05,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:08:05,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:08:05,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:08:05,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:08:05,764 INFO L87 Difference]: Start difference. First operand 222 states and 296 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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-10-14 09:08:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:08:05,944 INFO L93 Difference]: Finished difference Result 454 states and 603 transitions. [2024-10-14 09:08:05,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:08:05,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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 173 [2024-10-14 09:08:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:08:05,947 INFO L225 Difference]: With dead ends: 454 [2024-10-14 09:08:05,947 INFO L226 Difference]: Without dead ends: 300 [2024-10-14 09:08:05,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:08:05,949 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 81 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:08:05,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 371 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:08:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-14 09:08:06,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 221. [2024-10-14 09:08:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 157 states have (on average 1.2101910828025477) internal successors, (190), 157 states have internal predecessors, (190), 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-10-14 09:08:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 294 transitions. [2024-10-14 09:08:06,020 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 294 transitions. Word has length 173 [2024-10-14 09:08:06,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:08:06,020 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 294 transitions. [2024-10-14 09:08:06,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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-10-14 09:08:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 294 transitions. [2024-10-14 09:08:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-14 09:08:06,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:06,022 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-10-14 09:08:06,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 09:08:06,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:08:06,223 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:06,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1093212837, now seen corresponding path program 1 times [2024-10-14 09:08:06,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:08:06,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398882661] [2024-10-14 09:08:06,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:06,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:08:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:08:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:08:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:08:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:08:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:08:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:08:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:08:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:08:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:08:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:08:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:08:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:08:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:08:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:08:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:08:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:08:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:08:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:08:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:08:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:08:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:08:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:08:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:08:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:08:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:08:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:08:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:08:06,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:08:06,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398882661] [2024-10-14 09:08:06,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398882661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:08:06,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:08:06,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:08:06,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307529717] [2024-10-14 09:08:06,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:08:06,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:08:06,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:08:06,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:08:06,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:08:06,379 INFO L87 Difference]: Start difference. First operand 221 states and 294 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-10-14 09:08:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:08:06,584 INFO L93 Difference]: Finished difference Result 524 states and 696 transitions. [2024-10-14 09:08:06,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:08:06,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 173 [2024-10-14 09:08:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:08:06,587 INFO L225 Difference]: With dead ends: 524 [2024-10-14 09:08:06,587 INFO L226 Difference]: Without dead ends: 371 [2024-10-14 09:08:06,588 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-10-14 09:08:06,589 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 177 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:08:06,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 281 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:08:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-14 09:08:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 222. [2024-10-14 09:08:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 158 states have (on average 1.2088607594936709) internal successors, (191), 158 states have internal predecessors, (191), 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-10-14 09:08:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 295 transitions. [2024-10-14 09:08:06,639 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 295 transitions. Word has length 173 [2024-10-14 09:08:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:08:06,639 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 295 transitions. [2024-10-14 09:08:06,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-10-14 09:08:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 295 transitions. [2024-10-14 09:08:06,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-14 09:08:06,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:06,642 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] [2024-10-14 09:08:06,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 09:08:06,642 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:06,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1306617752, now seen corresponding path program 1 times [2024-10-14 09:08:06,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:08:06,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583179201] [2024-10-14 09:08:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:08:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:08:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:08:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:08:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:08:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:08:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:08:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:08:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:08:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:08:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:08:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:08:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:08:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:08:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:08:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:08:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:08:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:08:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:08:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:08:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:08:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:08:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:08:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:08:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:08:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:08:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:08:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:08:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:08:06,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583179201] [2024-10-14 09:08:06,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583179201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:08:06,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:08:06,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:08:06,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795324233] [2024-10-14 09:08:06,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:08:06,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:08:06,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:08:06,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:08:06,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:08:06,835 INFO L87 Difference]: Start difference. First operand 222 states and 295 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10-14 09:08:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:08:07,029 INFO L93 Difference]: Finished difference Result 525 states and 696 transitions. [2024-10-14 09:08:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:08:07,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 174 [2024-10-14 09:08:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:08:07,032 INFO L225 Difference]: With dead ends: 525 [2024-10-14 09:08:07,032 INFO L226 Difference]: Without dead ends: 372 [2024-10-14 09:08:07,034 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-10-14 09:08:07,034 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 161 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:08:07,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 281 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:08:07,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-14 09:08:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 217. [2024-10-14 09:08:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 153 states have (on average 1.2026143790849673) internal successors, (184), 153 states have internal predecessors, (184), 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-10-14 09:08:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2024-10-14 09:08:07,092 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 174 [2024-10-14 09:08:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:08:07,092 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2024-10-14 09:08:07,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10-14 09:08:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2024-10-14 09:08:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-14 09:08:07,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:07,094 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] [2024-10-14 09:08:07,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 09:08:07,094 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:07,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash -57850481, now seen corresponding path program 1 times [2024-10-14 09:08:07,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:08:07,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885978045] [2024-10-14 09:08:07,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:07,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:08:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:08:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:08:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:08:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:08:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:08:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:08:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:08:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:08:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:08:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:08:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:08:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:08:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:08:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:08:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:08:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 09:08:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:08:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 09:08:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:08:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:08:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:08:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 09:08:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 09:08:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 09:08:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 09:08:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 09:08:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:07,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:08:07,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:08:07,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885978045] [2024-10-14 09:08:07,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885978045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:08:07,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:08:07,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:08:07,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139350603] [2024-10-14 09:08:07,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:08:07,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:08:07,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:08:07,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:08:07,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:08:07,371 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10-14 09:08:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:08:07,577 INFO L93 Difference]: Finished difference Result 446 states and 589 transitions. [2024-10-14 09:08:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:08:07,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 174 [2024-10-14 09:08:07,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:08:07,581 INFO L225 Difference]: With dead ends: 446 [2024-10-14 09:08:07,581 INFO L226 Difference]: Without dead ends: 296 [2024-10-14 09:08:07,582 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-10-14 09:08:07,582 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 81 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:08:07,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 369 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:08:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-14 09:08:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 217. [2024-10-14 09:08:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 153 states have (on average 1.196078431372549) internal successors, (183), 153 states have internal predecessors, (183), 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-10-14 09:08:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 287 transitions. [2024-10-14 09:08:07,654 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 287 transitions. Word has length 174 [2024-10-14 09:08:07,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:08:07,655 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 287 transitions. [2024-10-14 09:08:07,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10-14 09:08:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 287 transitions. [2024-10-14 09:08:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 09:08:07,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:07,658 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-10-14 09:08:07,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 09:08:07,658 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:07,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1775983136, now seen corresponding path program 1 times [2024-10-14 09:08:07,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:08:07,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629863229] [2024-10-14 09:08:07,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:07,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:08:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:08:07,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1438295466] [2024-10-14 09:08:07,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:07,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:08:07,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:08:07,748 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-10-14 09:08:07,752 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-10-14 09:08:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:08:07,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 09:08:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:08:08,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 09:08:08,099 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 09:08:08,100 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 09:08:08,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 09:08:08,302 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,SelfDestructingSolverStorable16 [2024-10-14 09:08:08,306 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:08:08,439 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 09:08:08,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:08:08 BoogieIcfgContainer [2024-10-14 09:08:08,442 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 09:08:08,442 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 09:08:08,442 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 09:08:08,443 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 09:08:08,443 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:07:55" (3/4) ... [2024-10-14 09:08:08,445 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 09:08:08,446 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 09:08:08,446 INFO L158 Benchmark]: Toolchain (without parser) took 14636.67ms. Allocated memory was 163.6MB in the beginning and 388.0MB in the end (delta: 224.4MB). Free memory was 106.9MB in the beginning and 218.4MB in the end (delta: -111.4MB). Peak memory consumption was 114.9MB. Max. memory is 16.1GB. [2024-10-14 09:08:08,447 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 163.6MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:08:08,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.76ms. Allocated memory is still 163.6MB. Free memory was 106.9MB in the beginning and 91.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 09:08:08,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.90ms. Allocated memory is still 163.6MB. Free memory was 91.0MB in the beginning and 87.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 09:08:08,447 INFO L158 Benchmark]: Boogie Preprocessor took 89.23ms. Allocated memory is still 163.6MB. Free memory was 87.4MB in the beginning and 83.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 09:08:08,448 INFO L158 Benchmark]: RCFGBuilder took 699.57ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 83.2MB in the beginning and 180.2MB in the end (delta: -97.0MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-10-14 09:08:08,448 INFO L158 Benchmark]: TraceAbstraction took 13403.76ms. Allocated memory was 222.3MB in the beginning and 388.0MB in the end (delta: 165.7MB). Free memory was 179.2MB in the beginning and 218.4MB in the end (delta: -39.2MB). Peak memory consumption was 126.5MB. Max. memory is 16.1GB. [2024-10-14 09:08:08,448 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 388.0MB. Free memory is still 218.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:08:08,449 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 163.6MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.76ms. Allocated memory is still 163.6MB. Free memory was 106.9MB in the beginning and 91.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.90ms. Allocated memory is still 163.6MB. Free memory was 91.0MB in the beginning and 87.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.23ms. Allocated memory is still 163.6MB. Free memory was 87.4MB in the beginning and 83.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 699.57ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 83.2MB in the beginning and 180.2MB in the end (delta: -97.0MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13403.76ms. Allocated memory was 222.3MB in the beginning and 388.0MB in the end (delta: 165.7MB). Free memory was 179.2MB in the beginning and 218.4MB in the end (delta: -39.2MB). Peak memory consumption was 126.5MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 388.0MB. Free memory is still 218.4MB. 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; [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 [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=255, 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=1, 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=255, 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=1, 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=255, 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=1, 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=255, 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=1, 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=255, 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=1, 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=255, 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=1, 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=255, 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=1, 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=255, 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=1, 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=255, 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=1, 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=255, var_1_28=256, 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=1, 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=255, var_1_28=256, 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=1, 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=255, var_1_28=256, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=16, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=2368197192, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=2368197192, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=2368197192, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=2368197192, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=2368197192, var_1_40=4294967294, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=2368197192, var_1_40=4294967294, 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] [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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=2368197192, var_1_40=4294967294, 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] [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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=2368197192, var_1_40=4294967294, var_1_41=1, var_1_43=-50, var_1_44=1, 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 [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)) ; [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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=2368197192, var_1_40=4294967294, var_1_41=1, var_1_43=-50, var_1_44=1, 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=64, var_1_11=1, 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=255, var_1_28=256, var_1_29=-50, var_1_31=0, var_1_32=64, var_1_37=-4294967298, var_1_38=-2, var_1_39=2368197192, var_1_40=4294967294, var_1_41=1, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 17, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1770 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1727 mSDsluCounter, 5030 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2753 mSDsCounter, 656 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 985 IncrementalHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 656 mSolverCounterUnsat, 2277 mSDtfsCounter, 985 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2087 GetRequests, 2025 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=12, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 768 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 3767 NumberOfCodeBlocks, 3767 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3735 ConstructedInterpolants, 0 QuantifiedInterpolants, 9583 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1671 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 28312/28600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 09:08:08,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_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-wip.fs.cvc5-61a6796-m [2024-10-14 09:08:10,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:08:10,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 09:08:10,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:08:10,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:08:10,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:08:10,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:08:10,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:08:10,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:08:10,949 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:08:10,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:08:10,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:08:10,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:08:10,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:08:10,952 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:08:10,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:08:10,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:08:10,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:08:10,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:08:10,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:08:10,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:08:10,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:08:10,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:08:10,958 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 09:08:10,958 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 09:08:10,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:08:10,958 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 09:08:10,959 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:08:10,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:08:10,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:08:10,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:08:10,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:08:10,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:08:10,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:08:10,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:08:10,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:08:10,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:08:10,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:08:10,962 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 09:08:10,962 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 09:08:10,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:08:10,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:08:10,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:08:10,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:08:10,964 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 09:08:10,964 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-10-14 09:08:11,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:08:11,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:08:11,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:08:11,330 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:08:11,330 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:08:11,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.i [2024-10-14 09:08:12,954 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:08:13,203 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:08:13,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.i [2024-10-14 09:08:13,213 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8a43d5a/4d2b5d2f0422408b929517f31c269353/FLAGdefb01351 [2024-10-14 09:08:13,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8a43d5a/4d2b5d2f0422408b929517f31c269353 [2024-10-14 09:08:13,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:08:13,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:08:13,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:08:13,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:08:13,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:08:13,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:08:13" (1/1) ... [2024-10-14 09:08:13,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e86776e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:13, skipping insertion in model container [2024-10-14 09:08:13,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:08:13" (1/1) ... [2024-10-14 09:08:13,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:08:13,456 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.i[919,932] [2024-10-14 09:08:13,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:08:13,568 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:08:13,584 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.i[919,932] [2024-10-14 09:08:13,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:08:13,659 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:08:13,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:13 WrapperNode [2024-10-14 09:08:13,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:08:13,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:08:13,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:08:13,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:08:13,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:13" (1/1) ... [2024-10-14 09:08:13,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:13" (1/1) ... [2024-10-14 09:08:13,733 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-10-14 09:08:13,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:08:13,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:08:13,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:08:13,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:08:13,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:13" (1/1) ... [2024-10-14 09:08:13,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:13" (1/1) ... [2024-10-14 09:08:13,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:13" (1/1) ... [2024-10-14 09:08:13,778 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 09:08:13,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:13" (1/1) ... [2024-10-14 09:08:13,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:13" (1/1) ... [2024-10-14 09:08:13,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:13" (1/1) ... [2024-10-14 09:08:13,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:13" (1/1) ... [2024-10-14 09:08:13,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:13" (1/1) ... [2024-10-14 09:08:13,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:13" (1/1) ... [2024-10-14 09:08:13,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:08:13,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:08:13,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:08:13,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:08:13,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:13" (1/1) ... [2024-10-14 09:08:13,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:08:13,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:08:13,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 09:08:13,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 09:08:13,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:08:13,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 09:08:13,889 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:08:13,890 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:08:13,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:08:13,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:08:13,968 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:08:13,969 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:08:21,815 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 09:08:21,815 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:08:21,899 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:08:21,902 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:08:21,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:08:21 BoogieIcfgContainer [2024-10-14 09:08:21,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:08:21,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:08:21,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:08:21,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:08:21,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:08:13" (1/3) ... [2024-10-14 09:08:21,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483dc8f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:08:21, skipping insertion in model container [2024-10-14 09:08:21,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:13" (2/3) ... [2024-10-14 09:08:21,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483dc8f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:08:21, skipping insertion in model container [2024-10-14 09:08:21,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:08:21" (3/3) ... [2024-10-14 09:08:21,913 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-72.i [2024-10-14 09:08:21,930 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:08:21,931 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:08:22,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:08:22,024 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;@7299468c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:08:22,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:08:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 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-10-14 09:08:22,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 09:08:22,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:22,046 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] [2024-10-14 09:08:22,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:22,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:22,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1600937426, now seen corresponding path program 1 times [2024-10-14 09:08:22,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:08:22,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530740608] [2024-10-14 09:08:22,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:22,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:08:22,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:08:22,066 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:08:22,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 09:08:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:22,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 09:08:22,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:08:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-10-14 09:08:22,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:08:22,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:08:22,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530740608] [2024-10-14 09:08:22,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530740608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:08:22,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:08:22,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:08:22,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826315169] [2024-10-14 09:08:22,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:08:22,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:08:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:08:22,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:08:22,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:08:22,681 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-10-14 09:08:26,859 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-10-14 09:08:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:08:26,860 INFO L93 Difference]: Finished difference Result 155 states and 278 transitions. [2024-10-14 09:08:26,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:08:26,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 166 [2024-10-14 09:08:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:08:26,913 INFO L225 Difference]: With dead ends: 155 [2024-10-14 09:08:26,913 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 09:08:26,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:08:26,920 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:08:26,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-14 09:08:26,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 09:08:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-14 09:08:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 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-10-14 09:08:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 119 transitions. [2024-10-14 09:08:26,988 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 119 transitions. Word has length 166 [2024-10-14 09:08:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:08:26,988 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 119 transitions. [2024-10-14 09:08:26,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-10-14 09:08:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 119 transitions. [2024-10-14 09:08:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-14 09:08:26,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:26,994 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] [2024-10-14 09:08:27,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 09:08:27,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:08:27,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:27,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:27,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1279344462, now seen corresponding path program 1 times [2024-10-14 09:08:27,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:08:27,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100996053] [2024-10-14 09:08:27,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:27,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:08:27,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:08:27,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:08:27,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 09:08:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:27,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 09:08:27,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:08:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:08:32,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:08:32,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:08:32,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100996053] [2024-10-14 09:08:32,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100996053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:08:32,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:08:32,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:08:32,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077034824] [2024-10-14 09:08:32,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:08:32,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:08:32,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:08:32,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:08:32,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:08:32,272 INFO L87 Difference]: Start difference. First operand 77 states and 119 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-10-14 09:08:36,810 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-10-14 09:08:39,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:08:43,942 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-10-14 09:08:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:08:43,943 INFO L93 Difference]: Finished difference Result 238 states and 368 transitions. [2024-10-14 09:08:43,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:08:43,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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 168 [2024-10-14 09:08:43,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:08:43,988 INFO L225 Difference]: With dead ends: 238 [2024-10-14 09:08:43,988 INFO L226 Difference]: Without dead ends: 162 [2024-10-14 09:08:43,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:08:43,990 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 94 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-10-14 09:08:43,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 332 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 11.6s Time] [2024-10-14 09:08:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-14 09:08:44,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 125. [2024-10-14 09:08:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 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-10-14 09:08:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 192 transitions. [2024-10-14 09:08:44,021 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 192 transitions. Word has length 168 [2024-10-14 09:08:44,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:08:44,022 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 192 transitions. [2024-10-14 09:08:44,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-10-14 09:08:44,022 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 192 transitions. [2024-10-14 09:08:44,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 09:08:44,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:44,025 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] [2024-10-14 09:08:44,046 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-10-14 09:08:44,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:08:44,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:44,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash 951043530, now seen corresponding path program 1 times [2024-10-14 09:08:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:08:44,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990572785] [2024-10-14 09:08:44,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:44,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:08:44,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:08:44,230 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:08:44,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 09:08:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:44,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 09:08:44,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:08:46,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:08:46,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:08:46,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:08:46,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990572785] [2024-10-14 09:08:46,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990572785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:08:46,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:08:46,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:08:46,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206083858] [2024-10-14 09:08:46,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:08:46,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:08:46,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:08:46,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:08:46,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:08:46,722 INFO L87 Difference]: Start difference. First operand 125 states and 192 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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-10-14 09:08:51,189 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-10-14 09:08:55,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:08:59,406 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-10-14 09:09:03,411 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-10-14 09:09:07,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:09:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:09:07,419 INFO L93 Difference]: Finished difference Result 230 states and 355 transitions. [2024-10-14 09:09:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:09:07,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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 169 [2024-10-14 09:09:07,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:09:07,489 INFO L225 Difference]: With dead ends: 230 [2024-10-14 09:09:07,489 INFO L226 Difference]: Without dead ends: 154 [2024-10-14 09:09:07,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 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-10-14 09:09:07,498 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 69 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 53 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2024-10-14 09:09:07,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 336 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 16 Invalid, 5 Unknown, 0 Unchecked, 20.6s Time] [2024-10-14 09:09:07,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-14 09:09:07,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 126. [2024-10-14 09:09:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 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-10-14 09:09:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 193 transitions. [2024-10-14 09:09:07,527 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 193 transitions. Word has length 169 [2024-10-14 09:09:07,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:09:07,528 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 193 transitions. [2024-10-14 09:09:07,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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-10-14 09:09:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 193 transitions. [2024-10-14 09:09:07,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-14 09:09:07,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:09:07,532 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] [2024-10-14 09:09:07,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 09:09:07,732 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-10-14 09:09:07,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:09:07,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:09:07,733 INFO L85 PathProgramCache]: Analyzing trace with hash -705738775, now seen corresponding path program 1 times [2024-10-14 09:09:07,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:09:07,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847905610] [2024-10-14 09:09:07,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:09:07,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:09:07,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:09:07,738 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-10-14 09:09:07,739 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-10-14 09:09:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:09:08,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 09:09:08,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:09:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 09:09:12,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:09:12,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:09:12,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847905610] [2024-10-14 09:09:12,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847905610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:09:12,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:09:12,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:09:12,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267621544] [2024-10-14 09:09:12,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:09:12,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:09:12,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:09:12,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:09:12,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:09:12,126 INFO L87 Difference]: Start difference. First operand 126 states and 193 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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-10-14 09:09:16,681 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 []