./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:55:06,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:55:06,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 01:55:06,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:55:06,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:55:06,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:55:06,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:55:06,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:55:06,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:55:06,185 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:55:06,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:55:06,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:55:06,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:55:06,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:55:06,187 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:55:06,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:55:06,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:55:06,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:55:06,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:55:06,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:55:06,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:55:06,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:55:06,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:55:06,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:55:06,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:55:06,193 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:55:06,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:55:06,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:55:06,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:55:06,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:55:06,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:55:06,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:55:06,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:55:06,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:55:06,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:55:06,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:55:06,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:55:06,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:55:06,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:55:06,196 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca [2024-11-10 01:55:06,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:55:06,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:55:06,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:55:06,447 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:55:06,447 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:55:06,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2024-11-10 01:55:07,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:55:08,170 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:55:08,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2024-11-10 01:55:08,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c80c9bb7a/ec7768ce5d8c4a1790b52534c85b193b/FLAG97f9470fe [2024-11-10 01:55:08,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c80c9bb7a/ec7768ce5d8c4a1790b52534c85b193b [2024-11-10 01:55:08,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:55:08,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:55:08,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:55:08,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:55:08,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:55:08,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:55:08" (1/1) ... [2024-11-10 01:55:08,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2377c804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:08, skipping insertion in model container [2024-11-10 01:55:08,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:55:08" (1/1) ... [2024-11-10 01:55:08,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:55:08,735 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c[1279,1292] [2024-11-10 01:55:08,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:55:08,964 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:55:09,010 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c[1279,1292] [2024-11-10 01:55:09,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:55:09,144 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:55:09,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:09 WrapperNode [2024-11-10 01:55:09,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:55:09,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:55:09,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:55:09,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:55:09,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:09" (1/1) ... [2024-11-10 01:55:09,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:09" (1/1) ... [2024-11-10 01:55:09,345 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1382 [2024-11-10 01:55:09,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:55:09,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:55:09,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:55:09,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:55:09,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:09" (1/1) ... [2024-11-10 01:55:09,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:09" (1/1) ... [2024-11-10 01:55:09,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:09" (1/1) ... [2024-11-10 01:55:09,437 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 01:55:09,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:09" (1/1) ... [2024-11-10 01:55:09,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:09" (1/1) ... [2024-11-10 01:55:09,500 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:09" (1/1) ... [2024-11-10 01:55:09,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:09" (1/1) ... [2024-11-10 01:55:09,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:09" (1/1) ... [2024-11-10 01:55:09,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:09" (1/1) ... [2024-11-10 01:55:09,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:55:09,562 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:55:09,562 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:55:09,562 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:55:09,562 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:09" (1/1) ... [2024-11-10 01:55:09,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:55:09,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:55:09,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 01:55:09,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 01:55:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:55:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 01:55:09,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 01:55:09,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:55:09,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:55:09,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:55:09,808 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:55:09,812 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:55:11,008 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-11-10 01:55:11,009 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:55:11,094 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:55:11,096 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:55:11,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:55:11 BoogieIcfgContainer [2024-11-10 01:55:11,097 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:55:11,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:55:11,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:55:11,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:55:11,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:55:08" (1/3) ... [2024-11-10 01:55:11,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208cd832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:55:11, skipping insertion in model container [2024-11-10 01:55:11,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:55:09" (2/3) ... [2024-11-10 01:55:11,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208cd832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:55:11, skipping insertion in model container [2024-11-10 01:55:11,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:55:11" (3/3) ... [2024-11-10 01:55:11,105 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2024-11-10 01:55:11,120 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:55:11,120 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:55:11,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:55:11,196 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;@1628d081, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:55:11,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:55:11,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 395 states, 389 states have (on average 1.4884318766066837) internal successors, (579), 390 states have internal predecessors, (579), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 01:55:11,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:11,226 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:11,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:11,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1130703786, now seen corresponding path program 1 times [2024-11-10 01:55:11,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:11,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266229964] [2024-11-10 01:55:11,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:11,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:11,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:11,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:55:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:11,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:55:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:11,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:11,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266229964] [2024-11-10 01:55:11,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266229964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:11,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:11,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:55:11,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615690811] [2024-11-10 01:55:11,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:11,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 01:55:11,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:11,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 01:55:11,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:55:11,760 INFO L87 Difference]: Start difference. First operand has 395 states, 389 states have (on average 1.4884318766066837) internal successors, (579), 390 states have internal predecessors, (579), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:55:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:11,961 INFO L93 Difference]: Finished difference Result 715 states and 1065 transitions. [2024-11-10 01:55:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:55:11,963 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 118 [2024-11-10 01:55:11,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:11,971 INFO L225 Difference]: With dead ends: 715 [2024-11-10 01:55:11,971 INFO L226 Difference]: Without dead ends: 390 [2024-11-10 01:55:11,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:55:11,977 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:11,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 485 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:11,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-10 01:55:12,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-11-10 01:55:12,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.4857142857142858) internal successors, (572), 385 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:12,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 578 transitions. [2024-11-10 01:55:12,025 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 578 transitions. Word has length 118 [2024-11-10 01:55:12,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:12,025 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 578 transitions. [2024-11-10 01:55:12,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:55:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 578 transitions. [2024-11-10 01:55:12,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 01:55:12,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:12,028 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:12,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:55:12,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:12,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:12,029 INFO L85 PathProgramCache]: Analyzing trace with hash 165064281, now seen corresponding path program 1 times [2024-11-10 01:55:12,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:12,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877238070] [2024-11-10 01:55:12,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:12,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:12,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:12,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:55:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:12,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:55:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:12,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:12,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877238070] [2024-11-10 01:55:12,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877238070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:12,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:12,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:12,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218363548] [2024-11-10 01:55:12,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:12,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:12,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:12,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:12,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:12,657 INFO L87 Difference]: Start difference. First operand 390 states and 578 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:12,849 INFO L93 Difference]: Finished difference Result 395 states and 583 transitions. [2024-11-10 01:55:12,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:12,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2024-11-10 01:55:12,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:12,852 INFO L225 Difference]: With dead ends: 395 [2024-11-10 01:55:12,852 INFO L226 Difference]: Without dead ends: 392 [2024-11-10 01:55:12,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:12,853 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:12,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1444 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-10 01:55:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-11-10 01:55:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.483204134366925) internal successors, (574), 387 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 580 transitions. [2024-11-10 01:55:12,866 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 580 transitions. Word has length 118 [2024-11-10 01:55:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:12,868 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 580 transitions. [2024-11-10 01:55:12,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 580 transitions. [2024-11-10 01:55:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 01:55:12,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:12,869 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:12,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:55:12,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:12,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:12,870 INFO L85 PathProgramCache]: Analyzing trace with hash 967079114, now seen corresponding path program 1 times [2024-11-10 01:55:12,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:12,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921875969] [2024-11-10 01:55:12,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:12,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:13,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:13,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:55:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:13,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:55:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:13,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:13,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921875969] [2024-11-10 01:55:13,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921875969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:13,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:13,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:13,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775203888] [2024-11-10 01:55:13,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:13,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:13,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:13,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:13,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:13,205 INFO L87 Difference]: Start difference. First operand 392 states and 580 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:13,667 INFO L93 Difference]: Finished difference Result 973 states and 1443 transitions. [2024-11-10 01:55:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:55:13,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119 [2024-11-10 01:55:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:13,670 INFO L225 Difference]: With dead ends: 973 [2024-11-10 01:55:13,670 INFO L226 Difference]: Without dead ends: 392 [2024-11-10 01:55:13,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:55:13,672 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 1091 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:13,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1419 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:55:13,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-10 01:55:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-11-10 01:55:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4806201550387597) internal successors, (573), 387 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 579 transitions. [2024-11-10 01:55:13,682 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 579 transitions. Word has length 119 [2024-11-10 01:55:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:13,683 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 579 transitions. [2024-11-10 01:55:13,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 579 transitions. [2024-11-10 01:55:13,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 01:55:13,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:13,684 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:13,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:55:13,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:13,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:13,685 INFO L85 PathProgramCache]: Analyzing trace with hash 806869547, now seen corresponding path program 1 times [2024-11-10 01:55:13,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:13,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543335914] [2024-11-10 01:55:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:13,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:13,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:55:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:13,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:55:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:13,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:13,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543335914] [2024-11-10 01:55:13,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543335914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:13,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:13,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:13,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380803060] [2024-11-10 01:55:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:13,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:13,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:13,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:13,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:13,991 INFO L87 Difference]: Start difference. First operand 392 states and 579 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:14,152 INFO L93 Difference]: Finished difference Result 716 states and 1057 transitions. [2024-11-10 01:55:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:14,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 120 [2024-11-10 01:55:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:14,155 INFO L225 Difference]: With dead ends: 716 [2024-11-10 01:55:14,155 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:55:14,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:14,156 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:14,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:55:14,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:55:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:55:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4781491002570695) internal successors, (575), 389 states have internal predecessors, (575), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 581 transitions. [2024-11-10 01:55:14,171 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 581 transitions. Word has length 120 [2024-11-10 01:55:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:14,171 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 581 transitions. [2024-11-10 01:55:14,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 581 transitions. [2024-11-10 01:55:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 01:55:14,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:14,176 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:14,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:55:14,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:14,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:14,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1009603939, now seen corresponding path program 1 times [2024-11-10 01:55:14,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:14,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491404876] [2024-11-10 01:55:14,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:14,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:14,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:14,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:55:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:14,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:55:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:14,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:14,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491404876] [2024-11-10 01:55:14,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491404876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:14,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:14,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:14,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971361607] [2024-11-10 01:55:14,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:14,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:14,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:14,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:14,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:14,614 INFO L87 Difference]: Start difference. First operand 394 states and 581 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:14,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:14,814 INFO L93 Difference]: Finished difference Result 718 states and 1058 transitions. [2024-11-10 01:55:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:14,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 121 [2024-11-10 01:55:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:14,816 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:55:14,816 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:55:14,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:14,818 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 485 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:14,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 902 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:55:14,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:55:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4755784061696657) internal successors, (574), 389 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 580 transitions. [2024-11-10 01:55:14,826 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 580 transitions. Word has length 121 [2024-11-10 01:55:14,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:14,826 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 580 transitions. [2024-11-10 01:55:14,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 580 transitions. [2024-11-10 01:55:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 01:55:14,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:14,828 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:14,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:55:14,828 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:14,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1998914035, now seen corresponding path program 1 times [2024-11-10 01:55:14,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:14,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632575653] [2024-11-10 01:55:14,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:14,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:15,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:15,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:55:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:15,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:55:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:15,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632575653] [2024-11-10 01:55:15,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632575653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:15,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:15,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:15,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133809969] [2024-11-10 01:55:15,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:15,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:15,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:15,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:15,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:15,051 INFO L87 Difference]: Start difference. First operand 394 states and 580 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:15,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:15,246 INFO L93 Difference]: Finished difference Result 718 states and 1056 transitions. [2024-11-10 01:55:15,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:15,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2024-11-10 01:55:15,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:15,248 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:55:15,248 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:55:15,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:15,249 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 1043 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:15,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 902 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:55:15,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:55:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4730077120822622) internal successors, (573), 389 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 579 transitions. [2024-11-10 01:55:15,275 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 579 transitions. Word has length 122 [2024-11-10 01:55:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:15,275 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 579 transitions. [2024-11-10 01:55:15,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 579 transitions. [2024-11-10 01:55:15,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:55:15,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:15,276 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:15,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:55:15,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:15,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:15,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1860758558, now seen corresponding path program 1 times [2024-11-10 01:55:15,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:15,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619975956] [2024-11-10 01:55:15,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:15,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:15,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:15,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:55:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:15,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:55:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:15,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:15,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619975956] [2024-11-10 01:55:15,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619975956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:15,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:15,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:15,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864117108] [2024-11-10 01:55:15,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:15,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:15,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:15,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:15,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:15,477 INFO L87 Difference]: Start difference. First operand 394 states and 579 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:15,662 INFO L93 Difference]: Finished difference Result 718 states and 1054 transitions. [2024-11-10 01:55:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:15,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123 [2024-11-10 01:55:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:15,664 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:55:15,664 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:55:15,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:15,666 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 1035 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:15,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 902 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:55:15,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:55:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4704370179948587) internal successors, (572), 389 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 578 transitions. [2024-11-10 01:55:15,674 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 578 transitions. Word has length 123 [2024-11-10 01:55:15,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:15,675 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 578 transitions. [2024-11-10 01:55:15,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 578 transitions. [2024-11-10 01:55:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-10 01:55:15,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:15,676 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:15,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:55:15,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:15,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:15,677 INFO L85 PathProgramCache]: Analyzing trace with hash -84426446, now seen corresponding path program 1 times [2024-11-10 01:55:15,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:15,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093438050] [2024-11-10 01:55:15,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:15,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:15,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:15,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:55:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:15,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:55:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:15,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:15,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093438050] [2024-11-10 01:55:15,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093438050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:15,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:15,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:15,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20899876] [2024-11-10 01:55:15,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:15,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:15,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:15,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:15,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:15,904 INFO L87 Difference]: Start difference. First operand 394 states and 578 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:16,090 INFO L93 Difference]: Finished difference Result 718 states and 1052 transitions. [2024-11-10 01:55:16,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:16,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2024-11-10 01:55:16,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:16,092 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:55:16,092 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:55:16,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:16,093 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 556 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:16,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 909 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:16,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:55:16,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:55:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.467866323907455) internal successors, (571), 389 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 577 transitions. [2024-11-10 01:55:16,099 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 577 transitions. Word has length 124 [2024-11-10 01:55:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:16,100 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 577 transitions. [2024-11-10 01:55:16,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 577 transitions. [2024-11-10 01:55:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-10 01:55:16,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:16,101 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:16,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:55:16,101 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:16,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash -850844761, now seen corresponding path program 1 times [2024-11-10 01:55:16,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:16,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795185786] [2024-11-10 01:55:16,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:16,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:16,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:16,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:55:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:16,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:55:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:16,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:16,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795185786] [2024-11-10 01:55:16,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795185786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:16,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:16,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:16,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624630861] [2024-11-10 01:55:16,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:16,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:16,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:16,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:16,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:16,411 INFO L87 Difference]: Start difference. First operand 394 states and 577 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:16,575 INFO L93 Difference]: Finished difference Result 718 states and 1050 transitions. [2024-11-10 01:55:16,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:16,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 125 [2024-11-10 01:55:16,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:16,577 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:55:16,577 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:55:16,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:16,579 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 484 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:16,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 926 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:55:16,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:55:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:55:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4627249357326477) internal successors, (569), 389 states have internal predecessors, (569), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 575 transitions. [2024-11-10 01:55:16,589 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 575 transitions. Word has length 125 [2024-11-10 01:55:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:16,589 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 575 transitions. [2024-11-10 01:55:16,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 575 transitions. [2024-11-10 01:55:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 01:55:16,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:16,591 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:16,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:55:16,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:16,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:16,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1240331494, now seen corresponding path program 1 times [2024-11-10 01:55:16,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:16,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036103054] [2024-11-10 01:55:16,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:16,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:16,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:16,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:55:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:16,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:55:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:16,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:16,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036103054] [2024-11-10 01:55:16,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036103054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:16,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:16,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:16,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087032950] [2024-11-10 01:55:16,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:16,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:16,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:16,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:16,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:16,857 INFO L87 Difference]: Start difference. First operand 394 states and 575 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:17,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:17,019 INFO L93 Difference]: Finished difference Result 718 states and 1046 transitions. [2024-11-10 01:55:17,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:17,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2024-11-10 01:55:17,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:17,021 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:55:17,021 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:55:17,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:17,022 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 1035 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:17,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 926 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:55:17,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:55:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:55:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4601542416452442) internal successors, (568), 389 states have internal predecessors, (568), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 574 transitions. [2024-11-10 01:55:17,030 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 574 transitions. Word has length 127 [2024-11-10 01:55:17,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:17,030 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 574 transitions. [2024-11-10 01:55:17,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 574 transitions. [2024-11-10 01:55:17,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 01:55:17,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:17,032 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:17,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:55:17,032 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:17,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:17,032 INFO L85 PathProgramCache]: Analyzing trace with hash 577757747, now seen corresponding path program 1 times [2024-11-10 01:55:17,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:17,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743149304] [2024-11-10 01:55:17,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:17,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:17,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:17,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 01:55:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:17,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 01:55:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:17,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:17,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743149304] [2024-11-10 01:55:17,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743149304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:17,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:17,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:17,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709919614] [2024-11-10 01:55:17,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:17,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:17,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:17,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:17,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:17,356 INFO L87 Difference]: Start difference. First operand 394 states and 574 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:55:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:17,524 INFO L93 Difference]: Finished difference Result 718 states and 1044 transitions. [2024-11-10 01:55:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:17,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 128 [2024-11-10 01:55:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:17,525 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:55:17,525 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:55:17,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:17,526 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 519 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:17,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 930 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:55:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:55:17,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:55:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4575835475578407) internal successors, (567), 389 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 573 transitions. [2024-11-10 01:55:17,533 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 573 transitions. Word has length 128 [2024-11-10 01:55:17,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:17,534 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 573 transitions. [2024-11-10 01:55:17,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:55:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 573 transitions. [2024-11-10 01:55:17,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 01:55:17,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:17,535 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:17,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:55:17,535 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:17,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:17,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1439866612, now seen corresponding path program 1 times [2024-11-10 01:55:17,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:17,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063295457] [2024-11-10 01:55:17,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:17,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:17,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:17,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 01:55:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:17,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-10 01:55:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:17,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:17,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063295457] [2024-11-10 01:55:17,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063295457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:17,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:17,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:17,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400049299] [2024-11-10 01:55:17,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:17,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:17,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:17,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:17,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:17,853 INFO L87 Difference]: Start difference. First operand 394 states and 573 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:55:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:18,023 INFO L93 Difference]: Finished difference Result 718 states and 1042 transitions. [2024-11-10 01:55:18,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:18,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 129 [2024-11-10 01:55:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:18,024 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:55:18,024 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:55:18,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:18,025 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 517 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:18,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 930 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:55:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:55:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:55:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.455012853470437) internal successors, (566), 389 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:18,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 572 transitions. [2024-11-10 01:55:18,032 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 572 transitions. Word has length 129 [2024-11-10 01:55:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:18,033 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 572 transitions. [2024-11-10 01:55:18,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 01:55:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 572 transitions. [2024-11-10 01:55:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 01:55:18,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:18,034 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:18,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:55:18,034 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:18,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1246117868, now seen corresponding path program 1 times [2024-11-10 01:55:18,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:18,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752730714] [2024-11-10 01:55:18,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:18,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:55:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:18,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:18,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752730714] [2024-11-10 01:55:18,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752730714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:18,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:18,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:18,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29369976] [2024-11-10 01:55:18,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:18,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:18,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:18,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:18,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:18,408 INFO L87 Difference]: Start difference. First operand 394 states and 572 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:18,662 INFO L93 Difference]: Finished difference Result 718 states and 1040 transitions. [2024-11-10 01:55:18,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:18,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 130 [2024-11-10 01:55:18,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:18,664 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:55:18,664 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:55:18,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:18,665 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 471 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:18,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1332 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:55:18,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:55:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4524421593830334) internal successors, (565), 389 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 571 transitions. [2024-11-10 01:55:18,673 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 571 transitions. Word has length 130 [2024-11-10 01:55:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:18,673 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 571 transitions. [2024-11-10 01:55:18,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 571 transitions. [2024-11-10 01:55:18,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 01:55:18,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:18,675 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:18,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:55:18,675 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:18,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:18,676 INFO L85 PathProgramCache]: Analyzing trace with hash -711738532, now seen corresponding path program 1 times [2024-11-10 01:55:18,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:18,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193312753] [2024-11-10 01:55:18,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:18,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:19,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:19,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:19,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:55:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:19,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:19,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193312753] [2024-11-10 01:55:19,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193312753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:19,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:19,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:19,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734407103] [2024-11-10 01:55:19,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:19,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:19,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:19,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:19,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:19,034 INFO L87 Difference]: Start difference. First operand 394 states and 571 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:19,310 INFO L93 Difference]: Finished difference Result 720 states and 1040 transitions. [2024-11-10 01:55:19,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:19,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 131 [2024-11-10 01:55:19,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:19,313 INFO L225 Difference]: With dead ends: 720 [2024-11-10 01:55:19,313 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:55:19,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:19,314 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 2 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:19,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1289 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:19,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:55:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:55:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4498714652956297) internal successors, (564), 389 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 570 transitions. [2024-11-10 01:55:19,323 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 570 transitions. Word has length 131 [2024-11-10 01:55:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:19,323 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 570 transitions. [2024-11-10 01:55:19,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 570 transitions. [2024-11-10 01:55:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 01:55:19,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:19,325 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:19,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:55:19,326 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:19,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1629532284, now seen corresponding path program 1 times [2024-11-10 01:55:19,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:19,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930645924] [2024-11-10 01:55:19,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:19,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:19,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:19,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:19,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:55:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:19,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:19,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930645924] [2024-11-10 01:55:19,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930645924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:19,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:19,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:19,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134942803] [2024-11-10 01:55:19,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:19,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:19,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:19,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:19,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:19,690 INFO L87 Difference]: Start difference. First operand 394 states and 570 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:19,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:19,928 INFO L93 Difference]: Finished difference Result 718 states and 1036 transitions. [2024-11-10 01:55:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:19,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 132 [2024-11-10 01:55:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:19,930 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:55:19,930 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:55:19,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:19,932 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 928 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:19,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 890 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:19,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:55:19,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:55:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4473007712082262) internal successors, (563), 389 states have internal predecessors, (563), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:19,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 569 transitions. [2024-11-10 01:55:19,939 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 569 transitions. Word has length 132 [2024-11-10 01:55:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:19,939 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 569 transitions. [2024-11-10 01:55:19,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:19,940 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 569 transitions. [2024-11-10 01:55:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 01:55:19,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:19,941 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:19,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:55:19,941 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:19,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:19,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1114957878, now seen corresponding path program 1 times [2024-11-10 01:55:19,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:19,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17221274] [2024-11-10 01:55:19,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:19,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:20,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:20,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:20,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:55:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:20,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:20,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17221274] [2024-11-10 01:55:20,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17221274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:20,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:20,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732138619] [2024-11-10 01:55:20,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:20,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:20,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:20,314 INFO L87 Difference]: Start difference. First operand 394 states and 569 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:20,708 INFO L93 Difference]: Finished difference Result 718 states and 1034 transitions. [2024-11-10 01:55:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:20,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 133 [2024-11-10 01:55:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:20,710 INFO L225 Difference]: With dead ends: 718 [2024-11-10 01:55:20,710 INFO L226 Difference]: Without dead ends: 394 [2024-11-10 01:55:20,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:20,710 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 922 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:20,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 890 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-10 01:55:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-10 01:55:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4447300771208227) internal successors, (562), 389 states have internal predecessors, (562), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 568 transitions. [2024-11-10 01:55:20,718 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 568 transitions. Word has length 133 [2024-11-10 01:55:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:20,718 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 568 transitions. [2024-11-10 01:55:20,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 568 transitions. [2024-11-10 01:55:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 01:55:20,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:20,720 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:20,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:55:20,720 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:20,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash -241491764, now seen corresponding path program 1 times [2024-11-10 01:55:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:20,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992972011] [2024-11-10 01:55:20,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:20,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:21,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:21,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:21,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:55:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:21,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:21,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992972011] [2024-11-10 01:55:21,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992972011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:21,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:21,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:21,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447465655] [2024-11-10 01:55:21,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:21,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:21,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:21,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:21,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:21,352 INFO L87 Difference]: Start difference. First operand 394 states and 568 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:21,558 INFO L93 Difference]: Finished difference Result 762 states and 1086 transitions. [2024-11-10 01:55:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:55:21,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 134 [2024-11-10 01:55:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:21,561 INFO L225 Difference]: With dead ends: 762 [2024-11-10 01:55:21,561 INFO L226 Difference]: Without dead ends: 438 [2024-11-10 01:55:21,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:21,562 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 18 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:21,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1856 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:21,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-10 01:55:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 436. [2024-11-10 01:55:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 431 states have (on average 1.419953596287703) internal successors, (612), 431 states have internal predecessors, (612), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 618 transitions. [2024-11-10 01:55:21,570 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 618 transitions. Word has length 134 [2024-11-10 01:55:21,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:21,570 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 618 transitions. [2024-11-10 01:55:21,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 618 transitions. [2024-11-10 01:55:21,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 01:55:21,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:21,572 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:21,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:55:21,572 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:21,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:21,572 INFO L85 PathProgramCache]: Analyzing trace with hash -486614377, now seen corresponding path program 1 times [2024-11-10 01:55:21,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:21,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699481367] [2024-11-10 01:55:21,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:21,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:21,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-10 01:55:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:21,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-10 01:55:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:21,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 01:55:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:21,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:21,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699481367] [2024-11-10 01:55:21,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699481367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:21,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:21,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 01:55:21,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418255039] [2024-11-10 01:55:21,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:21,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 01:55:21,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:21,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 01:55:21,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:55:21,980 INFO L87 Difference]: Start difference. First operand 436 states and 618 transitions. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:22,401 INFO L93 Difference]: Finished difference Result 872 states and 1233 transitions. [2024-11-10 01:55:22,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 01:55:22,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 135 [2024-11-10 01:55:22,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:22,403 INFO L225 Difference]: With dead ends: 872 [2024-11-10 01:55:22,403 INFO L226 Difference]: Without dead ends: 440 [2024-11-10 01:55:22,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:55:22,404 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 642 mSDsluCounter, 1691 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:22,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 2141 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:55:22,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-10 01:55:22,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2024-11-10 01:55:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.415704387990762) internal successors, (613), 433 states have internal predecessors, (613), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 01:55:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 619 transitions. [2024-11-10 01:55:22,412 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 619 transitions. Word has length 135 [2024-11-10 01:55:22,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:22,412 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 619 transitions. [2024-11-10 01:55:22,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 619 transitions. [2024-11-10 01:55:22,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-10 01:55:22,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:22,414 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:22,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:55:22,414 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:22,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:22,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1753918395, now seen corresponding path program 1 times [2024-11-10 01:55:22,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:22,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284608261] [2024-11-10 01:55:22,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:22,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:23,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:23,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:23,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 01:55:23,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:23,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284608261] [2024-11-10 01:55:23,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284608261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:23,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:23,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:55:23,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921792209] [2024-11-10 01:55:23,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:23,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:55:23,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:23,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:55:23,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:23,059 INFO L87 Difference]: Start difference. First operand 438 states and 619 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:23,356 INFO L93 Difference]: Finished difference Result 970 states and 1351 transitions. [2024-11-10 01:55:23,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:55:23,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 136 [2024-11-10 01:55:23,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:23,358 INFO L225 Difference]: With dead ends: 970 [2024-11-10 01:55:23,358 INFO L226 Difference]: Without dead ends: 602 [2024-11-10 01:55:23,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:55:23,360 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 854 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:23,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1827 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-10 01:55:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-10 01:55:23,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 594 states have (on average 1.3855218855218856) internal successors, (823), 594 states have internal predecessors, (823), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 835 transitions. [2024-11-10 01:55:23,380 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 835 transitions. Word has length 136 [2024-11-10 01:55:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:23,380 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 835 transitions. [2024-11-10 01:55:23,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 835 transitions. [2024-11-10 01:55:23,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-10 01:55:23,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:23,385 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:23,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 01:55:23,385 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:23,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:23,385 INFO L85 PathProgramCache]: Analyzing trace with hash -803383157, now seen corresponding path program 1 times [2024-11-10 01:55:23,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:23,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055838403] [2024-11-10 01:55:23,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:23,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:23,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:23,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:23,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:23,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-10 01:55:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:23,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-10 01:55:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:23,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-10 01:55:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:23,939 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:23,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:23,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055838403] [2024-11-10 01:55:23,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055838403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:23,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:23,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:23,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894971554] [2024-11-10 01:55:23,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:23,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:23,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:23,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:23,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:23,942 INFO L87 Difference]: Start difference. First operand 602 states and 835 transitions. Second operand has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:24,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:24,126 INFO L93 Difference]: Finished difference Result 970 states and 1350 transitions. [2024-11-10 01:55:24,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:24,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325 [2024-11-10 01:55:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:24,129 INFO L225 Difference]: With dead ends: 970 [2024-11-10 01:55:24,129 INFO L226 Difference]: Without dead ends: 602 [2024-11-10 01:55:24,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:24,130 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 514 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:24,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 895 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:24,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-10 01:55:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-10 01:55:24,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 594 states have (on average 1.3838383838383839) internal successors, (822), 594 states have internal predecessors, (822), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 834 transitions. [2024-11-10 01:55:24,144 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 834 transitions. Word has length 325 [2024-11-10 01:55:24,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:24,144 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 834 transitions. [2024-11-10 01:55:24,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 834 transitions. [2024-11-10 01:55:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-10 01:55:24,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:24,148 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:24,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 01:55:24,148 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:24,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:24,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1143574853, now seen corresponding path program 1 times [2024-11-10 01:55:24,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:24,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284078242] [2024-11-10 01:55:24,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:24,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:24,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:24,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:24,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:24,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-10 01:55:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:24,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-10 01:55:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:24,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-10 01:55:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:24,674 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:24,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:24,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284078242] [2024-11-10 01:55:24,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284078242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:24,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:24,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:24,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538624599] [2024-11-10 01:55:24,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:24,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:24,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:24,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:24,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:24,676 INFO L87 Difference]: Start difference. First operand 602 states and 834 transitions. Second operand has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:24,861 INFO L93 Difference]: Finished difference Result 970 states and 1348 transitions. [2024-11-10 01:55:24,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:24,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2024-11-10 01:55:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:24,864 INFO L225 Difference]: With dead ends: 970 [2024-11-10 01:55:24,864 INFO L226 Difference]: Without dead ends: 602 [2024-11-10 01:55:24,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:24,865 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 920 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:24,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 888 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-10 01:55:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-10 01:55:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 594 states have (on average 1.3821548821548821) internal successors, (821), 594 states have internal predecessors, (821), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 833 transitions. [2024-11-10 01:55:24,877 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 833 transitions. Word has length 326 [2024-11-10 01:55:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:24,877 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 833 transitions. [2024-11-10 01:55:24,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 833 transitions. [2024-11-10 01:55:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-10 01:55:24,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:24,880 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:24,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 01:55:24,881 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:24,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:24,881 INFO L85 PathProgramCache]: Analyzing trace with hash -315722596, now seen corresponding path program 1 times [2024-11-10 01:55:24,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:24,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868842663] [2024-11-10 01:55:24,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:24,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:25,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:25,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:25,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:25,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-10 01:55:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:25,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-10 01:55:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-10 01:55:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:25,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:25,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868842663] [2024-11-10 01:55:25,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868842663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:25,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:25,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:25,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498545541] [2024-11-10 01:55:25,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:25,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:25,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:25,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:25,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:25,409 INFO L87 Difference]: Start difference. First operand 602 states and 833 transitions. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:25,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:25,621 INFO L93 Difference]: Finished difference Result 970 states and 1346 transitions. [2024-11-10 01:55:25,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:25,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2024-11-10 01:55:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:25,623 INFO L225 Difference]: With dead ends: 970 [2024-11-10 01:55:25,623 INFO L226 Difference]: Without dead ends: 602 [2024-11-10 01:55:25,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:25,624 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 498 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:25,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 895 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-10 01:55:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-10 01:55:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 594 states have (on average 1.3804713804713804) internal successors, (820), 594 states have internal predecessors, (820), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 832 transitions. [2024-11-10 01:55:25,648 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 832 transitions. Word has length 327 [2024-11-10 01:55:25,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:25,649 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 832 transitions. [2024-11-10 01:55:25,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 832 transitions. [2024-11-10 01:55:25,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-10 01:55:25,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:25,656 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:25,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 01:55:25,656 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:25,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:25,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1579430326, now seen corresponding path program 1 times [2024-11-10 01:55:25,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:25,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417351089] [2024-11-10 01:55:25,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:25,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:26,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:26,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:26,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:26,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-10 01:55:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:26,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-10 01:55:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:26,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-10 01:55:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:26,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:26,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417351089] [2024-11-10 01:55:26,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417351089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:26,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:26,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:26,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265843007] [2024-11-10 01:55:26,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:26,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:26,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:26,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:26,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:26,568 INFO L87 Difference]: Start difference. First operand 602 states and 832 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:26,776 INFO L93 Difference]: Finished difference Result 970 states and 1344 transitions. [2024-11-10 01:55:26,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:26,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 328 [2024-11-10 01:55:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:26,779 INFO L225 Difference]: With dead ends: 970 [2024-11-10 01:55:26,779 INFO L226 Difference]: Without dead ends: 602 [2024-11-10 01:55:26,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:26,780 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 490 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:26,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 895 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-10 01:55:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-10 01:55:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 594 states have (on average 1.378787878787879) internal successors, (819), 594 states have internal predecessors, (819), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 831 transitions. [2024-11-10 01:55:26,792 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 831 transitions. Word has length 328 [2024-11-10 01:55:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:26,792 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 831 transitions. [2024-11-10 01:55:26,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 831 transitions. [2024-11-10 01:55:26,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-10 01:55:26,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:26,796 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:26,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 01:55:26,796 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:26,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:26,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1623454163, now seen corresponding path program 1 times [2024-11-10 01:55:26,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:26,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194523058] [2024-11-10 01:55:26,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:26,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:27,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:27,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:27,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:27,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-10 01:55:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:27,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-10 01:55:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:27,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-10 01:55:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:27,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:27,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194523058] [2024-11-10 01:55:27,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194523058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:27,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:27,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:27,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289178060] [2024-11-10 01:55:27,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:27,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:27,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:27,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:27,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:27,534 INFO L87 Difference]: Start difference. First operand 602 states and 831 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:27,714 INFO L93 Difference]: Finished difference Result 970 states and 1342 transitions. [2024-11-10 01:55:27,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:27,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 329 [2024-11-10 01:55:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:27,716 INFO L225 Difference]: With dead ends: 970 [2024-11-10 01:55:27,720 INFO L226 Difference]: Without dead ends: 602 [2024-11-10 01:55:27,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:27,722 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 865 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:27,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 904 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:27,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-10 01:55:27,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-10 01:55:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 594 states have (on average 1.3771043771043772) internal successors, (818), 594 states have internal predecessors, (818), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 830 transitions. [2024-11-10 01:55:27,741 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 830 transitions. Word has length 329 [2024-11-10 01:55:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:27,741 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 830 transitions. [2024-11-10 01:55:27,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 830 transitions. [2024-11-10 01:55:27,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-10 01:55:27,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:27,743 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:27,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 01:55:27,744 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:27,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:27,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1887242151, now seen corresponding path program 1 times [2024-11-10 01:55:27,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:27,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196760073] [2024-11-10 01:55:27,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:27,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-10 01:55:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 01:55:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-10 01:55:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,305 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:28,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:28,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196760073] [2024-11-10 01:55:28,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196760073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:28,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:28,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:28,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831722722] [2024-11-10 01:55:28,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:28,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:28,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:28,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:28,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:28,306 INFO L87 Difference]: Start difference. First operand 602 states and 830 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:28,477 INFO L93 Difference]: Finished difference Result 970 states and 1340 transitions. [2024-11-10 01:55:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:28,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 330 [2024-11-10 01:55:28,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:28,483 INFO L225 Difference]: With dead ends: 970 [2024-11-10 01:55:28,483 INFO L226 Difference]: Without dead ends: 602 [2024-11-10 01:55:28,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:28,484 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 467 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:28,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 911 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:55:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-10 01:55:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-10 01:55:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 594 states have (on average 1.3754208754208754) internal successors, (817), 594 states have internal predecessors, (817), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 829 transitions. [2024-11-10 01:55:28,496 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 829 transitions. Word has length 330 [2024-11-10 01:55:28,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:28,496 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 829 transitions. [2024-11-10 01:55:28,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 829 transitions. [2024-11-10 01:55:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-10 01:55:28,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:28,498 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:28,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 01:55:28,498 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:28,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:28,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1002136894, now seen corresponding path program 1 times [2024-11-10 01:55:28,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:28,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655460412] [2024-11-10 01:55:28,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:28,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:28,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:29,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-10 01:55:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:29,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-10 01:55:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:29,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-10 01:55:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:29,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:29,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655460412] [2024-11-10 01:55:29,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655460412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:29,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:29,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:29,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647383469] [2024-11-10 01:55:29,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:29,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:29,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:29,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:29,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:29,006 INFO L87 Difference]: Start difference. First operand 602 states and 829 transitions. Second operand has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:29,303 INFO L93 Difference]: Finished difference Result 970 states and 1338 transitions. [2024-11-10 01:55:29,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:29,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 331 [2024-11-10 01:55:29,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:29,305 INFO L225 Difference]: With dead ends: 970 [2024-11-10 01:55:29,306 INFO L226 Difference]: Without dead ends: 602 [2024-11-10 01:55:29,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:29,307 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 415 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:29,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 685 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-10 01:55:29,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-10 01:55:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 594 states have (on average 1.3737373737373737) internal successors, (816), 594 states have internal predecessors, (816), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 828 transitions. [2024-11-10 01:55:29,317 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 828 transitions. Word has length 331 [2024-11-10 01:55:29,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:29,318 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 828 transitions. [2024-11-10 01:55:29,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 828 transitions. [2024-11-10 01:55:29,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-10 01:55:29,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:29,320 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:29,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 01:55:29,320 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:29,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:29,320 INFO L85 PathProgramCache]: Analyzing trace with hash 43209496, now seen corresponding path program 1 times [2024-11-10 01:55:29,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:29,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452876492] [2024-11-10 01:55:29,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:29,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:30,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:30,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:30,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:30,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-10 01:55:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:30,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-10 01:55:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:30,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-10 01:55:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:30,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:30,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452876492] [2024-11-10 01:55:30,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452876492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:30,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:30,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:30,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368221092] [2024-11-10 01:55:30,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:30,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:30,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:30,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:30,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:30,429 INFO L87 Difference]: Start difference. First operand 602 states and 828 transitions. Second operand has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:30,604 INFO L93 Difference]: Finished difference Result 970 states and 1336 transitions. [2024-11-10 01:55:30,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:30,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332 [2024-11-10 01:55:30,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:30,607 INFO L225 Difference]: With dead ends: 970 [2024-11-10 01:55:30,607 INFO L226 Difference]: Without dead ends: 602 [2024-11-10 01:55:30,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:30,608 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 381 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:30,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 902 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:55:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-10 01:55:30,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-10 01:55:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 594 states have (on average 1.372053872053872) internal successors, (815), 594 states have internal predecessors, (815), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 827 transitions. [2024-11-10 01:55:30,621 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 827 transitions. Word has length 332 [2024-11-10 01:55:30,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:30,622 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 827 transitions. [2024-11-10 01:55:30,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 827 transitions. [2024-11-10 01:55:30,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-10 01:55:30,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:30,623 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:30,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 01:55:30,624 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:30,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:30,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1057065900, now seen corresponding path program 1 times [2024-11-10 01:55:30,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:30,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739962111] [2024-11-10 01:55:30,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:30,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:31,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:31,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:31,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:31,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-10 01:55:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:31,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-10 01:55:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:31,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-10 01:55:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:31,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:31,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739962111] [2024-11-10 01:55:31,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739962111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:31,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:31,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:31,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066094458] [2024-11-10 01:55:31,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:31,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:31,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:31,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:31,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:31,455 INFO L87 Difference]: Start difference. First operand 602 states and 827 transitions. Second operand has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:31,655 INFO L93 Difference]: Finished difference Result 970 states and 1334 transitions. [2024-11-10 01:55:31,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:31,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 333 [2024-11-10 01:55:31,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:31,658 INFO L225 Difference]: With dead ends: 970 [2024-11-10 01:55:31,658 INFO L226 Difference]: Without dead ends: 602 [2024-11-10 01:55:31,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:31,659 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 454 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:31,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 887 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:31,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-10 01:55:31,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-10 01:55:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 594 states have (on average 1.3703703703703705) internal successors, (814), 594 states have internal predecessors, (814), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:31,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 826 transitions. [2024-11-10 01:55:31,669 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 826 transitions. Word has length 333 [2024-11-10 01:55:31,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:31,670 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 826 transitions. [2024-11-10 01:55:31,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:31,670 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 826 transitions. [2024-11-10 01:55:31,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-10 01:55:31,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:31,672 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:31,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 01:55:31,672 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:31,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:31,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1542566097, now seen corresponding path program 1 times [2024-11-10 01:55:31,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:31,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129153257] [2024-11-10 01:55:31,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:31,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:32,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:32,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:32,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:32,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-10 01:55:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:32,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-10 01:55:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:32,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-10 01:55:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:32,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:32,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129153257] [2024-11-10 01:55:32,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129153257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:32,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:32,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:55:32,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29912325] [2024-11-10 01:55:32,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:32,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:55:32,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:32,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:55:32,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:32,760 INFO L87 Difference]: Start difference. First operand 602 states and 826 transitions. Second operand has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:32,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:32,960 INFO L93 Difference]: Finished difference Result 970 states and 1332 transitions. [2024-11-10 01:55:32,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:32,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 334 [2024-11-10 01:55:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:32,962 INFO L225 Difference]: With dead ends: 970 [2024-11-10 01:55:32,963 INFO L226 Difference]: Without dead ends: 602 [2024-11-10 01:55:32,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:32,964 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 851 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:32,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 880 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:55:32,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-10 01:55:32,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-10 01:55:32,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 594 states have (on average 1.3686868686868687) internal successors, (813), 594 states have internal predecessors, (813), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 825 transitions. [2024-11-10 01:55:32,974 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 825 transitions. Word has length 334 [2024-11-10 01:55:32,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:32,974 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 825 transitions. [2024-11-10 01:55:32,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:32,974 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 825 transitions. [2024-11-10 01:55:32,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-10 01:55:32,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:32,976 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:32,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 01:55:32,976 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:32,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:32,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1125792784, now seen corresponding path program 1 times [2024-11-10 01:55:32,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:32,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237803178] [2024-11-10 01:55:32,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:32,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:34,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:34,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:34,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:34,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-10 01:55:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:34,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-10 01:55:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:34,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-10 01:55:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:34,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:34,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237803178] [2024-11-10 01:55:34,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237803178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:34,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:34,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:34,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588109722] [2024-11-10 01:55:34,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:34,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:34,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:34,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:34,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:34,034 INFO L87 Difference]: Start difference. First operand 602 states and 825 transitions. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:34,313 INFO L93 Difference]: Finished difference Result 970 states and 1330 transitions. [2024-11-10 01:55:34,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:34,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335 [2024-11-10 01:55:34,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:34,316 INFO L225 Difference]: With dead ends: 970 [2024-11-10 01:55:34,319 INFO L226 Difference]: Without dead ends: 602 [2024-11-10 01:55:34,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:55:34,320 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 390 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:34,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 880 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-10 01:55:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-10 01:55:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 594 states have (on average 1.367003367003367) internal successors, (812), 594 states have internal predecessors, (812), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 01:55:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 824 transitions. [2024-11-10 01:55:34,336 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 824 transitions. Word has length 335 [2024-11-10 01:55:34,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:34,340 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 824 transitions. [2024-11-10 01:55:34,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:34,340 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 824 transitions. [2024-11-10 01:55:34,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-10 01:55:34,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:34,342 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:34,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 01:55:34,342 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:34,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:34,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1802060084, now seen corresponding path program 1 times [2024-11-10 01:55:34,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:34,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40423713] [2024-11-10 01:55:34,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:34,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:35,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:35,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:35,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:35,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-10 01:55:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:35,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-10 01:55:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:35,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-10 01:55:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40423713] [2024-11-10 01:55:35,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40423713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:35,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:35,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:55:35,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020643752] [2024-11-10 01:55:35,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:35,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:55:35,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:35,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:55:35,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:35,424 INFO L87 Difference]: Start difference. First operand 602 states and 824 transitions. Second operand has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:35,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:35,898 INFO L93 Difference]: Finished difference Result 1407 states and 1933 transitions. [2024-11-10 01:55:35,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:55:35,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 336 [2024-11-10 01:55:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:35,902 INFO L225 Difference]: With dead ends: 1407 [2024-11-10 01:55:35,902 INFO L226 Difference]: Without dead ends: 1039 [2024-11-10 01:55:35,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:55:35,904 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 586 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:35,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1652 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:55:35,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2024-11-10 01:55:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 925. [2024-11-10 01:55:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 914 states have (on average 1.363238512035011) internal successors, (1246), 914 states have internal predecessors, (1246), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:55:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1264 transitions. [2024-11-10 01:55:35,922 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1264 transitions. Word has length 336 [2024-11-10 01:55:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:35,922 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1264 transitions. [2024-11-10 01:55:35,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1264 transitions. [2024-11-10 01:55:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-10 01:55:35,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:35,925 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:35,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 01:55:35,925 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:35,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:35,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1808030278, now seen corresponding path program 1 times [2024-11-10 01:55:35,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:35,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754979495] [2024-11-10 01:55:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:35,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:37,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:37,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:37,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:37,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-10 01:55:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:37,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-10 01:55:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:37,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-10 01:55:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-10 01:55:37,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:37,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754979495] [2024-11-10 01:55:37,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754979495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:37,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:37,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:55:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521536565] [2024-11-10 01:55:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:37,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:55:37,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:37,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:55:37,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:37,068 INFO L87 Difference]: Start difference. First operand 925 states and 1264 transitions. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:37,348 INFO L93 Difference]: Finished difference Result 1575 states and 2129 transitions. [2024-11-10 01:55:37,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:55:37,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 337 [2024-11-10 01:55:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:37,352 INFO L225 Difference]: With dead ends: 1575 [2024-11-10 01:55:37,352 INFO L226 Difference]: Without dead ends: 925 [2024-11-10 01:55:37,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:55:37,353 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 463 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:37,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 676 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:55:37,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-10 01:55:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 925. [2024-11-10 01:55:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 914 states have (on average 1.3566739606126914) internal successors, (1240), 914 states have internal predecessors, (1240), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:55:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1258 transitions. [2024-11-10 01:55:37,376 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1258 transitions. Word has length 337 [2024-11-10 01:55:37,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:37,376 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1258 transitions. [2024-11-10 01:55:37,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:37,376 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1258 transitions. [2024-11-10 01:55:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-10 01:55:37,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:37,379 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:37,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 01:55:37,380 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:37,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:37,380 INFO L85 PathProgramCache]: Analyzing trace with hash -99214924, now seen corresponding path program 1 times [2024-11-10 01:55:37,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:37,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735926023] [2024-11-10 01:55:37,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:37,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:38,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:38,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:38,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:38,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-10 01:55:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:38,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-10 01:55:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:38,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-10 01:55:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:38,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:38,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735926023] [2024-11-10 01:55:38,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735926023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:38,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:38,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:55:38,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391480905] [2024-11-10 01:55:38,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:38,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:55:38,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:38,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:55:38,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:38,440 INFO L87 Difference]: Start difference. First operand 925 states and 1258 transitions. Second operand has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:39,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:39,052 INFO L93 Difference]: Finished difference Result 1316 states and 1794 transitions. [2024-11-10 01:55:39,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:55:39,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 339 [2024-11-10 01:55:39,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:39,057 INFO L225 Difference]: With dead ends: 1316 [2024-11-10 01:55:39,057 INFO L226 Difference]: Without dead ends: 948 [2024-11-10 01:55:39,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:55:39,061 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 1003 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:39,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 1310 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:55:39,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2024-11-10 01:55:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 926. [2024-11-10 01:55:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 915 states have (on average 1.3562841530054646) internal successors, (1241), 915 states have internal predecessors, (1241), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 01:55:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1259 transitions. [2024-11-10 01:55:39,090 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1259 transitions. Word has length 339 [2024-11-10 01:55:39,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:39,091 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1259 transitions. [2024-11-10 01:55:39,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.0) internal successors, (312), 6 states have internal predecessors, (312), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1259 transitions. [2024-11-10 01:55:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-10 01:55:39,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:39,101 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:39,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 01:55:39,102 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:39,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:39,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1993776678, now seen corresponding path program 1 times [2024-11-10 01:55:39,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:39,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327836405] [2024-11-10 01:55:39,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:39,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:40,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:55:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:40,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 01:55:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:40,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:40,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-10 01:55:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:40,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-10 01:55:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:40,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-10 01:55:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-10 01:55:40,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:40,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327836405] [2024-11-10 01:55:40,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327836405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:40,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:40,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:55:40,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807904335] [2024-11-10 01:55:40,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:40,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:55:40,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:40,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:55:40,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:55:40,533 INFO L87 Difference]: Start difference. First operand 926 states and 1259 transitions. Second operand has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:41,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:41,247 INFO L93 Difference]: Finished difference Result 2086 states and 2829 transitions. [2024-11-10 01:55:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:55:41,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 339 [2024-11-10 01:55:41,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:41,252 INFO L225 Difference]: With dead ends: 2086 [2024-11-10 01:55:41,252 INFO L226 Difference]: Without dead ends: 1606 [2024-11-10 01:55:41,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:55:41,254 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 777 mSDsluCounter, 5372 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 6415 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:41,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 6415 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:55:41,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2024-11-10 01:55:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 995. [2024-11-10 01:55:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 981 states have (on average 1.3588175331294596) internal successors, (1333), 981 states have internal predecessors, (1333), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 01:55:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1357 transitions. [2024-11-10 01:55:41,273 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1357 transitions. Word has length 339 [2024-11-10 01:55:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:41,273 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1357 transitions. [2024-11-10 01:55:41,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.625) internal successors, (261), 8 states have internal predecessors, (261), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:55:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1357 transitions. [2024-11-10 01:55:41,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-10 01:55:41,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:41,275 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:41,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 01:55:41,276 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:41,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:41,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1541446851, now seen corresponding path program 1 times [2024-11-10 01:55:41,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:41,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115297958] [2024-11-10 01:55:41,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:41,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:42,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 01:55:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:42,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 01:55:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:42,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 01:55:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:42,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-10 01:55:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:42,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-10 01:55:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:42,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-10 01:55:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-10 01:55:42,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:42,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115297958] [2024-11-10 01:55:42,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115297958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:42,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:42,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:55:42,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884535752] [2024-11-10 01:55:42,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:42,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:55:42,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:42,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:55:42,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:55:42,561 INFO L87 Difference]: Start difference. First operand 995 states and 1357 transitions. Second operand has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:43,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:43,127 INFO L93 Difference]: Finished difference Result 1846 states and 2506 transitions. [2024-11-10 01:55:43,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:55:43,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 340 [2024-11-10 01:55:43,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:43,130 INFO L225 Difference]: With dead ends: 1846 [2024-11-10 01:55:43,130 INFO L226 Difference]: Without dead ends: 1003 [2024-11-10 01:55:43,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:55:43,132 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 511 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:43,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1313 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:55:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2024-11-10 01:55:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 999. [2024-11-10 01:55:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 985 states have (on average 1.3573604060913707) internal successors, (1337), 985 states have internal predecessors, (1337), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 01:55:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1361 transitions. [2024-11-10 01:55:43,149 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1361 transitions. Word has length 340 [2024-11-10 01:55:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:43,149 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1361 transitions. [2024-11-10 01:55:43,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:55:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1361 transitions. [2024-11-10 01:55:43,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-10 01:55:43,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:43,152 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:43,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-10 01:55:43,152 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:43,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:43,153 INFO L85 PathProgramCache]: Analyzing trace with hash -773214713, now seen corresponding path program 1 times [2024-11-10 01:55:43,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:43,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448769899] [2024-11-10 01:55:43,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:43,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:44,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:55:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:44,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 01:55:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 01:55:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:44,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-10 01:55:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:44,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-10 01:55:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:44,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-10 01:55:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-10 01:55:44,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:44,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448769899] [2024-11-10 01:55:44,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448769899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:44,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:44,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:55:44,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231870414] [2024-11-10 01:55:44,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:44,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:55:44,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:44,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:55:44,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:55:44,773 INFO L87 Difference]: Start difference. First operand 999 states and 1361 transitions. Second operand has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 states have internal predecessors, (272), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 01:55:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:45,856 INFO L93 Difference]: Finished difference Result 2424 states and 3263 transitions. [2024-11-10 01:55:45,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:55:45,856 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 states have internal predecessors, (272), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 342 [2024-11-10 01:55:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:45,866 INFO L225 Difference]: With dead ends: 2424 [2024-11-10 01:55:45,866 INFO L226 Difference]: Without dead ends: 1724 [2024-11-10 01:55:45,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-10 01:55:45,872 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 1507 mSDsluCounter, 2258 mSDsCounter, 0 mSdLazyCounter, 1977 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:45,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 2766 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1977 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 01:55:45,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2024-11-10 01:55:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1115. [2024-11-10 01:55:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1097 states have (on average 1.3682771194165908) internal successors, (1501), 1097 states have internal predecessors, (1501), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 01:55:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1533 transitions. [2024-11-10 01:55:45,924 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1533 transitions. Word has length 342 [2024-11-10 01:55:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:45,924 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1533 transitions. [2024-11-10 01:55:45,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 states have internal predecessors, (272), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 01:55:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1533 transitions. [2024-11-10 01:55:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-10 01:55:45,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:45,931 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:45,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-10 01:55:45,932 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:45,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:45,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1687045181, now seen corresponding path program 1 times [2024-11-10 01:55:45,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:45,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135153932] [2024-11-10 01:55:45,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:45,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:55:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:47,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 01:55:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:47,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 01:55:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:47,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-10 01:55:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:47,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-10 01:55:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:47,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-11-10 01:55:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 4 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:47,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:47,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135153932] [2024-11-10 01:55:47,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135153932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:55:47,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567992331] [2024-11-10 01:55:47,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:47,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:55:47,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:55:47,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:55:47,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 01:55:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:48,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 2054 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 01:55:48,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:55:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-10 01:55:48,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 01:55:48,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567992331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:48,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 01:55:48,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-10 01:55:48,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604763121] [2024-11-10 01:55:48,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:48,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:55:48,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:48,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:55:48,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:55:48,965 INFO L87 Difference]: Start difference. First operand 1115 states and 1533 transitions. Second operand has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 01:55:49,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:49,414 INFO L93 Difference]: Finished difference Result 2049 states and 2810 transitions. [2024-11-10 01:55:49,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:55:49,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 344 [2024-11-10 01:55:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:49,417 INFO L225 Difference]: With dead ends: 2049 [2024-11-10 01:55:49,418 INFO L226 Difference]: Without dead ends: 1131 [2024-11-10 01:55:49,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:55:49,419 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 491 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:49,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1309 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:55:49,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2024-11-10 01:55:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1127. [2024-11-10 01:55:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1109 states have (on average 1.3606853020739405) internal successors, (1509), 1109 states have internal predecessors, (1509), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 01:55:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1541 transitions. [2024-11-10 01:55:49,438 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1541 transitions. Word has length 344 [2024-11-10 01:55:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:49,439 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1541 transitions. [2024-11-10 01:55:49,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 states have internal predecessors, (258), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 01:55:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1541 transitions. [2024-11-10 01:55:49,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-11-10 01:55:49,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:49,441 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:49,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 01:55:49,645 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,SelfDestructingSolverStorable36 [2024-11-10 01:55:49,648 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:49,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1058277315, now seen corresponding path program 1 times [2024-11-10 01:55:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:49,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083142697] [2024-11-10 01:55:49,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:49,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:51,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:55:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:51,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:55:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:51,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 01:55:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:51,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-10 01:55:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:51,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-10 01:55:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:51,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-11-10 01:55:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-10 01:55:51,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:51,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083142697] [2024-11-10 01:55:51,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083142697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:51,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:55:51,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:55:51,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170684928] [2024-11-10 01:55:51,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:51,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:55:51,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:51,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:55:51,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:55:51,017 INFO L87 Difference]: Start difference. First operand 1127 states and 1541 transitions. Second operand has 8 states, 8 states have (on average 36.375) internal successors, (291), 8 states have internal predecessors, (291), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 01:55:52,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:52,147 INFO L93 Difference]: Finished difference Result 2849 states and 3871 transitions. [2024-11-10 01:55:52,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 01:55:52,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 36.375) internal successors, (291), 8 states have internal predecessors, (291), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 348 [2024-11-10 01:55:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:52,153 INFO L225 Difference]: With dead ends: 2849 [2024-11-10 01:55:52,153 INFO L226 Difference]: Without dead ends: 1991 [2024-11-10 01:55:52,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-10 01:55:52,155 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 901 mSDsluCounter, 2783 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 3429 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:52,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 3429 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 01:55:52,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2024-11-10 01:55:52,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1967. [2024-11-10 01:55:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1939 states have (on average 1.3460546673543063) internal successors, (2610), 1939 states have internal predecessors, (2610), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 01:55:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 2662 transitions. [2024-11-10 01:55:52,228 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 2662 transitions. Word has length 348 [2024-11-10 01:55:52,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:52,229 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 2662 transitions. [2024-11-10 01:55:52,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 36.375) internal successors, (291), 8 states have internal predecessors, (291), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 01:55:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2662 transitions. [2024-11-10 01:55:52,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-11-10 01:55:52,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:52,235 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:52,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-10 01:55:52,235 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:52,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash 313809437, now seen corresponding path program 1 times [2024-11-10 01:55:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:52,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107363576] [2024-11-10 01:55:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:52,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:54,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:55:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:54,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:55:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:54,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 01:55:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:54,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-10 01:55:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:54,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-10 01:55:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:54,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-10 01:55:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:54,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:54,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107363576] [2024-11-10 01:55:54,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107363576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:55:54,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799310186] [2024-11-10 01:55:54,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:54,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:55:54,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:55:54,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:55:54,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 01:55:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:55,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 2062 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 01:55:55,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:55:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-10 01:55:55,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 01:55:55,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799310186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:55:55,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 01:55:55,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-10 01:55:55,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149635122] [2024-11-10 01:55:55,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:55,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:55:55,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:55,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:55:55,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:55:55,459 INFO L87 Difference]: Start difference. First operand 1967 states and 2662 transitions. Second operand has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 01:55:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:55:55,918 INFO L93 Difference]: Finished difference Result 2808 states and 3790 transitions. [2024-11-10 01:55:55,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:55:55,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 348 [2024-11-10 01:55:55,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:55:55,925 INFO L225 Difference]: With dead ends: 2808 [2024-11-10 01:55:55,925 INFO L226 Difference]: Without dead ends: 1155 [2024-11-10 01:55:55,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:55:55,933 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 485 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:55:55,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1291 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 01:55:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-10 01:55:55,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1131. [2024-11-10 01:55:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1113 states have (on average 1.3414195867026055) internal successors, (1493), 1113 states have internal predecessors, (1493), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 01:55:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1525 transitions. [2024-11-10 01:55:55,982 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1525 transitions. Word has length 348 [2024-11-10 01:55:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:55:55,983 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1525 transitions. [2024-11-10 01:55:55,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 01:55:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1525 transitions. [2024-11-10 01:55:55,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-10 01:55:55,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:55:55,990 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:55:56,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 01:55:56,191 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,SelfDestructingSolverStorable38 [2024-11-10 01:55:56,191 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:55:56,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:55:56,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1234905925, now seen corresponding path program 1 times [2024-11-10 01:55:56,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:55:56,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860058582] [2024-11-10 01:55:56,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:56,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:55:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:58,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:55:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:58,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:55:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:58,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:55:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:58,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-10 01:55:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:58,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-10 01:55:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:58,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-10 01:55:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:58,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:55:58,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860058582] [2024-11-10 01:55:58,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860058582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:55:58,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288055667] [2024-11-10 01:55:58,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:55:58,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:55:58,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:55:58,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:55:58,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 01:55:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:55:59,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 2064 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 01:55:59,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:55:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:59,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 01:55:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:55:59,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288055667] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 01:55:59,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 01:55:59,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 8] total 22 [2024-11-10 01:55:59,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515978832] [2024-11-10 01:55:59,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:55:59,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 01:55:59,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:55:59,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 01:55:59,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-11-10 01:55:59,959 INFO L87 Difference]: Start difference. First operand 1131 states and 1525 transitions. Second operand has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:00,508 INFO L93 Difference]: Finished difference Result 1941 states and 2624 transitions. [2024-11-10 01:56:00,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:56:00,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 350 [2024-11-10 01:56:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:00,512 INFO L225 Difference]: With dead ends: 1941 [2024-11-10 01:56:00,515 INFO L226 Difference]: Without dead ends: 1535 [2024-11-10 01:56:00,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 702 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2024-11-10 01:56:00,517 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 354 mSDsluCounter, 3651 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 4456 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:00,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 4456 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:56:00,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-11-10 01:56:00,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1331. [2024-11-10 01:56:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1309 states have (on average 1.33231474407945) internal successors, (1744), 1309 states have internal predecessors, (1744), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 01:56:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1784 transitions. [2024-11-10 01:56:00,553 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1784 transitions. Word has length 350 [2024-11-10 01:56:00,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:00,554 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1784 transitions. [2024-11-10 01:56:00,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1784 transitions. [2024-11-10 01:56:00,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-10 01:56:00,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:00,564 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:00,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 01:56:00,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-10 01:56:00,765 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:00,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash -80631322, now seen corresponding path program 1 times [2024-11-10 01:56:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:00,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831424843] [2024-11-10 01:56:00,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:01,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:56:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:01,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:56:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:01,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:56:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:01,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-10 01:56:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:01,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-10 01:56:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:01,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-10 01:56:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-10 01:56:01,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:01,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831424843] [2024-11-10 01:56:01,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831424843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:01,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:01,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:56:01,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035202154] [2024-11-10 01:56:01,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:01,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:56:01,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:01,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:56:01,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:01,342 INFO L87 Difference]: Start difference. First operand 1331 states and 1784 transitions. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:01,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:01,539 INFO L93 Difference]: Finished difference Result 2284 states and 3067 transitions. [2024-11-10 01:56:01,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:56:01,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 350 [2024-11-10 01:56:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:01,545 INFO L225 Difference]: With dead ends: 2284 [2024-11-10 01:56:01,545 INFO L226 Difference]: Without dead ends: 1443 [2024-11-10 01:56:01,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:56:01,547 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 16 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:01,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1802 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2024-11-10 01:56:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1443. [2024-11-10 01:56:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1421 states have (on average 1.3399014778325122) internal successors, (1904), 1421 states have internal predecessors, (1904), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 01:56:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 1944 transitions. [2024-11-10 01:56:01,580 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 1944 transitions. Word has length 350 [2024-11-10 01:56:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:01,581 INFO L471 AbstractCegarLoop]: Abstraction has 1443 states and 1944 transitions. [2024-11-10 01:56:01,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1944 transitions. [2024-11-10 01:56:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-10 01:56:01,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:01,586 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:01,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-10 01:56:01,586 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:01,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1543050058, now seen corresponding path program 1 times [2024-11-10 01:56:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:01,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334636102] [2024-11-10 01:56:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:01,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:56:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:56:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:56:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 01:56:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-10 01:56:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-10 01:56:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:03,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:03,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334636102] [2024-11-10 01:56:03,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334636102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:03,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:03,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:56:03,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670094979] [2024-11-10 01:56:03,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:03,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:56:03,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:03,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:56:03,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:56:03,957 INFO L87 Difference]: Start difference. First operand 1443 states and 1944 transitions. Second operand has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:04,741 INFO L93 Difference]: Finished difference Result 3826 states and 5157 transitions. [2024-11-10 01:56:04,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:56:04,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 351 [2024-11-10 01:56:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:04,746 INFO L225 Difference]: With dead ends: 3826 [2024-11-10 01:56:04,747 INFO L226 Difference]: Without dead ends: 3164 [2024-11-10 01:56:04,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:56:04,748 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1148 mSDsluCounter, 3466 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 4149 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:04,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 4149 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 01:56:04,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2024-11-10 01:56:04,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 2315. [2024-11-10 01:56:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 2281 states have (on average 1.3406400701446735) internal successors, (3058), 2281 states have internal predecessors, (3058), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 01:56:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3122 transitions. [2024-11-10 01:56:04,787 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3122 transitions. Word has length 351 [2024-11-10 01:56:04,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:04,788 INFO L471 AbstractCegarLoop]: Abstraction has 2315 states and 3122 transitions. [2024-11-10 01:56:04,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3122 transitions. [2024-11-10 01:56:04,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-10 01:56:04,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:04,791 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:04,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-10 01:56:04,792 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:04,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:04,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2075948431, now seen corresponding path program 1 times [2024-11-10 01:56:04,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:04,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255527024] [2024-11-10 01:56:04,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:04,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:56:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:56:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:56:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-10 01:56:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-10 01:56:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-10 01:56:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-10 01:56:05,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:05,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255527024] [2024-11-10 01:56:05,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255527024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:05,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:05,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:56:05,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138039734] [2024-11-10 01:56:05,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:05,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:56:05,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:05,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:56:05,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:05,463 INFO L87 Difference]: Start difference. First operand 2315 states and 3122 transitions. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:05,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:05,658 INFO L93 Difference]: Finished difference Result 3947 states and 5307 transitions. [2024-11-10 01:56:05,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:56:05,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 351 [2024-11-10 01:56:05,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:05,663 INFO L225 Difference]: With dead ends: 3947 [2024-11-10 01:56:05,663 INFO L226 Difference]: Without dead ends: 2339 [2024-11-10 01:56:05,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:56:05,665 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 0 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:05,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1354 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2024-11-10 01:56:05,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2339. [2024-11-10 01:56:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2339 states, 2305 states have (on average 1.3370932754880693) internal successors, (3082), 2305 states have internal predecessors, (3082), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 01:56:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 3146 transitions. [2024-11-10 01:56:05,715 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 3146 transitions. Word has length 351 [2024-11-10 01:56:05,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:05,715 INFO L471 AbstractCegarLoop]: Abstraction has 2339 states and 3146 transitions. [2024-11-10 01:56:05,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 01:56:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 3146 transitions. [2024-11-10 01:56:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-10 01:56:05,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:05,719 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:05,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-10 01:56:05,719 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:05,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:05,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1999178972, now seen corresponding path program 1 times [2024-11-10 01:56:05,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:05,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521026053] [2024-11-10 01:56:05,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:05,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:56:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:56:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:56:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-10 01:56:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-10 01:56:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-10 01:56:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 01:56:08,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:08,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521026053] [2024-11-10 01:56:08,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521026053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:08,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:08,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:56:08,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506640666] [2024-11-10 01:56:08,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:08,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:56:08,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:08,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:56:08,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:56:08,568 INFO L87 Difference]: Start difference. First operand 2339 states and 3146 transitions. Second operand has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 01:56:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:09,340 INFO L93 Difference]: Finished difference Result 4366 states and 5871 transitions. [2024-11-10 01:56:09,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:56:09,341 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 351 [2024-11-10 01:56:09,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:09,346 INFO L225 Difference]: With dead ends: 4366 [2024-11-10 01:56:09,346 INFO L226 Difference]: Without dead ends: 3117 [2024-11-10 01:56:09,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:56:09,349 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 1607 mSDsluCounter, 3688 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1612 SdHoareTripleChecker+Valid, 4365 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:09,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1612 Valid, 4365 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 01:56:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3117 states. [2024-11-10 01:56:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3117 to 2471. [2024-11-10 01:56:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 2431 states have (on average 1.3336075689016866) internal successors, (3242), 2431 states have internal predecessors, (3242), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 01:56:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3318 transitions. [2024-11-10 01:56:09,395 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3318 transitions. Word has length 351 [2024-11-10 01:56:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:09,396 INFO L471 AbstractCegarLoop]: Abstraction has 2471 states and 3318 transitions. [2024-11-10 01:56:09,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 01:56:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3318 transitions. [2024-11-10 01:56:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-10 01:56:09,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:09,400 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:09,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-10 01:56:09,401 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:09,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:09,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1821441639, now seen corresponding path program 1 times [2024-11-10 01:56:09,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:09,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217597732] [2024-11-10 01:56:09,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:09,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:56:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:56:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:56:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-10 01:56:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-10 01:56:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-10 01:56:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 54 proven. 17 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-10 01:56:11,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:11,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217597732] [2024-11-10 01:56:11,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217597732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:56:11,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574666160] [2024-11-10 01:56:11,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:11,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:56:11,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:56:11,407 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:56:11,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 01:56:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:12,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 2065 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 01:56:12,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:56:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-10 01:56:12,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 01:56:12,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574666160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:12,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 01:56:12,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-11-10 01:56:12,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492389449] [2024-11-10 01:56:12,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:12,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:56:12,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:12,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:56:12,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:56:12,857 INFO L87 Difference]: Start difference. First operand 2471 states and 3318 transitions. Second operand has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:13,446 INFO L93 Difference]: Finished difference Result 4551 states and 6134 transitions. [2024-11-10 01:56:13,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 01:56:13,446 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 351 [2024-11-10 01:56:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:13,451 INFO L225 Difference]: With dead ends: 4551 [2024-11-10 01:56:13,452 INFO L226 Difference]: Without dead ends: 3415 [2024-11-10 01:56:13,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:56:13,454 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 1278 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:13,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 1578 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 01:56:13,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3415 states. [2024-11-10 01:56:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3415 to 3067. [2024-11-10 01:56:13,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 3012 states have (on average 1.3237051792828685) internal successors, (3987), 3012 states have internal predecessors, (3987), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-10 01:56:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4093 transitions. [2024-11-10 01:56:13,500 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4093 transitions. Word has length 351 [2024-11-10 01:56:13,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:13,501 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 4093 transitions. [2024-11-10 01:56:13,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4093 transitions. [2024-11-10 01:56:13,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-10 01:56:13,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:13,505 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:13,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 01:56:13,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:56:13,710 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:13,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:13,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1141268206, now seen corresponding path program 1 times [2024-11-10 01:56:13,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:13,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295642100] [2024-11-10 01:56:13,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:13,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:56:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:56:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:56:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 01:56:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-10 01:56:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-10 01:56:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-10 01:56:15,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:15,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295642100] [2024-11-10 01:56:15,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295642100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:15,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:15,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:56:15,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5542727] [2024-11-10 01:56:15,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:15,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:56:15,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:15,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:56:15,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:56:15,406 INFO L87 Difference]: Start difference. First operand 3067 states and 4093 transitions. Second operand has 9 states, 9 states have (on average 31.22222222222222) internal successors, (281), 9 states have internal predecessors, (281), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 01:56:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:16,646 INFO L93 Difference]: Finished difference Result 6663 states and 8807 transitions. [2024-11-10 01:56:16,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 01:56:16,646 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 31.22222222222222) internal successors, (281), 9 states have internal predecessors, (281), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 352 [2024-11-10 01:56:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:16,653 INFO L225 Difference]: With dead ends: 6663 [2024-11-10 01:56:16,654 INFO L226 Difference]: Without dead ends: 4927 [2024-11-10 01:56:16,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:56:16,657 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 1398 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 2046 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:16,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 2749 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2046 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 01:56:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4927 states. [2024-11-10 01:56:16,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4927 to 3095. [2024-11-10 01:56:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3095 states, 3040 states have (on average 1.325328947368421) internal successors, (4029), 3040 states have internal predecessors, (4029), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-10 01:56:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 3095 states and 4135 transitions. [2024-11-10 01:56:16,721 INFO L78 Accepts]: Start accepts. Automaton has 3095 states and 4135 transitions. Word has length 352 [2024-11-10 01:56:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:16,722 INFO L471 AbstractCegarLoop]: Abstraction has 3095 states and 4135 transitions. [2024-11-10 01:56:16,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.22222222222222) internal successors, (281), 9 states have internal predecessors, (281), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 01:56:16,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 4135 transitions. [2024-11-10 01:56:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-10 01:56:16,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:16,731 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:16,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-10 01:56:16,731 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:16,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:16,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1062090638, now seen corresponding path program 1 times [2024-11-10 01:56:16,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:16,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95837653] [2024-11-10 01:56:16,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:16,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:22,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:56:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:22,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:56:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:22,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:56:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:22,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-10 01:56:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:22,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-10 01:56:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:22,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-10 01:56:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 51 proven. 36 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-10 01:56:22,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:22,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95837653] [2024-11-10 01:56:22,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95837653] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:56:22,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171156992] [2024-11-10 01:56:22,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:22,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:56:22,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:56:22,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:56:22,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 01:56:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:23,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 2066 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 01:56:23,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:56:23,676 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-10 01:56:23,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 01:56:23,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171156992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:23,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 01:56:23,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2024-11-10 01:56:23,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271200087] [2024-11-10 01:56:23,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:23,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:56:23,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:23,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:56:23,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-10 01:56:23,678 INFO L87 Difference]: Start difference. First operand 3095 states and 4135 transitions. Second operand has 6 states, 5 states have (on average 60.6) internal successors, (303), 6 states have internal predecessors, (303), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 01:56:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:23,944 INFO L93 Difference]: Finished difference Result 5371 states and 7174 transitions. [2024-11-10 01:56:23,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:56:23,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 60.6) internal successors, (303), 6 states have internal predecessors, (303), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 352 [2024-11-10 01:56:23,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:23,951 INFO L225 Difference]: With dead ends: 5371 [2024-11-10 01:56:23,951 INFO L226 Difference]: Without dead ends: 3095 [2024-11-10 01:56:23,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-10 01:56:23,956 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 0 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2247 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:23,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2247 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:56:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2024-11-10 01:56:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 3095. [2024-11-10 01:56:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3095 states, 3040 states have (on average 1.3161184210526315) internal successors, (4001), 3040 states have internal predecessors, (4001), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-10 01:56:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 3095 states and 4107 transitions. [2024-11-10 01:56:24,009 INFO L78 Accepts]: Start accepts. Automaton has 3095 states and 4107 transitions. Word has length 352 [2024-11-10 01:56:24,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:24,009 INFO L471 AbstractCegarLoop]: Abstraction has 3095 states and 4107 transitions. [2024-11-10 01:56:24,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 60.6) internal successors, (303), 6 states have internal predecessors, (303), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 01:56:24,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 4107 transitions. [2024-11-10 01:56:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-10 01:56:24,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:24,015 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:24,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 01:56:24,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-11-10 01:56:24,221 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:24,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2109548126, now seen corresponding path program 1 times [2024-11-10 01:56:24,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:24,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079913634] [2024-11-10 01:56:24,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:24,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:25,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:56:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:25,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:56:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:25,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 01:56:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-10 01:56:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:25,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-10 01:56:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:25,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-10 01:56:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:25,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:25,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079913634] [2024-11-10 01:56:25,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079913634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:56:25,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:56:25,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:56:25,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844151767] [2024-11-10 01:56:25,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:56:25,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:56:25,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:56:25,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:56:25,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:56:25,674 INFO L87 Difference]: Start difference. First operand 3095 states and 4107 transitions. Second operand has 6 states, 6 states have (on average 54.5) internal successors, (327), 6 states have internal predecessors, (327), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:26,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:56:26,291 INFO L93 Difference]: Finished difference Result 5531 states and 7321 transitions. [2024-11-10 01:56:26,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 01:56:26,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 54.5) internal successors, (327), 6 states have internal predecessors, (327), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 354 [2024-11-10 01:56:26,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:56:26,297 INFO L225 Difference]: With dead ends: 5531 [2024-11-10 01:56:26,298 INFO L226 Difference]: Without dead ends: 4495 [2024-11-10 01:56:26,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 01:56:26,300 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 693 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:56:26,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 1841 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 01:56:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2024-11-10 01:56:26,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 4028. [2024-11-10 01:56:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4028 states, 3973 states have (on average 1.2977598791844953) internal successors, (5156), 3973 states have internal predecessors, (5156), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-10 01:56:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 5262 transitions. [2024-11-10 01:56:26,381 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 5262 transitions. Word has length 354 [2024-11-10 01:56:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:56:26,381 INFO L471 AbstractCegarLoop]: Abstraction has 4028 states and 5262 transitions. [2024-11-10 01:56:26,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.5) internal successors, (327), 6 states have internal predecessors, (327), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 01:56:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 5262 transitions. [2024-11-10 01:56:26,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-10 01:56:26,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:56:26,387 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:56:26,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-10 01:56:26,387 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:56:26,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:56:26,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2000006984, now seen corresponding path program 1 times [2024-11-10 01:56:26,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:56:26,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887605014] [2024-11-10 01:56:26,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:26,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:56:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:29,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 01:56:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:29,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 01:56:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:29,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 01:56:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:29,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-10 01:56:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:29,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-10 01:56:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:29,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2024-11-10 01:56:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:56:29,206 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-10 01:56:29,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:56:29,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887605014] [2024-11-10 01:56:29,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887605014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 01:56:29,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419601544] [2024-11-10 01:56:29,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:56:29,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 01:56:29,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:56:29,208 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 01:56:29,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process