./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.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 0facbc53e01d120e629a50b5211a29fd2bc23d2bc5e324a9623e8d1b2c65da11 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:18:41,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:18:41,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:18:41,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:18:41,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:18:41,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:18:41,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:18:41,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:18:41,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:18:41,246 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:18:41,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:18:41,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:18:41,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:18:41,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:18:41,247 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:18:41,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:18:41,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:18:41,248 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:18:41,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:18:41,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:18:41,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:18:41,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:18:41,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:18:41,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:18:41,251 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:18:41,251 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:18:41,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:18:41,252 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:18:41,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:18:41,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:18:41,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:18:41,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:18:41,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:18:41,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:18:41,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:18:41,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:18:41,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:18:41,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:18:41,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:18:41,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:18:41,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:18:41,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:18:41,257 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 -> 0facbc53e01d120e629a50b5211a29fd2bc23d2bc5e324a9623e8d1b2c65da11 [2024-11-08 23:18:41,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:18:41,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:18:41,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:18:41,528 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:18:41,528 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:18:41,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i [2024-11-08 23:18:43,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:18:43,264 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:18:43,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i [2024-11-08 23:18:43,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4071843a/56b0981031a34c8188d458549a570b32/FLAGb38898f9c [2024-11-08 23:18:43,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4071843a/56b0981031a34c8188d458549a570b32 [2024-11-08 23:18:43,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:18:43,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:18:43,317 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:18:43,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:18:43,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:18:43,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:18:43" (1/1) ... [2024-11-08 23:18:43,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2615a746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:43, skipping insertion in model container [2024-11-08 23:18:43,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:18:43" (1/1) ... [2024-11-08 23:18:43,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:18:43,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i[916,929] [2024-11-08 23:18:43,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:18:43,896 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:18:43,917 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i[916,929] [2024-11-08 23:18:43,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:18:44,031 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:18:44,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:44 WrapperNode [2024-11-08 23:18:44,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:18:44,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:18:44,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:18:44,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:18:44,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:44" (1/1) ... [2024-11-08 23:18:44,081 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:44" (1/1) ... [2024-11-08 23:18:44,158 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 264 [2024-11-08 23:18:44,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:18:44,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:18:44,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:18:44,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:18:44,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:44" (1/1) ... [2024-11-08 23:18:44,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:44" (1/1) ... [2024-11-08 23:18:44,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:44" (1/1) ... [2024-11-08 23:18:44,249 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:18:44,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:44" (1/1) ... [2024-11-08 23:18:44,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:44" (1/1) ... [2024-11-08 23:18:44,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:44" (1/1) ... [2024-11-08 23:18:44,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:44" (1/1) ... [2024-11-08 23:18:44,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:44" (1/1) ... [2024-11-08 23:18:44,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:44" (1/1) ... [2024-11-08 23:18:44,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:18:44,315 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:18:44,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:18:44,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:18:44,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:44" (1/1) ... [2024-11-08 23:18:44,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:18:44,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:18:44,383 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:18:44,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:18:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:18:44,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:18:44,422 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:18:44,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:18:44,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:18:44,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:18:44,496 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:18:44,499 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:18:44,832 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-08 23:18:44,833 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:18:44,842 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:18:44,842 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:18:44,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:18:44 BoogieIcfgContainer [2024-11-08 23:18:44,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:18:44,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:18:44,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:18:44,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:18:44,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:18:43" (1/3) ... [2024-11-08 23:18:44,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6076de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:18:44, skipping insertion in model container [2024-11-08 23:18:44,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:44" (2/3) ... [2024-11-08 23:18:44,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6076de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:18:44, skipping insertion in model container [2024-11-08 23:18:44,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:18:44" (3/3) ... [2024-11-08 23:18:44,850 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-31.i [2024-11-08 23:18:44,864 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:18:44,865 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:18:44,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:18:44,916 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;@4f87f8cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:18:44,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:18:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 79 states have internal predecessors, (114), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 23:18:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 23:18:44,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:18:44,932 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-11-08 23:18:44,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:18:44,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:18:44,937 INFO L85 PathProgramCache]: Analyzing trace with hash -317151865, now seen corresponding path program 1 times [2024-11-08 23:18:44,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:18:44,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823873181] [2024-11-08 23:18:44,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:18:44,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:18:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:18:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:18:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:18:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:18:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:18:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:18:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:18:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:18:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:18:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:18:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:18:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:18:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:18:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:18:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:18:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:18:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:18:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:18:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:18:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:18:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:18:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:18:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:18:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:18:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:18:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:18:45,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:18:45,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823873181] [2024-11-08 23:18:45,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823873181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:18:45,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:18:45,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:18:45,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16729841] [2024-11-08 23:18:45,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:18:45,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:18:45,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:18:45,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:18:45,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:18:45,475 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 79 states have internal predecessors, (114), 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 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 23:18:45,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:18:45,514 INFO L93 Difference]: Finished difference Result 201 states and 340 transitions. [2024-11-08 23:18:45,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:18:45,516 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (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 172 [2024-11-08 23:18:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:18:45,524 INFO L225 Difference]: With dead ends: 201 [2024-11-08 23:18:45,525 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 23:18:45,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:18:45,532 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:18:45,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:18:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 23:18:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-08 23:18:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 23:18:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2024-11-08 23:18:45,575 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 172 [2024-11-08 23:18:45,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:18:45,575 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2024-11-08 23:18:45,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 23:18:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2024-11-08 23:18:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 23:18:45,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:18:45,581 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-11-08 23:18:45,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:18:45,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:18:45,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:18:45,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1351871951, now seen corresponding path program 1 times [2024-11-08 23:18:45,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:18:45,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301766340] [2024-11-08 23:18:45,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:18:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:18:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:18:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:18:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:18:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:18:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:18:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:18:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:18:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:18:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:18:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:18:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:18:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:18:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:18:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:18:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:18:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:18:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:18:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:18:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:18:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:18:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:18:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:18:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:18:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:18:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:18:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:18:46,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:18:46,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301766340] [2024-11-08 23:18:46,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301766340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:18:46,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:18:46,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:18:46,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100503911] [2024-11-08 23:18:46,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:18:46,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:18:46,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:18:46,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:18:46,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:18:46,268 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:18:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:18:46,487 INFO L93 Difference]: Finished difference Result 274 states and 424 transitions. [2024-11-08 23:18:46,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:18:46,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 172 [2024-11-08 23:18:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:18:46,491 INFO L225 Difference]: With dead ends: 274 [2024-11-08 23:18:46,491 INFO L226 Difference]: Without dead ends: 184 [2024-11-08 23:18:46,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:18:46,494 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 92 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:18:46,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 385 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:18:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-08 23:18:46,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 152. [2024-11-08 23:18:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 23:18:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 236 transitions. [2024-11-08 23:18:46,532 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 236 transitions. Word has length 172 [2024-11-08 23:18:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:18:46,533 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 236 transitions. [2024-11-08 23:18:46,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:18:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 236 transitions. [2024-11-08 23:18:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 23:18:46,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:18:46,536 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:18:46,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:18:46,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:18:46,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:18:46,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1958210082, now seen corresponding path program 1 times [2024-11-08 23:18:46,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:18:46,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845160390] [2024-11-08 23:18:46,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:18:46,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:18:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:18:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:18:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:18:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:18:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:18:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:18:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:18:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:18:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:18:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:18:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:18:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:18:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:18:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:18:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:18:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:18:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:18:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:18:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:18:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:18:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:18:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:18:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:18:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:18:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:18:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:18:46,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:18:46,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845160390] [2024-11-08 23:18:46,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845160390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:18:46,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:18:46,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:18:46,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031843440] [2024-11-08 23:18:46,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:18:46,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:18:46,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:18:46,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:18:46,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:18:46,811 INFO L87 Difference]: Start difference. First operand 152 states and 236 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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-11-08 23:18:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:18:46,960 INFO L93 Difference]: Finished difference Result 274 states and 423 transitions. [2024-11-08 23:18:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:18:46,961 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), 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-11-08 23:18:46,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:18:46,963 INFO L225 Difference]: With dead ends: 274 [2024-11-08 23:18:46,963 INFO L226 Difference]: Without dead ends: 184 [2024-11-08 23:18:46,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:18:46,965 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 90 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:18:46,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 387 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:18:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-08 23:18:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 153. [2024-11-08 23:18:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 23:18:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 237 transitions. [2024-11-08 23:18:46,984 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 237 transitions. Word has length 173 [2024-11-08 23:18:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:18:46,985 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 237 transitions. [2024-11-08 23:18:46,985 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), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:18:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 237 transitions. [2024-11-08 23:18:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-08 23:18:46,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:18:46,987 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-11-08 23:18:46,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:18:46,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:18:46,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:18:46,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1271826764, now seen corresponding path program 1 times [2024-11-08 23:18:46,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:18:46,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657012273] [2024-11-08 23:18:46,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:18:46,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:18:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:18:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:18:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:18:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:18:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:18:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:18:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:18:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:18:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:18:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:18:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:18:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:18:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:18:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:18:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:18:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:18:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:18:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:18:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:18:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:18:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:18:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:18:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:18:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:18:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:18:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:18:47,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:18:47,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657012273] [2024-11-08 23:18:47,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657012273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:18:47,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:18:47,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:18:47,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342241545] [2024-11-08 23:18:47,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:18:47,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:18:47,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:18:47,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:18:47,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:18:47,450 INFO L87 Difference]: Start difference. First operand 153 states and 237 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-11-08 23:18:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:18:47,609 INFO L93 Difference]: Finished difference Result 293 states and 452 transitions. [2024-11-08 23:18:47,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:18:47,610 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-11-08 23:18:47,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:18:47,612 INFO L225 Difference]: With dead ends: 293 [2024-11-08 23:18:47,613 INFO L226 Difference]: Without dead ends: 192 [2024-11-08 23:18:47,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:18:47,618 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 97 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:18:47,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 398 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:18:47,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-08 23:18:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 155. [2024-11-08 23:18:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 23:18:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 235 transitions. [2024-11-08 23:18:47,643 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 235 transitions. Word has length 174 [2024-11-08 23:18:47,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:18:47,645 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 235 transitions. [2024-11-08 23:18:47,645 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-11-08 23:18:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 235 transitions. [2024-11-08 23:18:47,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 23:18:47,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:18:47,650 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:18:47,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:18:47,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:18:47,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:18:47,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1977645201, now seen corresponding path program 1 times [2024-11-08 23:18:47,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:18:47,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705163696] [2024-11-08 23:18:47,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:18:47,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:18:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:18:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:18:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:18:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:18:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:18:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:18:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:18:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:18:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:18:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:18:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:18:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:18:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:18:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:18:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:18:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:18:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:18:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:18:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:18:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:18:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:18:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:18:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:18:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:18:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:18:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:18:48,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:18:48,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705163696] [2024-11-08 23:18:48,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705163696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:18:48,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:18:48,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:18:48,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440984144] [2024-11-08 23:18:48,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:18:48,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:18:48,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:18:48,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:18:48,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:18:48,004 INFO L87 Difference]: Start difference. First operand 155 states and 235 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:18:48,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:18:48,190 INFO L93 Difference]: Finished difference Result 415 states and 630 transitions. [2024-11-08 23:18:48,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 23:18:48,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-08 23:18:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:18:48,193 INFO L225 Difference]: With dead ends: 415 [2024-11-08 23:18:48,195 INFO L226 Difference]: Without dead ends: 316 [2024-11-08 23:18:48,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:18:48,196 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 216 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:18:48,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 663 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:18:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-08 23:18:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 226. [2024-11-08 23:18:48,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 144 states have (on average 1.2777777777777777) internal successors, (184), 144 states have internal predecessors, (184), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-08 23:18:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 340 transitions. [2024-11-08 23:18:48,251 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 340 transitions. Word has length 175 [2024-11-08 23:18:48,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:18:48,252 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 340 transitions. [2024-11-08 23:18:48,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:18:48,252 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 340 transitions. [2024-11-08 23:18:48,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 23:18:48,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:18:48,254 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:18:48,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:18:48,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:18:48,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:18:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2098467377, now seen corresponding path program 1 times [2024-11-08 23:18:48,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:18:48,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391461551] [2024-11-08 23:18:48,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:18:48,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:18:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:18:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:18:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:18:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:18:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:18:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:18:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:18:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:18:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:18:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:18:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:18:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:18:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:18:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:18:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:18:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:18:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:18:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:18:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:18:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:18:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:18:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:18:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:18:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:18:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:18:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:18:51,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:18:51,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391461551] [2024-11-08 23:18:51,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391461551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:18:51,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:18:51,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:18:51,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102239951] [2024-11-08 23:18:51,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:18:51,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:18:51,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:18:51,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:18:51,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:18:51,411 INFO L87 Difference]: Start difference. First operand 226 states and 340 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:18:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:18:52,322 INFO L93 Difference]: Finished difference Result 553 states and 810 transitions. [2024-11-08 23:18:52,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:18:52,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-08 23:18:52,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:18:52,326 INFO L225 Difference]: With dead ends: 553 [2024-11-08 23:18:52,326 INFO L226 Difference]: Without dead ends: 389 [2024-11-08 23:18:52,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-08 23:18:52,328 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 202 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:18:52,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 814 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 23:18:52,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-08 23:18:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 319. [2024-11-08 23:18:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 220 states have (on average 1.3136363636363637) internal successors, (289), 222 states have internal predecessors, (289), 92 states have call successors, (92), 6 states have call predecessors, (92), 6 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-08 23:18:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 473 transitions. [2024-11-08 23:18:52,362 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 473 transitions. Word has length 175 [2024-11-08 23:18:52,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:18:52,362 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 473 transitions. [2024-11-08 23:18:52,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:18:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 473 transitions. [2024-11-08 23:18:52,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 23:18:52,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:18:52,364 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:18:52,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:18:52,365 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:18:52,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:18:52,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1418409007, now seen corresponding path program 1 times [2024-11-08 23:18:52,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:18:52,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282108877] [2024-11-08 23:18:52,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:18:52,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:18:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:18:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:18:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:18:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:18:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:18:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:18:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:18:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:18:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:18:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:18:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:18:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:18:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:18:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:18:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:18:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:18:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:18:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:18:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:18:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:18:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:18:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:18:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:18:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:18:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:18:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:18:52,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:18:52,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282108877] [2024-11-08 23:18:52,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282108877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:18:52,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:18:52,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 23:18:52,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732384098] [2024-11-08 23:18:52,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:18:52,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:18:52,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:18:52,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:18:52,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:18:52,787 INFO L87 Difference]: Start difference. First operand 319 states and 473 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:18:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:18:53,169 INFO L93 Difference]: Finished difference Result 753 states and 1115 transitions. [2024-11-08 23:18:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:18:53,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-08 23:18:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:18:53,174 INFO L225 Difference]: With dead ends: 753 [2024-11-08 23:18:53,174 INFO L226 Difference]: Without dead ends: 500 [2024-11-08 23:18:53,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:18:53,175 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 311 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:18:53,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 666 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:18:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-11-08 23:18:53,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 478. [2024-11-08 23:18:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 321 states have (on average 1.2834890965732086) internal successors, (412), 325 states have internal predecessors, (412), 144 states have call successors, (144), 12 states have call predecessors, (144), 12 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2024-11-08 23:18:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 700 transitions. [2024-11-08 23:18:53,240 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 700 transitions. Word has length 175 [2024-11-08 23:18:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:18:53,240 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 700 transitions. [2024-11-08 23:18:53,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:18:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 700 transitions. [2024-11-08 23:18:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 23:18:53,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:18:53,242 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:18:53,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:18:53,242 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:18:53,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:18:53,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1728432849, now seen corresponding path program 1 times [2024-11-08 23:18:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:18:53,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712784952] [2024-11-08 23:18:53,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:18:53,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:18:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:18:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:18:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:18:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:18:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:18:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:18:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:18:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:18:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:18:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:18:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:18:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:18:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:18:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:18:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:18:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:18:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:18:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:18:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:18:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:18:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:18:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:18:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:18:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:18:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:18:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:18:55,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:18:55,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712784952] [2024-11-08 23:18:55,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712784952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:18:55,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:18:55,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 23:18:55,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982754189] [2024-11-08 23:18:55,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:18:55,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:18:55,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:18:55,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:18:55,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:18:55,330 INFO L87 Difference]: Start difference. First operand 478 states and 700 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:18:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:18:55,980 INFO L93 Difference]: Finished difference Result 913 states and 1302 transitions. [2024-11-08 23:18:55,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:18:55,981 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-08 23:18:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:18:55,986 INFO L225 Difference]: With dead ends: 913 [2024-11-08 23:18:55,986 INFO L226 Difference]: Without dead ends: 602 [2024-11-08 23:18:55,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:18:55,988 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 137 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:18:55,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 695 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 23:18:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-08 23:18:56,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 502. [2024-11-08 23:18:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 336 states have (on average 1.2678571428571428) internal successors, (426), 340 states have internal predecessors, (426), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-08 23:18:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 722 transitions. [2024-11-08 23:18:56,031 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 722 transitions. Word has length 175 [2024-11-08 23:18:56,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:18:56,032 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 722 transitions. [2024-11-08 23:18:56,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:18:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 722 transitions. [2024-11-08 23:18:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 23:18:56,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:18:56,034 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:18:56,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 23:18:56,035 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:18:56,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:18:56,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1261176580, now seen corresponding path program 1 times [2024-11-08 23:18:56,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:18:56,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23181377] [2024-11-08 23:18:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:18:56,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:18:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:18:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:18:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:18:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:18:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:18:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:18:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:18:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:18:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:18:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:18:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:18:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:18:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:18:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:18:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:18:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:18:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:18:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:18:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:18:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:18:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:18:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:18:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:18:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:18:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:18:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:18:58,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:18:58,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23181377] [2024-11-08 23:18:58,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23181377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:18:58,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:18:58,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 23:18:58,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818071527] [2024-11-08 23:18:58,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:18:58,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 23:18:58,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:18:58,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 23:18:58,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:18:58,573 INFO L87 Difference]: Start difference. First operand 502 states and 722 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:18:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:18:59,573 INFO L93 Difference]: Finished difference Result 1101 states and 1572 transitions. [2024-11-08 23:18:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 23:18:59,577 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-08 23:18:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:18:59,583 INFO L225 Difference]: With dead ends: 1101 [2024-11-08 23:18:59,583 INFO L226 Difference]: Without dead ends: 766 [2024-11-08 23:18:59,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-08 23:18:59,585 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 209 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:18:59,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 642 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 23:18:59,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-11-08 23:18:59,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 573. [2024-11-08 23:18:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 407 states have (on average 1.316953316953317) internal successors, (536), 411 states have internal predecessors, (536), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-08 23:18:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 832 transitions. [2024-11-08 23:18:59,641 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 832 transitions. Word has length 176 [2024-11-08 23:18:59,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:18:59,641 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 832 transitions. [2024-11-08 23:18:59,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:18:59,641 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 832 transitions. [2024-11-08 23:18:59,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 23:18:59,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:18:59,644 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:18:59,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 23:18:59,644 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:18:59,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:18:59,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1885665276, now seen corresponding path program 1 times [2024-11-08 23:18:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:18:59,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230101252] [2024-11-08 23:18:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:18:59,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:19:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:19:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:19:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:19:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:19:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:19:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:19:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:19:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:19:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:19:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:19:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:19:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:19:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:19:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:19:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:19:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:19:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:19:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:19:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:19:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:19:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:19:01,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:01,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230101252] [2024-11-08 23:19:01,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230101252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:01,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:01,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 23:19:01,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400573553] [2024-11-08 23:19:01,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:01,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 23:19:01,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:01,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 23:19:01,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:19:01,092 INFO L87 Difference]: Start difference. First operand 573 states and 832 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:02,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:02,471 INFO L93 Difference]: Finished difference Result 1025 states and 1483 transitions. [2024-11-08 23:19:02,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 23:19:02,474 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-08 23:19:02,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:02,481 INFO L225 Difference]: With dead ends: 1025 [2024-11-08 23:19:02,482 INFO L226 Difference]: Without dead ends: 641 [2024-11-08 23:19:02,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2024-11-08 23:19:02,484 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 599 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:02,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1263 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 23:19:02,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-08 23:19:02,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 573. [2024-11-08 23:19:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 407 states have (on average 1.3144963144963144) internal successors, (535), 411 states have internal predecessors, (535), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-08 23:19:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 831 transitions. [2024-11-08 23:19:02,524 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 831 transitions. Word has length 176 [2024-11-08 23:19:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:02,524 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 831 transitions. [2024-11-08 23:19:02,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 831 transitions. [2024-11-08 23:19:02,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 23:19:02,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:02,526 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:02,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 23:19:02,526 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:02,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:02,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1729243650, now seen corresponding path program 1 times [2024-11-08 23:19:02,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:02,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973498390] [2024-11-08 23:19:02,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:02,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:19:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:19:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:19:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:19:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:19:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:19:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:19:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:19:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:19:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:19:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:19:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:19:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:19:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:19:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:19:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:19:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:19:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:19:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:19:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:19:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:19:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:19:06,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:06,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973498390] [2024-11-08 23:19:06,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973498390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:06,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:06,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 23:19:06,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093552367] [2024-11-08 23:19:06,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:06,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 23:19:06,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:06,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 23:19:06,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2024-11-08 23:19:06,621 INFO L87 Difference]: Start difference. First operand 573 states and 831 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:09,531 INFO L93 Difference]: Finished difference Result 1030 states and 1485 transitions. [2024-11-08 23:19:09,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 23:19:09,532 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-08 23:19:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:09,536 INFO L225 Difference]: With dead ends: 1030 [2024-11-08 23:19:09,536 INFO L226 Difference]: Without dead ends: 653 [2024-11-08 23:19:09,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=231, Invalid=825, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 23:19:09,538 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 570 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:09,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1149 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 23:19:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-08 23:19:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 574. [2024-11-08 23:19:09,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 408 states have (on average 1.3161764705882353) internal successors, (537), 412 states have internal predecessors, (537), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-08 23:19:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 833 transitions. [2024-11-08 23:19:09,572 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 833 transitions. Word has length 176 [2024-11-08 23:19:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:09,573 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 833 transitions. [2024-11-08 23:19:09,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 833 transitions. [2024-11-08 23:19:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 23:19:09,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:09,575 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:09,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 23:19:09,575 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:09,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1003011142, now seen corresponding path program 1 times [2024-11-08 23:19:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:09,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483331368] [2024-11-08 23:19:09,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:09,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:19:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:19:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:19:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:19:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:19:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:19:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:19:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:19:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:19:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:19:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:19:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:19:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:19:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:19:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:19:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:19:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:19:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:19:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:19:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:19:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:19:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:19:11,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:11,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483331368] [2024-11-08 23:19:11,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483331368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:11,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:11,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 23:19:11,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449073286] [2024-11-08 23:19:11,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:11,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 23:19:11,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:11,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 23:19:11,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:19:11,363 INFO L87 Difference]: Start difference. First operand 574 states and 833 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:12,813 INFO L93 Difference]: Finished difference Result 1118 states and 1605 transitions. [2024-11-08 23:19:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:19:12,815 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-08 23:19:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:12,818 INFO L225 Difference]: With dead ends: 1118 [2024-11-08 23:19:12,818 INFO L226 Difference]: Without dead ends: 741 [2024-11-08 23:19:12,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2024-11-08 23:19:12,820 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 232 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:12,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 821 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 23:19:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-08 23:19:12,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 595. [2024-11-08 23:19:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 429 states have (on average 1.3193473193473193) internal successors, (566), 433 states have internal predecessors, (566), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-08 23:19:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 862 transitions. [2024-11-08 23:19:12,859 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 862 transitions. Word has length 176 [2024-11-08 23:19:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:12,859 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 862 transitions. [2024-11-08 23:19:12,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 862 transitions. [2024-11-08 23:19:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 23:19:12,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:12,861 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:12,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 23:19:12,861 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:12,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:12,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2143830714, now seen corresponding path program 1 times [2024-11-08 23:19:12,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:12,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643459445] [2024-11-08 23:19:12,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:12,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:19:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:19:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:19:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:19:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:19:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:19:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:19:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:19:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:19:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:19:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:19:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:19:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:19:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:19:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:19:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:19:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:19:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:19:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:19:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:19:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:19:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:19:13,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:13,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643459445] [2024-11-08 23:19:13,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643459445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:13,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:13,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:19:13,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507108722] [2024-11-08 23:19:13,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:13,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:19:13,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:13,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:19:13,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:19:13,620 INFO L87 Difference]: Start difference. First operand 595 states and 862 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:14,378 INFO L93 Difference]: Finished difference Result 1043 states and 1512 transitions. [2024-11-08 23:19:14,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 23:19:14,379 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-08 23:19:14,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:14,382 INFO L225 Difference]: With dead ends: 1043 [2024-11-08 23:19:14,383 INFO L226 Difference]: Without dead ends: 646 [2024-11-08 23:19:14,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-08 23:19:14,385 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 440 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:14,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 774 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 23:19:14,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-08 23:19:14,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 596. [2024-11-08 23:19:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 430 states have (on average 1.3186046511627907) internal successors, (567), 434 states have internal predecessors, (567), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-08 23:19:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 863 transitions. [2024-11-08 23:19:14,419 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 863 transitions. Word has length 176 [2024-11-08 23:19:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:14,419 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 863 transitions. [2024-11-08 23:19:14,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 863 transitions. [2024-11-08 23:19:14,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 23:19:14,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:14,421 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:14,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 23:19:14,421 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:14,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:14,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1471078212, now seen corresponding path program 1 times [2024-11-08 23:19:14,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:14,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868259759] [2024-11-08 23:19:14,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:14,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:19:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:19:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:19:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:19:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:19:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:19:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:19:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:19:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:19:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:19:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:19:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:19:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:19:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:19:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:19:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:19:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:19:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:19:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:19:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:19:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:19:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:19:16,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:16,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868259759] [2024-11-08 23:19:16,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868259759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:16,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:16,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:19:16,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197138758] [2024-11-08 23:19:16,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:16,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:19:16,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:16,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:19:16,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:19:16,505 INFO L87 Difference]: Start difference. First operand 596 states and 863 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:17,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:17,765 INFO L93 Difference]: Finished difference Result 1045 states and 1513 transitions. [2024-11-08 23:19:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:19:17,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-08 23:19:17,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:17,769 INFO L225 Difference]: With dead ends: 1045 [2024-11-08 23:19:17,769 INFO L226 Difference]: Without dead ends: 654 [2024-11-08 23:19:17,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:19:17,771 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 51 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:17,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 974 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 23:19:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-08 23:19:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 596. [2024-11-08 23:19:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 430 states have (on average 1.3186046511627907) internal successors, (567), 434 states have internal predecessors, (567), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-08 23:19:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 863 transitions. [2024-11-08 23:19:17,804 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 863 transitions. Word has length 176 [2024-11-08 23:19:17,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:17,805 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 863 transitions. [2024-11-08 23:19:17,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 863 transitions. [2024-11-08 23:19:17,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 23:19:17,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:17,806 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:17,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 23:19:17,807 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:17,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:17,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1103307348, now seen corresponding path program 1 times [2024-11-08 23:19:17,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:17,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112639880] [2024-11-08 23:19:17,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:19:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:19:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:19:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:19:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:19:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:19:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:19:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:19:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:19:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:19:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:19:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:19:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:19:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:19:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:19:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:19:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:19:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:19:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:19:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:19:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:19:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:19:21,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:21,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112639880] [2024-11-08 23:19:21,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112639880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:21,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:21,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:19:21,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792930307] [2024-11-08 23:19:21,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:21,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:19:21,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:21,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:19:21,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:19:21,946 INFO L87 Difference]: Start difference. First operand 596 states and 863 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:24,404 INFO L93 Difference]: Finished difference Result 1311 states and 1878 transitions. [2024-11-08 23:19:24,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:19:24,405 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-08 23:19:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:24,408 INFO L225 Difference]: With dead ends: 1311 [2024-11-08 23:19:24,409 INFO L226 Difference]: Without dead ends: 920 [2024-11-08 23:19:24,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-08 23:19:24,411 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 258 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:24,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 822 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 23:19:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-11-08 23:19:24,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 653. [2024-11-08 23:19:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 487 states have (on average 1.3490759753593429) internal successors, (657), 491 states have internal predecessors, (657), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-08 23:19:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 953 transitions. [2024-11-08 23:19:24,450 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 953 transitions. Word has length 177 [2024-11-08 23:19:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:24,451 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 953 transitions. [2024-11-08 23:19:24,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:24,451 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 953 transitions. [2024-11-08 23:19:24,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 23:19:24,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:24,452 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:24,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 23:19:24,452 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:24,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:24,453 INFO L85 PathProgramCache]: Analyzing trace with hash -44818092, now seen corresponding path program 1 times [2024-11-08 23:19:24,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:24,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194484604] [2024-11-08 23:19:24,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:24,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:19:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:19:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:19:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:19:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:19:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:19:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:19:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:19:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:19:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:19:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:19:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:19:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:19:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:19:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:19:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:19:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:19:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:19:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:19:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:19:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:19:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:19:27,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194484604] [2024-11-08 23:19:27,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194484604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:27,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:27,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 23:19:27,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15425785] [2024-11-08 23:19:27,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:27,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 23:19:27,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:27,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 23:19:27,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-08 23:19:27,976 INFO L87 Difference]: Start difference. First operand 653 states and 953 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:30,608 INFO L93 Difference]: Finished difference Result 1199 states and 1734 transitions. [2024-11-08 23:19:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-08 23:19:30,610 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-08 23:19:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:30,614 INFO L225 Difference]: With dead ends: 1199 [2024-11-08 23:19:30,614 INFO L226 Difference]: Without dead ends: 770 [2024-11-08 23:19:30,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=376, Invalid=1184, Unknown=0, NotChecked=0, Total=1560 [2024-11-08 23:19:30,616 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 518 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:30,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1985 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 23:19:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-11-08 23:19:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 654. [2024-11-08 23:19:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 488 states have (on average 1.3504098360655739) internal successors, (659), 492 states have internal predecessors, (659), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-08 23:19:30,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 955 transitions. [2024-11-08 23:19:30,649 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 955 transitions. Word has length 177 [2024-11-08 23:19:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:30,650 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 955 transitions. [2024-11-08 23:19:30,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 955 transitions. [2024-11-08 23:19:30,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 23:19:30,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:30,650 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:30,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 23:19:30,651 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:30,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:30,651 INFO L85 PathProgramCache]: Analyzing trace with hash 635240278, now seen corresponding path program 1 times [2024-11-08 23:19:30,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:30,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927728756] [2024-11-08 23:19:30,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:30,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:30,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:30,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:30,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:19:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:30,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:30,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:19:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:30,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:30,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:19:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:30,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:30,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:19:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:19:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:19:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:19:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:19:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:19:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:19:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:19:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:19:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:19:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:19:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:19:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:19:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:19:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:19:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:19:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:19:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:19:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:31,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:19:31,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:31,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927728756] [2024-11-08 23:19:31,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927728756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:31,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:31,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 23:19:31,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224201349] [2024-11-08 23:19:31,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:31,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 23:19:31,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:31,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 23:19:31,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:19:31,022 INFO L87 Difference]: Start difference. First operand 654 states and 955 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:31,679 INFO L93 Difference]: Finished difference Result 1178 states and 1712 transitions. [2024-11-08 23:19:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 23:19:31,680 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-08 23:19:31,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:31,683 INFO L225 Difference]: With dead ends: 1178 [2024-11-08 23:19:31,684 INFO L226 Difference]: Without dead ends: 742 [2024-11-08 23:19:31,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2024-11-08 23:19:31,685 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 435 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:31,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1707 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:19:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-11-08 23:19:31,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 654. [2024-11-08 23:19:31,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 488 states have (on average 1.348360655737705) internal successors, (658), 492 states have internal predecessors, (658), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-08 23:19:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 954 transitions. [2024-11-08 23:19:31,720 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 954 transitions. Word has length 177 [2024-11-08 23:19:31,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:31,720 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 954 transitions. [2024-11-08 23:19:31,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 954 transitions. [2024-11-08 23:19:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 23:19:31,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:31,721 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:31,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 23:19:31,722 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:31,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1361472786, now seen corresponding path program 1 times [2024-11-08 23:19:31,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:31,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733182394] [2024-11-08 23:19:31,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:31,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:19:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:19:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:19:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:19:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:19:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:19:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:19:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:19:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:19:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:19:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:19:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:19:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:19:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:32,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:19:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:33,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:19:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:33,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:19:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:33,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:19:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:33,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:19:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:33,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:19:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:33,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:19:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:33,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:19:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:19:33,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:33,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733182394] [2024-11-08 23:19:33,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733182394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:33,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:33,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 23:19:33,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615503283] [2024-11-08 23:19:33,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:33,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 23:19:33,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:33,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 23:19:33,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:19:33,017 INFO L87 Difference]: Start difference. First operand 654 states and 954 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:34,069 INFO L93 Difference]: Finished difference Result 1189 states and 1720 transitions. [2024-11-08 23:19:34,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 23:19:34,073 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-08 23:19:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:34,077 INFO L225 Difference]: With dead ends: 1189 [2024-11-08 23:19:34,077 INFO L226 Difference]: Without dead ends: 760 [2024-11-08 23:19:34,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 23:19:34,079 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 471 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:34,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1697 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 23:19:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-11-08 23:19:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 656. [2024-11-08 23:19:34,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 490 states have (on average 1.3489795918367347) internal successors, (661), 494 states have internal predecessors, (661), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-08 23:19:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 957 transitions. [2024-11-08 23:19:34,112 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 957 transitions. Word has length 177 [2024-11-08 23:19:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:34,113 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 957 transitions. [2024-11-08 23:19:34,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 957 transitions. [2024-11-08 23:19:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 23:19:34,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:34,114 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:34,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 23:19:34,114 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:34,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:34,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1526009174, now seen corresponding path program 1 times [2024-11-08 23:19:34,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:34,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693090507] [2024-11-08 23:19:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:19:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:19:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:19:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:19:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:19:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:19:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:19:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:19:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:19:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:19:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:19:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:19:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:19:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:19:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:19:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:19:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:19:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:19:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:19:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:19:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:19:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:19:34,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:34,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693090507] [2024-11-08 23:19:34,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693090507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:34,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:34,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:19:34,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327073705] [2024-11-08 23:19:34,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:34,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:19:34,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:34,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:19:34,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:19:34,178 INFO L87 Difference]: Start difference. First operand 656 states and 957 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:34,242 INFO L93 Difference]: Finished difference Result 1342 states and 1952 transitions. [2024-11-08 23:19:34,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:19:34,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-08 23:19:34,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:34,247 INFO L225 Difference]: With dead ends: 1342 [2024-11-08 23:19:34,248 INFO L226 Difference]: Without dead ends: 825 [2024-11-08 23:19:34,249 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-11-08 23:19:34,250 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 123 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:34,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 315 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:19:34,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-11-08 23:19:34,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 640. [2024-11-08 23:19:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 474 states have (on average 1.3312236286919832) internal successors, (631), 478 states have internal predecessors, (631), 148 states have call successors, (148), 17 states have call predecessors, (148), 17 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-08 23:19:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 927 transitions. [2024-11-08 23:19:34,288 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 927 transitions. Word has length 177 [2024-11-08 23:19:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:34,288 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 927 transitions. [2024-11-08 23:19:34,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 927 transitions. [2024-11-08 23:19:34,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 23:19:34,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:34,289 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:34,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 23:19:34,290 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:34,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:34,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2065967819, now seen corresponding path program 1 times [2024-11-08 23:19:34,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:34,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708012865] [2024-11-08 23:19:34,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:34,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:19:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:19:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:19:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:19:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:19:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:19:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:19:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:19:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:19:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:19:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:19:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:19:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:19:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:19:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:19:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:19:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:19:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:19:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:19:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:19:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:19:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:19:34,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:34,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708012865] [2024-11-08 23:19:34,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708012865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:34,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:34,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:19:34,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927285402] [2024-11-08 23:19:34,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:34,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:19:34,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:34,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:19:34,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:19:34,467 INFO L87 Difference]: Start difference. First operand 640 states and 927 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 23:19:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:34,969 INFO L93 Difference]: Finished difference Result 2729 states and 3986 transitions. [2024-11-08 23:19:34,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:19:34,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 177 [2024-11-08 23:19:34,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:34,983 INFO L225 Difference]: With dead ends: 2729 [2024-11-08 23:19:34,983 INFO L226 Difference]: Without dead ends: 2298 [2024-11-08 23:19:34,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:19:34,986 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 776 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:34,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 763 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:19:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2024-11-08 23:19:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1643. [2024-11-08 23:19:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1205 states have (on average 1.3195020746887967) internal successors, (1590), 1217 states have internal predecessors, (1590), 392 states have call successors, (392), 45 states have call predecessors, (392), 45 states have return successors, (392), 380 states have call predecessors, (392), 392 states have call successors, (392) [2024-11-08 23:19:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2374 transitions. [2024-11-08 23:19:35,125 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2374 transitions. Word has length 177 [2024-11-08 23:19:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:35,126 INFO L471 AbstractCegarLoop]: Abstraction has 1643 states and 2374 transitions. [2024-11-08 23:19:35,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 23:19:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2374 transitions. [2024-11-08 23:19:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 23:19:35,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:35,127 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:35,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 23:19:35,127 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:35,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash -290960457, now seen corresponding path program 1 times [2024-11-08 23:19:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:35,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515097914] [2024-11-08 23:19:35,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:19:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:19:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:19:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:19:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:19:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:19:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:19:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:19:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:19:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:19:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:19:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:19:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:19:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:19:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:19:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:19:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:19:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:19:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:19:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:19:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:19:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 23:19:38,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:38,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515097914] [2024-11-08 23:19:38,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515097914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:38,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:38,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:19:38,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617764524] [2024-11-08 23:19:38,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:38,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:19:38,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:38,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:19:38,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:19:38,228 INFO L87 Difference]: Start difference. First operand 1643 states and 2374 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:39,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:39,109 INFO L93 Difference]: Finished difference Result 2944 states and 4259 transitions. [2024-11-08 23:19:39,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:19:39,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-08 23:19:39,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:39,123 INFO L225 Difference]: With dead ends: 2944 [2024-11-08 23:19:39,123 INFO L226 Difference]: Without dead ends: 1792 [2024-11-08 23:19:39,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:19:39,129 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 72 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:39,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 611 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 23:19:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2024-11-08 23:19:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1650. [2024-11-08 23:19:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1212 states have (on average 1.3226072607260726) internal successors, (1603), 1224 states have internal predecessors, (1603), 392 states have call successors, (392), 45 states have call predecessors, (392), 45 states have return successors, (392), 380 states have call predecessors, (392), 392 states have call successors, (392) [2024-11-08 23:19:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2387 transitions. [2024-11-08 23:19:39,260 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2387 transitions. Word has length 177 [2024-11-08 23:19:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:39,260 INFO L471 AbstractCegarLoop]: Abstraction has 1650 states and 2387 transitions. [2024-11-08 23:19:39,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 23:19:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2387 transitions. [2024-11-08 23:19:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 23:19:39,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:39,262 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:39,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 23:19:39,262 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:39,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:39,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1972901594, now seen corresponding path program 1 times [2024-11-08 23:19:39,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:39,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714585955] [2024-11-08 23:19:39,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:39,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:19:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:19:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:19:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:19:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:19:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:19:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:19:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:19:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:19:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:19:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:19:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:19:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:19:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:19:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:19:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:19:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:19:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:19:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:19:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:19:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:19:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-08 23:19:39,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:39,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714585955] [2024-11-08 23:19:39,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714585955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:19:39,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370244021] [2024-11-08 23:19:39,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:39,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:39,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:39,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:19:39,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:19:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:39,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 23:19:39,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:19:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 637 proven. 90 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-11-08 23:19:39,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:19:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-08 23:19:40,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370244021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:19:40,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:19:40,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 16 [2024-11-08 23:19:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882910028] [2024-11-08 23:19:40,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:19:40,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 23:19:40,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:40,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 23:19:40,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-11-08 23:19:40,200 INFO L87 Difference]: Start difference. First operand 1650 states and 2387 transitions. Second operand has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-08 23:19:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:41,322 INFO L93 Difference]: Finished difference Result 3530 states and 4995 transitions. [2024-11-08 23:19:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-08 23:19:41,322 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 177 [2024-11-08 23:19:41,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:41,333 INFO L225 Difference]: With dead ends: 3530 [2024-11-08 23:19:41,333 INFO L226 Difference]: Without dead ends: 2252 [2024-11-08 23:19:41,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 400 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=446, Invalid=1446, Unknown=0, NotChecked=0, Total=1892 [2024-11-08 23:19:41,338 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 566 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:41,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 953 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 23:19:41,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2024-11-08 23:19:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 1611. [2024-11-08 23:19:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1165 states have (on average 1.282403433476395) internal successors, (1494), 1177 states have internal predecessors, (1494), 380 states have call successors, (380), 65 states have call predecessors, (380), 65 states have return successors, (380), 368 states have call predecessors, (380), 380 states have call successors, (380) [2024-11-08 23:19:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2254 transitions. [2024-11-08 23:19:41,485 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2254 transitions. Word has length 177 [2024-11-08 23:19:41,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:41,485 INFO L471 AbstractCegarLoop]: Abstraction has 1611 states and 2254 transitions. [2024-11-08 23:19:41,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 3 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-08 23:19:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2254 transitions. [2024-11-08 23:19:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 23:19:41,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:41,486 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:41,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:19:41,690 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,SelfDestructingSolverStorable21 [2024-11-08 23:19:41,691 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:41,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:41,692 INFO L85 PathProgramCache]: Analyzing trace with hash -495330029, now seen corresponding path program 1 times [2024-11-08 23:19:41,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:41,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517668385] [2024-11-08 23:19:41,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:41,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:19:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:19:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 23:19:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:19:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:19:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:19:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:19:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:19:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:19:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:19:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:19:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:19:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:19:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:19:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:19:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:19:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 23:19:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 23:19:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 23:19:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 23:19:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 23:19:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 23:19:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 23:19:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 23:19:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:19:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:19:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-08 23:19:41,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:19:41,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517668385] [2024-11-08 23:19:41,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517668385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:19:41,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574321119] [2024-11-08 23:19:41,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:41,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:41,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:41,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:19:42,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:19:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:42,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 23:19:42,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:19:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 324 proven. 129 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2024-11-08 23:19:43,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:19:45,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574321119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:19:45,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:19:45,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14] total 20 [2024-11-08 23:19:45,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942530541] [2024-11-08 23:19:45,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:19:45,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 23:19:45,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:19:45,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 23:19:45,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2024-11-08 23:19:45,249 INFO L87 Difference]: Start difference. First operand 1611 states and 2254 transitions. Second operand has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 5 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) [2024-11-08 23:19:47,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:47,168 INFO L93 Difference]: Finished difference Result 3197 states and 4402 transitions. [2024-11-08 23:19:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 23:19:47,169 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 5 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) Word has length 178 [2024-11-08 23:19:47,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:47,176 INFO L225 Difference]: With dead ends: 3197 [2024-11-08 23:19:47,176 INFO L226 Difference]: Without dead ends: 1836 [2024-11-08 23:19:47,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 354 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=511, Invalid=2459, Unknown=0, NotChecked=0, Total=2970 [2024-11-08 23:19:47,180 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 535 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:47,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 966 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 23:19:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2024-11-08 23:19:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1446. [2024-11-08 23:19:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1040 states have (on average 1.2769230769230768) internal successors, (1328), 1046 states have internal predecessors, (1328), 338 states have call successors, (338), 67 states have call predecessors, (338), 67 states have return successors, (338), 332 states have call predecessors, (338), 338 states have call successors, (338) [2024-11-08 23:19:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2004 transitions. [2024-11-08 23:19:47,308 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2004 transitions. Word has length 178 [2024-11-08 23:19:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:47,308 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 2004 transitions. [2024-11-08 23:19:47,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 5 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) [2024-11-08 23:19:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2004 transitions. [2024-11-08 23:19:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 23:19:47,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:47,310 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:47,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 23:19:47,514 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,SelfDestructingSolverStorable22 [2024-11-08 23:19:47,515 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:47,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:47,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1506447279, now seen corresponding path program 1 times [2024-11-08 23:19:47,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:19:47,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425367803] [2024-11-08 23:19:47,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:47,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:19:47,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990541685] [2024-11-08 23:19:47,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:47,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:47,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:47,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:19:47,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 23:19:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:19:47,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:19:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:19:47,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:19:47,890 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:19:47,891 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:19:47,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 23:19:48,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:19:48,125 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:19:48,212 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:19:48,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:19:48 BoogieIcfgContainer [2024-11-08 23:19:48,215 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:19:48,215 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:19:48,215 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:19:48,215 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:19:48,216 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:18:44" (3/4) ... [2024-11-08 23:19:48,217 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:19:48,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:19:48,219 INFO L158 Benchmark]: Toolchain (without parser) took 64903.02ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 81.8MB in the beginning and 983.2MB in the end (delta: -901.4MB). Peak memory consumption was 226.0MB. Max. memory is 16.1GB. [2024-11-08 23:19:48,219 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 109.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:19:48,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 719.53ms. Allocated memory is still 151.0MB. Free memory was 81.7MB in the beginning and 113.3MB in the end (delta: -31.6MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-08 23:19:48,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 127.59ms. Allocated memory is still 151.0MB. Free memory was 113.3MB in the beginning and 108.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:19:48,219 INFO L158 Benchmark]: Boogie Preprocessor took 149.25ms. Allocated memory is still 151.0MB. Free memory was 108.6MB in the beginning and 100.5MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 23:19:48,220 INFO L158 Benchmark]: RCFGBuilder took 527.47ms. Allocated memory is still 151.0MB. Free memory was 100.5MB in the beginning and 66.6MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-08 23:19:48,220 INFO L158 Benchmark]: TraceAbstraction took 63370.17ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 65.6MB in the beginning and 983.2MB in the end (delta: -917.7MB). Peak memory consumption was 209.6MB. Max. memory is 16.1GB. [2024-11-08 23:19:48,220 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 1.3GB. Free memory is still 983.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:19:48,221 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.15ms. Allocated memory is still 151.0MB. Free memory is still 109.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 719.53ms. Allocated memory is still 151.0MB. Free memory was 81.7MB in the beginning and 113.3MB in the end (delta: -31.6MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 127.59ms. Allocated memory is still 151.0MB. Free memory was 113.3MB in the beginning and 108.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 149.25ms. Allocated memory is still 151.0MB. Free memory was 108.6MB in the beginning and 100.5MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 527.47ms. Allocated memory is still 151.0MB. Free memory was 100.5MB in the beginning and 66.6MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 63370.17ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 65.6MB in the beginning and 983.2MB in the end (delta: -917.7MB). Peak memory consumption was 209.6MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 1.3GB. Free memory is still 983.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 206, overapproximation of someUnaryDOUBLEoperation at line 46, overapproximation of someBinaryArithmeticDOUBLEoperation at line 98, overapproximation of bitwiseAnd at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 206. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 200; [L23] unsigned long int var_1_4 = 32; [L24] unsigned char var_1_6 = 1; [L25] unsigned char var_1_7 = 0; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 50; [L30] unsigned long int var_1_14 = 1000000000; [L31] unsigned short int var_1_15 = 10; [L32] unsigned short int var_1_16 = 39011; [L33] unsigned long int var_1_17 = 4; [L34] signed char var_1_18 = 4; [L35] signed char var_1_21 = 16; [L36] signed char var_1_22 = 64; [L37] signed long int var_1_23 = 8; [L38] unsigned char var_1_24 = 0; [L39] unsigned char var_1_25 = 0; [L40] unsigned char var_1_26 = 0; [L41] unsigned char var_1_27 = 0; [L42] double var_1_28 = 25.5; [L43] double var_1_29 = 255.25; [L44] double var_1_30 = 24.7; [L45] double var_1_31 = 31.2; [L46] float var_1_32 = -0.2; [L47] unsigned char var_1_33 = 10; [L48] float var_1_34 = 24.5; [L49] unsigned char last_1_var_1_7 = 0; [L50] unsigned short int last_1_var_1_15 = 10; [L51] unsigned long int last_1_var_1_17 = 4; [L52] signed long int last_1_var_1_23 = 8; [L53] unsigned char last_1_var_1_24 = 0; [L54] unsigned char last_1_var_1_33 = 10; VAL [isInitial=0, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=32, var_1_6=1, var_1_7=0] [L210] isInitial = 1 [L211] FCALL initially() [L212] int k_loop; [L213] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=32, var_1_6=1, var_1_7=0] [L213] COND TRUE k_loop < 1 [L214] CALL updateLastVariables() [L198] last_1_var_1_7 = var_1_7 [L199] last_1_var_1_15 = var_1_15 [L200] last_1_var_1_17 = var_1_17 [L201] last_1_var_1_23 = var_1_23 [L202] last_1_var_1_24 = var_1_24 [L203] last_1_var_1_33 = var_1_33 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=32, var_1_6=1, var_1_7=0] [L214] RET updateLastVariables() [L215] CALL updateVariables() [L156] var_1_4 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L157] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L158] CALL assume_abort_if_not(var_1_4 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L158] RET assume_abort_if_not(var_1_4 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_6=1, var_1_7=0] [L159] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=1, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=1, var_1_7=0] [L159] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=1, var_1_7=0] [L160] var_1_6 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_7=0] [L161] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_7=0] [L162] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L162] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L163] var_1_10 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L164] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L165] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L165] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L166] var_1_11 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L167] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L168] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L168] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L169] var_1_12 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L170] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L171] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L171] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=39011, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L172] var_1_16 = __VERIFIER_nondet_ushort() [L173] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L173] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L174] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L174] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=16, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L175] var_1_21 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L176] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L177] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L177] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=64, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L178] var_1_22 = __VERIFIER_nondet_char() [L179] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L179] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L180] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L180] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L181] var_1_25 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L182] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L183] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L183] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L184] var_1_26 = __VERIFIER_nondet_uchar() [L185] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L185] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L186] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L186] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L187] var_1_27 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L188] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L189] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L189] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_29=1021/4, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L190] var_1_29 = __VERIFIER_nondet_double() [L191] CALL assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L191] RET assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_30=247/10, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L192] var_1_30 = __VERIFIER_nondet_double() [L193] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L193] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_31=156/5, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L194] var_1_31 = __VERIFIER_nondet_double() [L195] CALL assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L195] RET assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L215] RET updateVariables() [L216] CALL step() [L58] signed long int stepLocal_8 = last_1_var_1_33; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_8=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=4, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L59] COND FALSE !(stepLocal_8 <= ((last_1_var_1_17 / var_1_4) / var_1_16)) [L68] var_1_18 = var_1_21 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=10, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L70] COND FALSE !(! (! (last_1_var_1_7 && last_1_var_1_24))) [L77] var_1_15 = last_1_var_1_23 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=1000000000, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L79] var_1_14 = (var_1_6 + var_1_15) [L80] unsigned char stepLocal_9 = last_1_var_1_7; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_9=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L81] COND TRUE ! last_1_var_1_24 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_9=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L82] COND FALSE !(stepLocal_9 && (last_1_var_1_33 >= ((((last_1_var_1_17) < (var_1_4)) ? (last_1_var_1_17) : (var_1_4))))) [L85] var_1_24 = var_1_12 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L90] unsigned short int stepLocal_10 = var_1_15; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_10=8, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=51/2, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L91] COND FALSE !(stepLocal_10 < var_1_4) [L98] var_1_28 = (100.4 + var_1_30) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_33=10, var_1_34=49/2, var_1_4=2, var_1_6=0, var_1_7=0] [L100] var_1_32 = var_1_29 [L101] var_1_33 = var_1_22 [L102] var_1_34 = var_1_29 [L103] unsigned char stepLocal_7 = var_1_12; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L104] EXPR last_1_var_1_15 & 16 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L104] signed long int stepLocal_6 = last_1_var_1_15 & 16; [L105] signed long int stepLocal_5 = last_1_var_1_15; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_5=10, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=50, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L106] COND FALSE !(last_1_var_1_15 < stepLocal_5) [L117] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L119] unsigned char stepLocal_4 = var_1_24; [L120] unsigned long int stepLocal_3 = var_1_4; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_3=2, stepLocal_4=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L121] COND TRUE (var_1_24 && var_1_24) && stepLocal_4 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_3=2, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L122] COND FALSE !(stepLocal_3 == (- var_1_13)) [L125] var_1_7 = 0 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L130] unsigned char stepLocal_2 = var_1_13 < var_1_4; [L131] signed long int stepLocal_1 = var_1_6 + var_1_15; [L132] unsigned long int stepLocal_0 = var_1_13 % var_1_4; VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_0=0, stepLocal_1=8, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L133] COND FALSE !(stepLocal_0 >= var_1_15) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_1=8, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=200, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L138] COND TRUE stepLocal_1 > var_1_13 [L139] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=8, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L144] COND FALSE !(var_1_14 < var_1_13) [L147] var_1_23 = var_1_18 VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L149] COND FALSE !((var_1_4 <= var_1_18) && var_1_7) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, stepLocal_2=1, stepLocal_6=0, stepLocal_7=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L216] RET step() [L217] CALL, EXPR property() [L206] EXPR ((((var_1_13 % var_1_4) >= var_1_15) ? ((var_1_24 && (var_1_13 < var_1_4)) ? (var_1_1 == ((unsigned char) var_1_6)) : 1) : (((var_1_6 + var_1_15) > var_1_13) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) 1)))) && (((var_1_24 && var_1_24) && var_1_24) ? ((var_1_4 == (- var_1_13)) ? (var_1_7 == ((unsigned char) (! (! (! var_1_10))))) : (var_1_7 == ((unsigned char) 0))) : (var_1_7 == ((unsigned char) (var_1_11 && var_1_12))))) && ((last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L206] EXPR (last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6)) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L206] EXPR ((((var_1_13 % var_1_4) >= var_1_15) ? ((var_1_24 && (var_1_13 < var_1_4)) ? (var_1_1 == ((unsigned char) var_1_6)) : 1) : (((var_1_6 + var_1_15) > var_1_13) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) 1)))) && (((var_1_24 && var_1_24) && var_1_24) ? ((var_1_4 == (- var_1_13)) ? (var_1_7 == ((unsigned char) (! (! (! var_1_10))))) : (var_1_7 == ((unsigned char) 0))) : (var_1_7 == ((unsigned char) (var_1_11 && var_1_12))))) && ((last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L206-L207] return ((((((((((((((var_1_13 % var_1_4) >= var_1_15) ? ((var_1_24 && (var_1_13 < var_1_4)) ? (var_1_1 == ((unsigned char) var_1_6)) : 1) : (((var_1_6 + var_1_15) > var_1_13) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) 1)))) && (((var_1_24 && var_1_24) && var_1_24) ? ((var_1_4 == (- var_1_13)) ? (var_1_7 == ((unsigned char) (! (! (! var_1_10))))) : (var_1_7 == ((unsigned char) 0))) : (var_1_7 == ((unsigned char) (var_1_11 && var_1_12))))) && ((last_1_var_1_15 < last_1_var_1_15) ? ((var_1_12 || (last_1_var_1_15 < (var_1_6 >> last_1_var_1_33))) ? (((last_1_var_1_15 & 16) <= var_1_4) ? (var_1_13 == ((unsigned char) var_1_6)) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6))) : (var_1_13 == ((unsigned char) var_1_6)))) && (var_1_14 == ((unsigned long int) (var_1_6 + var_1_15)))) && ((! (! (last_1_var_1_7 && last_1_var_1_24))) ? (last_1_var_1_7 ? (var_1_15 == ((unsigned short int) ((((last_1_var_1_33) > (last_1_var_1_23)) ? (last_1_var_1_33) : (last_1_var_1_23))))) : (var_1_15 == ((unsigned short int) (((((var_1_16 - var_1_6)) < (10)) ? ((var_1_16 - var_1_6)) : (10)))))) : (var_1_15 == ((unsigned short int) last_1_var_1_23)))) && (((var_1_4 <= var_1_18) && var_1_7) ? ((var_1_23 == var_1_1) ? (var_1_17 == ((unsigned long int) var_1_6)) : 1) : 1)) && ((last_1_var_1_33 <= ((last_1_var_1_17 / var_1_4) / var_1_16)) ? (last_1_var_1_24 ? (var_1_18 == ((signed char) (var_1_21 - var_1_22))) : (var_1_11 ? (var_1_18 == ((signed char) var_1_22)) : 1)) : (var_1_18 == ((signed char) var_1_21)))) && ((var_1_14 < var_1_13) ? (var_1_23 == ((signed long int) (((((var_1_14 + var_1_16)) < ((((((var_1_18 - var_1_14)) < (-128)) ? ((var_1_18 - var_1_14)) : (-128))))) ? ((var_1_14 + var_1_16)) : ((((((var_1_18 - var_1_14)) < (-128)) ? ((var_1_18 - var_1_14)) : (-128)))))))) : (var_1_23 == ((signed long int) var_1_18)))) && ((! last_1_var_1_24) ? ((last_1_var_1_7 && (last_1_var_1_33 >= ((((last_1_var_1_17) < (var_1_4)) ? (last_1_var_1_17) : (var_1_4))))) ? (var_1_24 == ((unsigned char) (var_1_10 || ((var_1_25 || var_1_26) || var_1_27)))) : (var_1_24 == ((unsigned char) var_1_12))) : (var_1_24 == ((unsigned char) var_1_12)))) && ((var_1_15 < var_1_4) ? (var_1_24 ? (var_1_28 == ((double) ((var_1_29 - var_1_30) + var_1_31))) : (var_1_28 == ((double) (4.75 + var_1_29)))) : (var_1_28 == ((double) (100.4 + var_1_30))))) && (var_1_32 == ((float) var_1_29))) && (var_1_33 == ((unsigned char) var_1_22))) && (var_1_34 == ((float) var_1_29)) ; [L217] RET, EXPR property() [L217] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=10, last_1_var_1_17=4, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_33=10, last_1_var_1_7=0, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=8, var_1_15=8, var_1_16=65533, var_1_17=4, var_1_18=-1, var_1_1=0, var_1_21=-1, var_1_22=0, var_1_23=-1, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_32=2, var_1_33=0, var_1_34=2, var_1_4=2, var_1_6=0, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.2s, OverallIterations: 24, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7011 SdHoareTripleChecker+Valid, 15.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7000 mSDsluCounter, 19597 SdHoareTripleChecker+Invalid, 13.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15885 mSDsCounter, 1900 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8951 IncrementalHoareTripleChecker+Invalid, 10851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1900 mSolverCounterUnsat, 3712 mSDtfsCounter, 8951 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2373 GetRequests, 1983 SyntacticMatches, 7 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2527 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1650occurred in iteration=21, InterpolantAutomatonStates: 300, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 3564 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 35.6s InterpolantComputationTime, 4752 NumberOfCodeBlocks, 4752 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 4547 ConstructedInterpolants, 0 QuantifiedInterpolants, 20413 SizeOfPredicates, 4 NumberOfNonLiveVariables, 871 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 33416/33800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:19:48,436 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-08 23:19:48,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.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 0facbc53e01d120e629a50b5211a29fd2bc23d2bc5e324a9623e8d1b2c65da11 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:19:50,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:19:50,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:19:50,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:19:50,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:19:50,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:19:50,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:19:50,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:19:50,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:19:50,528 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:19:50,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:19:50,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:19:50,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:19:50,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:19:50,529 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:19:50,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:19:50,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:19:50,530 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:19:50,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:19:50,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:19:50,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:19:50,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:19:50,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:19:50,535 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:19:50,535 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:19:50,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:19:50,535 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:19:50,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:19:50,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:19:50,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:19:50,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:19:50,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:19:50,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:19:50,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:19:50,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:19:50,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:19:50,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:19:50,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:19:50,538 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:19:50,538 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:19:50,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:19:50,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:19:50,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:19:50,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:19:50,540 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 -> 0facbc53e01d120e629a50b5211a29fd2bc23d2bc5e324a9623e8d1b2c65da11 [2024-11-08 23:19:50,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:19:50,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:19:50,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:19:50,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:19:50,830 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:19:50,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i [2024-11-08 23:19:52,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:19:52,476 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:19:52,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i [2024-11-08 23:19:52,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1719f5e1f/c2377e11fbb14c1fa48925f38eb10bad/FLAGf5753dd6a [2024-11-08 23:19:52,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1719f5e1f/c2377e11fbb14c1fa48925f38eb10bad [2024-11-08 23:19:52,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:19:52,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:19:52,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:19:52,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:19:52,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:19:52,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:19:52" (1/1) ... [2024-11-08 23:19:52,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ce6e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:52, skipping insertion in model container [2024-11-08 23:19:52,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:19:52" (1/1) ... [2024-11-08 23:19:52,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:19:52,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i[916,929] [2024-11-08 23:19:52,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:19:52,830 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:19:52,840 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-31.i[916,929] [2024-11-08 23:19:52,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:19:52,909 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:19:52,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:52 WrapperNode [2024-11-08 23:19:52,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:19:52,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:19:52,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:19:52,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:19:52,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:52" (1/1) ... [2024-11-08 23:19:52,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:52" (1/1) ... [2024-11-08 23:19:52,946 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-11-08 23:19:52,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:19:52,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:19:52,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:19:52,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:19:52,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:52" (1/1) ... [2024-11-08 23:19:52,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:52" (1/1) ... [2024-11-08 23:19:52,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:52" (1/1) ... [2024-11-08 23:19:52,965 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:19:52,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:52" (1/1) ... [2024-11-08 23:19:52,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:52" (1/1) ... [2024-11-08 23:19:52,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:52" (1/1) ... [2024-11-08 23:19:52,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:52" (1/1) ... [2024-11-08 23:19:52,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:52" (1/1) ... [2024-11-08 23:19:52,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:52" (1/1) ... [2024-11-08 23:19:52,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:19:52,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:19:52,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:19:52,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:19:52,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:52" (1/1) ... [2024-11-08 23:19:52,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:19:52,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:19:53,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:19:53,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:19:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:19:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:19:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:19:53,048 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:19:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:19:53,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:19:53,115 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:19:53,117 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:19:58,346 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-08 23:19:58,347 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:19:58,364 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:19:58,364 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:19:58,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:19:58 BoogieIcfgContainer [2024-11-08 23:19:58,365 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:19:58,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:19:58,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:19:58,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:19:58,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:19:52" (1/3) ... [2024-11-08 23:19:58,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de2c3f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:19:58, skipping insertion in model container [2024-11-08 23:19:58,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:19:52" (2/3) ... [2024-11-08 23:19:58,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de2c3f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:19:58, skipping insertion in model container [2024-11-08 23:19:58,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:19:58" (3/3) ... [2024-11-08 23:19:58,376 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-31.i [2024-11-08 23:19:58,389 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:19:58,390 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:19:58,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:19:58,446 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;@76472be6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:19:58,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:19:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 23:19:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 23:19:58,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:58,464 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-11-08 23:19:58,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:58,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:58,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2027228037, now seen corresponding path program 1 times [2024-11-08 23:19:58,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:19:58,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899769748] [2024-11-08 23:19:58,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:58,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:19:58,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:19:58,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:19:58,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:19:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:58,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:19:58,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:19:59,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-08 23:19:59,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:19:59,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:19:59,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899769748] [2024-11-08 23:19:59,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899769748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:19:59,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:19:59,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:19:59,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581263549] [2024-11-08 23:19:59,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:19:59,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:19:59,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:19:59,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:19:59,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:19:59,076 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 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 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 23:19:59,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:19:59,102 INFO L93 Difference]: Finished difference Result 167 states and 289 transitions. [2024-11-08 23:19:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:19:59,104 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (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 168 [2024-11-08 23:19:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:19:59,109 INFO L225 Difference]: With dead ends: 167 [2024-11-08 23:19:59,111 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 23:19:59,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:19:59,117 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:19:59,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:19:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 23:19:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 23:19:59,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 23:19:59,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2024-11-08 23:19:59,155 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 168 [2024-11-08 23:19:59,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:19:59,156 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2024-11-08 23:19:59,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 23:19:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2024-11-08 23:19:59,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 23:19:59,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:19:59,160 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-11-08 23:19:59,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:19:59,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:19:59,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:19:59,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:19:59,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1301264333, now seen corresponding path program 1 times [2024-11-08 23:19:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:19:59,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023703103] [2024-11-08 23:19:59,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:19:59,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:19:59,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:19:59,368 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:19:59,374 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