./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19daebdfafed51668fa57cd9e9dbb1892c2070de71da48d425d8df389215d260 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:55:24,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:55:24,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:55:24,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:55:24,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:55:24,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:55:24,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:55:24,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:55:24,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:55:24,468 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:55:24,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:55:24,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:55:24,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:55:24,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:55:24,470 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:55:24,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:55:24,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:55:24,473 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:55:24,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:55:24,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:55:24,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:55:24,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:55:24,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:55:24,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:55:24,475 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:55:24,475 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:55:24,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:55:24,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:55:24,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:55:24,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:55:24,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:55:24,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:55:24,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:55:24,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:55:24,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:55:24,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:55:24,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:55:24,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:55:24,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:55:24,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:55:24,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:55:24,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:55:24,480 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19daebdfafed51668fa57cd9e9dbb1892c2070de71da48d425d8df389215d260 [2024-10-12 19:55:24,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:55:24,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:55:24,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:55:24,814 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:55:24,815 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:55:24,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-2.c [2024-10-12 19:55:26,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:55:26,537 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:55:26,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-2.c [2024-10-12 19:55:26,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4dd40d53/b41764e7420444e796e0374ac26b563e/FLAG433427e2a [2024-10-12 19:55:26,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4dd40d53/b41764e7420444e796e0374ac26b563e [2024-10-12 19:55:26,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:55:26,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:55:26,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:55:26,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:55:26,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:55:26,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:55:26" (1/1) ... [2024-10-12 19:55:26,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@241d1467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:26, skipping insertion in model container [2024-10-12 19:55:26,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:55:26" (1/1) ... [2024-10-12 19:55:26,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:55:26,832 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-2.c[671,684] [2024-10-12 19:55:26,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:55:26,960 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:55:26,970 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-2.c[671,684] [2024-10-12 19:55:27,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:55:27,068 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:55:27,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:27 WrapperNode [2024-10-12 19:55:27,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:55:27,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:55:27,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:55:27,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:55:27,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:27" (1/1) ... [2024-10-12 19:55:27,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:27" (1/1) ... [2024-10-12 19:55:27,133 INFO L138 Inliner]: procedures = 44, calls = 56, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 645 [2024-10-12 19:55:27,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:55:27,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:55:27,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:55:27,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:55:27,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:27" (1/1) ... [2024-10-12 19:55:27,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:27" (1/1) ... [2024-10-12 19:55:27,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:27" (1/1) ... [2024-10-12 19:55:27,174 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 19:55:27,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:27" (1/1) ... [2024-10-12 19:55:27,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:27" (1/1) ... [2024-10-12 19:55:27,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:27" (1/1) ... [2024-10-12 19:55:27,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:27" (1/1) ... [2024-10-12 19:55:27,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:27" (1/1) ... [2024-10-12 19:55:27,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:27" (1/1) ... [2024-10-12 19:55:27,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:55:27,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:55:27,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:55:27,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:55:27,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:27" (1/1) ... [2024-10-12 19:55:27,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:55:27,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:55:27,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:55:27,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:55:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:55:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-12 19:55:27,299 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-12 19:55:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 19:55:27,299 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 19:55:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 19:55:27,300 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 19:55:27,300 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 19:55:27,300 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 19:55:27,301 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 19:55:27,302 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 19:55:27,302 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 19:55:27,302 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 19:55:27,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:55:27,302 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 19:55:27,302 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 19:55:27,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:55:27,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:55:27,428 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:55:27,432 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:55:28,180 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-10-12 19:55:28,180 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:55:28,254 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:55:28,254 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-12 19:55:28,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:55:28 BoogieIcfgContainer [2024-10-12 19:55:28,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:55:28,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:55:28,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:55:28,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:55:28,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:55:26" (1/3) ... [2024-10-12 19:55:28,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501b1b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:55:28, skipping insertion in model container [2024-10-12 19:55:28,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:27" (2/3) ... [2024-10-12 19:55:28,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501b1b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:55:28, skipping insertion in model container [2024-10-12 19:55:28,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:55:28" (3/3) ... [2024-10-12 19:55:28,268 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.08.cil-2.c [2024-10-12 19:55:28,285 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:55:28,286 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:55:28,375 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:55:28,382 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;@22207a23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:55:28,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:55:28,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 264 states, 231 states have (on average 1.7272727272727273) internal successors, (399), 235 states have internal predecessors, (399), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 19:55:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:55:28,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:28,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:55:28,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:28,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:28,411 INFO L85 PathProgramCache]: Analyzing trace with hash -304754819, now seen corresponding path program 1 times [2024-10-12 19:55:28,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:28,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421222359] [2024-10-12 19:55:28,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:28,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:28,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:28,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:55:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:29,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:55:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:29,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:55:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:29,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:55:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:55:29,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:29,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421222359] [2024-10-12 19:55:29,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421222359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:29,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:29,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:55:29,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823828614] [2024-10-12 19:55:29,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:29,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:55:29,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:29,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:55:29,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:55:29,130 INFO L87 Difference]: Start difference. First operand has 264 states, 231 states have (on average 1.7272727272727273) internal successors, (399), 235 states have internal predecessors, (399), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:30,636 INFO L93 Difference]: Finished difference Result 609 states and 1041 transitions. [2024-10-12 19:55:30,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:55:30,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-12 19:55:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:30,658 INFO L225 Difference]: With dead ends: 609 [2024-10-12 19:55:30,658 INFO L226 Difference]: Without dead ends: 351 [2024-10-12 19:55:30,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:55:30,671 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 705 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:30,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 490 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:55:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-12 19:55:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 261. [2024-10-12 19:55:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 230 states have (on average 1.6217391304347826) internal successors, (373), 232 states have internal predecessors, (373), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 19:55:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 419 transitions. [2024-10-12 19:55:30,764 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 419 transitions. Word has length 121 [2024-10-12 19:55:30,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:30,766 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 419 transitions. [2024-10-12 19:55:30,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 419 transitions. [2024-10-12 19:55:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:55:30,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:30,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:55:30,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:55:30,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:30,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash -776111169, now seen corresponding path program 1 times [2024-10-12 19:55:30,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:30,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423674192] [2024-10-12 19:55:30,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:30,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:30,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:31,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:55:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:31,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:55:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:31,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:55:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:31,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:55:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:55:31,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:31,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423674192] [2024-10-12 19:55:31,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423674192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:31,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:31,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:55:31,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103540483] [2024-10-12 19:55:31,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:31,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:55:31,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:31,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:55:31,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:55:31,151 INFO L87 Difference]: Start difference. First operand 261 states and 419 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:33,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:33,340 INFO L93 Difference]: Finished difference Result 946 states and 1553 transitions. [2024-10-12 19:55:33,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:55:33,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-12 19:55:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:33,347 INFO L225 Difference]: With dead ends: 946 [2024-10-12 19:55:33,347 INFO L226 Difference]: Without dead ends: 699 [2024-10-12 19:55:33,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:55:33,350 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 1057 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:33,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 820 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 19:55:33,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-10-12 19:55:33,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 518. [2024-10-12 19:55:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 463 states have (on average 1.630669546436285) internal successors, (755), 466 states have internal predecessors, (755), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-10-12 19:55:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 838 transitions. [2024-10-12 19:55:33,424 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 838 transitions. Word has length 121 [2024-10-12 19:55:33,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:33,424 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 838 transitions. [2024-10-12 19:55:33,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 838 transitions. [2024-10-12 19:55:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:55:33,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:33,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:55:33,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:55:33,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:33,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1052036481, now seen corresponding path program 1 times [2024-10-12 19:55:33,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:33,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74923999] [2024-10-12 19:55:33,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:33,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:33,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:33,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:55:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:33,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:55:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:33,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:55:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:33,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:55:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:55:33,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:33,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74923999] [2024-10-12 19:55:33,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74923999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:33,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:33,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:55:33,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034069086] [2024-10-12 19:55:33,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:33,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:55:33,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:33,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:55:33,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:33,739 INFO L87 Difference]: Start difference. First operand 518 states and 838 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:36,557 INFO L93 Difference]: Finished difference Result 1561 states and 2563 transitions. [2024-10-12 19:55:36,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:55:36,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-12 19:55:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:36,565 INFO L225 Difference]: With dead ends: 1561 [2024-10-12 19:55:36,565 INFO L226 Difference]: Without dead ends: 1057 [2024-10-12 19:55:36,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:55:36,568 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 1076 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 2648 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 2705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:36,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1561 Invalid, 2705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2648 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 19:55:36,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-10-12 19:55:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 756. [2024-10-12 19:55:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 677 states have (on average 1.6233382570162482) internal successors, (1099), 681 states have internal predecessors, (1099), 58 states have call successors, (58), 19 states have call predecessors, (58), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-12 19:55:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1218 transitions. [2024-10-12 19:55:36,631 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1218 transitions. Word has length 121 [2024-10-12 19:55:36,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:36,631 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1218 transitions. [2024-10-12 19:55:36,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:36,631 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1218 transitions. [2024-10-12 19:55:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:55:36,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:36,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:55:36,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:55:36,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:36,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:36,635 INFO L85 PathProgramCache]: Analyzing trace with hash 337257533, now seen corresponding path program 1 times [2024-10-12 19:55:36,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:36,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496484821] [2024-10-12 19:55:36,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:36,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:36,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:36,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:55:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:36,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:55:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:36,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:55:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:36,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:55:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:55:36,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:36,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496484821] [2024-10-12 19:55:36,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496484821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:36,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:36,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:55:36,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063344398] [2024-10-12 19:55:36,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:36,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:55:36,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:36,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:55:36,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:36,915 INFO L87 Difference]: Start difference. First operand 756 states and 1218 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:39,218 INFO L93 Difference]: Finished difference Result 2462 states and 4035 transitions. [2024-10-12 19:55:39,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:55:39,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-12 19:55:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:39,231 INFO L225 Difference]: With dead ends: 2462 [2024-10-12 19:55:39,232 INFO L226 Difference]: Without dead ends: 1720 [2024-10-12 19:55:39,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:55:39,238 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 1156 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 2191 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:39,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 1014 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2191 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 19:55:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2024-10-12 19:55:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1233. [2024-10-12 19:55:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1106 states have (on average 1.616636528028933) internal successors, (1788), 1112 states have internal predecessors, (1788), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-12 19:55:39,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1983 transitions. [2024-10-12 19:55:39,361 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1983 transitions. Word has length 121 [2024-10-12 19:55:39,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:39,362 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 1983 transitions. [2024-10-12 19:55:39,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1983 transitions. [2024-10-12 19:55:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:55:39,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:39,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:55:39,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:55:39,365 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:39,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:39,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1696136513, now seen corresponding path program 1 times [2024-10-12 19:55:39,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:39,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378581995] [2024-10-12 19:55:39,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:39,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:39,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:39,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:55:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:39,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:55:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:39,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:55:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:39,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:55:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:55:39,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:39,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378581995] [2024-10-12 19:55:39,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378581995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:39,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:39,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:55:39,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552634834] [2024-10-12 19:55:39,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:39,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:55:39,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:39,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:55:39,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:39,619 INFO L87 Difference]: Start difference. First operand 1233 states and 1983 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:40,926 INFO L93 Difference]: Finished difference Result 2927 states and 4791 transitions. [2024-10-12 19:55:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:55:40,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-12 19:55:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:40,937 INFO L225 Difference]: With dead ends: 2927 [2024-10-12 19:55:40,938 INFO L226 Difference]: Without dead ends: 1708 [2024-10-12 19:55:40,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:55:40,944 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 889 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:40,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 663 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:55:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2024-10-12 19:55:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1233. [2024-10-12 19:55:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1106 states have (on average 1.6121157323688968) internal successors, (1783), 1112 states have internal predecessors, (1783), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-12 19:55:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1978 transitions. [2024-10-12 19:55:41,045 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1978 transitions. Word has length 121 [2024-10-12 19:55:41,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:41,046 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 1978 transitions. [2024-10-12 19:55:41,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1978 transitions. [2024-10-12 19:55:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:55:41,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:41,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:55:41,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:55:41,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:41,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:41,049 INFO L85 PathProgramCache]: Analyzing trace with hash 732122109, now seen corresponding path program 1 times [2024-10-12 19:55:41,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:41,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269147955] [2024-10-12 19:55:41,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:41,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:41,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:41,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:55:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:41,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:55:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:41,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:55:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:41,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:55:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:55:41,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:41,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269147955] [2024-10-12 19:55:41,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269147955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:41,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:41,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:55:41,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35216563] [2024-10-12 19:55:41,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:41,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:55:41,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:41,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:55:41,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:41,259 INFO L87 Difference]: Start difference. First operand 1233 states and 1978 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:42,746 INFO L93 Difference]: Finished difference Result 2921 states and 4765 transitions. [2024-10-12 19:55:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:55:42,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-12 19:55:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:42,755 INFO L225 Difference]: With dead ends: 2921 [2024-10-12 19:55:42,755 INFO L226 Difference]: Without dead ends: 1702 [2024-10-12 19:55:42,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:55:42,760 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 778 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:42,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 791 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 19:55:42,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2024-10-12 19:55:42,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1233. [2024-10-12 19:55:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1106 states have (on average 1.6075949367088607) internal successors, (1778), 1112 states have internal predecessors, (1778), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-12 19:55:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1973 transitions. [2024-10-12 19:55:42,849 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1973 transitions. Word has length 121 [2024-10-12 19:55:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:42,849 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 1973 transitions. [2024-10-12 19:55:42,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:42,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1973 transitions. [2024-10-12 19:55:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:55:42,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:42,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:55:42,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:55:42,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:42,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:42,852 INFO L85 PathProgramCache]: Analyzing trace with hash -575020289, now seen corresponding path program 1 times [2024-10-12 19:55:42,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:42,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559833644] [2024-10-12 19:55:42,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:42,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:42,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:42,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:55:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:43,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:55:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:43,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:55:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:43,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:55:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:55:43,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:43,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559833644] [2024-10-12 19:55:43,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559833644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:43,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:43,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:55:43,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885691787] [2024-10-12 19:55:43,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:43,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:55:43,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:43,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:55:43,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:43,056 INFO L87 Difference]: Start difference. First operand 1233 states and 1973 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:44,208 INFO L93 Difference]: Finished difference Result 2914 states and 4737 transitions. [2024-10-12 19:55:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:55:44,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-12 19:55:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:44,222 INFO L225 Difference]: With dead ends: 2914 [2024-10-12 19:55:44,222 INFO L226 Difference]: Without dead ends: 1695 [2024-10-12 19:55:44,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:55:44,230 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 885 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:44,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 663 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 19:55:44,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2024-10-12 19:55:44,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1233. [2024-10-12 19:55:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1106 states have (on average 1.6030741410488245) internal successors, (1773), 1112 states have internal predecessors, (1773), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-12 19:55:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1968 transitions. [2024-10-12 19:55:44,344 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1968 transitions. Word has length 121 [2024-10-12 19:55:44,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:44,345 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 1968 transitions. [2024-10-12 19:55:44,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:44,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1968 transitions. [2024-10-12 19:55:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:55:44,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:44,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:55:44,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:55:44,347 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:44,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:44,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1322476477, now seen corresponding path program 1 times [2024-10-12 19:55:44,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:44,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142591892] [2024-10-12 19:55:44,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:44,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:44,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:44,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:55:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:44,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:55:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:55:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:44,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:55:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:55:44,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:44,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142591892] [2024-10-12 19:55:44,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142591892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:44,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:44,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:55:44,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412800353] [2024-10-12 19:55:44,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:44,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:55:44,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:44,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:55:44,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:44,568 INFO L87 Difference]: Start difference. First operand 1233 states and 1968 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:47,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:47,056 INFO L93 Difference]: Finished difference Result 4168 states and 6736 transitions. [2024-10-12 19:55:47,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:55:47,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-12 19:55:47,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:47,071 INFO L225 Difference]: With dead ends: 4168 [2024-10-12 19:55:47,072 INFO L226 Difference]: Without dead ends: 2949 [2024-10-12 19:55:47,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:55:47,078 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1050 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 2565 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 2624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:47,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 1559 Invalid, 2624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2565 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 19:55:47,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2024-10-12 19:55:47,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2200. [2024-10-12 19:55:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2200 states, 1977 states have (on average 1.5953464845725847) internal successors, (3154), 1987 states have internal predecessors, (3154), 160 states have call successors, (160), 55 states have call predecessors, (160), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-12 19:55:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 3507 transitions. [2024-10-12 19:55:47,279 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 3507 transitions. Word has length 121 [2024-10-12 19:55:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:47,280 INFO L471 AbstractCegarLoop]: Abstraction has 2200 states and 3507 transitions. [2024-10-12 19:55:47,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:47,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 3507 transitions. [2024-10-12 19:55:47,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:55:47,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:47,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:55:47,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:55:47,285 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:47,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:47,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1941449921, now seen corresponding path program 1 times [2024-10-12 19:55:47,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:47,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633908866] [2024-10-12 19:55:47,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:47,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:47,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:47,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:55:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:47,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:55:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:47,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:55:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:47,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:55:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:55:47,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:47,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633908866] [2024-10-12 19:55:47,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633908866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:47,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:47,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:55:47,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212025433] [2024-10-12 19:55:47,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:47,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:55:47,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:47,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:55:47,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:47,513 INFO L87 Difference]: Start difference. First operand 2200 states and 3507 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:50,071 INFO L93 Difference]: Finished difference Result 7613 states and 12293 transitions. [2024-10-12 19:55:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:55:50,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-12 19:55:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:50,100 INFO L225 Difference]: With dead ends: 7613 [2024-10-12 19:55:50,100 INFO L226 Difference]: Without dead ends: 5427 [2024-10-12 19:55:50,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:55:50,111 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1046 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 2537 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:50,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 1559 Invalid, 2596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2537 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 19:55:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5427 states. [2024-10-12 19:55:50,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5427 to 4143. [2024-10-12 19:55:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 3728 states have (on average 1.5906652360515021) internal successors, (5930), 3746 states have internal predecessors, (5930), 296 states have call successors, (296), 103 states have call predecessors, (296), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-10-12 19:55:50,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 6617 transitions. [2024-10-12 19:55:50,435 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 6617 transitions. Word has length 121 [2024-10-12 19:55:50,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:50,436 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 6617 transitions. [2024-10-12 19:55:50,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:50,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 6617 transitions. [2024-10-12 19:55:50,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:55:50,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:50,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:55:50,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:55:50,440 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:50,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash -340378815, now seen corresponding path program 1 times [2024-10-12 19:55:50,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:50,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421654989] [2024-10-12 19:55:50,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:50,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:50,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:50,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:55:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:50,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:55:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:50,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:55:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:50,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:55:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:55:50,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:50,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421654989] [2024-10-12 19:55:50,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421654989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:50,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:50,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:55:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812392584] [2024-10-12 19:55:50,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:50,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:55:50,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:50,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:55:50,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:50,654 INFO L87 Difference]: Start difference. First operand 4143 states and 6617 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:53,493 INFO L93 Difference]: Finished difference Result 16180 states and 26163 transitions. [2024-10-12 19:55:53,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:55:53,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-12 19:55:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:53,551 INFO L225 Difference]: With dead ends: 16180 [2024-10-12 19:55:53,552 INFO L226 Difference]: Without dead ends: 12051 [2024-10-12 19:55:53,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:55:53,569 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 1339 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:53,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 1552 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 19:55:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12051 states. [2024-10-12 19:55:54,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12051 to 8010. [2024-10-12 19:55:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8010 states, 7227 states have (on average 1.5890410958904109) internal successors, (11484), 7261 states have internal predecessors, (11484), 552 states have call successors, (552), 199 states have call predecessors, (552), 230 states have return successors, (825), 581 states have call predecessors, (825), 550 states have call successors, (825) [2024-10-12 19:55:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8010 states to 8010 states and 12861 transitions. [2024-10-12 19:55:54,234 INFO L78 Accepts]: Start accepts. Automaton has 8010 states and 12861 transitions. Word has length 121 [2024-10-12 19:55:54,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:54,235 INFO L471 AbstractCegarLoop]: Abstraction has 8010 states and 12861 transitions. [2024-10-12 19:55:54,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:54,235 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states and 12861 transitions. [2024-10-12 19:55:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:55:54,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:54,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:55:54,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:55:54,242 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:54,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:54,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1397110017, now seen corresponding path program 1 times [2024-10-12 19:55:54,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:54,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810686556] [2024-10-12 19:55:54,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:54,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:54,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:54,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:55:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:54,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:55:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:54,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:55:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:54,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:55:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:55:54,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:54,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810686556] [2024-10-12 19:55:54,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810686556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:54,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:54,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:55:54,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347480030] [2024-10-12 19:55:54,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:54,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:55:54,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:54,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:55:54,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:54,504 INFO L87 Difference]: Start difference. First operand 8010 states and 12861 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:57,972 INFO L93 Difference]: Finished difference Result 31201 states and 50697 transitions. [2024-10-12 19:55:57,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:55:57,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-12 19:55:57,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:58,126 INFO L225 Difference]: With dead ends: 31201 [2024-10-12 19:55:58,126 INFO L226 Difference]: Without dead ends: 23205 [2024-10-12 19:55:58,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:55:58,160 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1179 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 2726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:58,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 1062 Invalid, 2726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2639 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 19:55:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23205 states. [2024-10-12 19:55:59,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23205 to 15423. [2024-10-12 19:55:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15423 states, 13920 states have (on average 1.583764367816092) internal successors, (22046), 13986 states have internal predecessors, (22046), 1048 states have call successors, (1048), 391 states have call predecessors, (1048), 454 states have return successors, (1839), 1109 states have call predecessors, (1839), 1046 states have call successors, (1839) [2024-10-12 19:55:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15423 states to 15423 states and 24933 transitions. [2024-10-12 19:55:59,715 INFO L78 Accepts]: Start accepts. Automaton has 15423 states and 24933 transitions. Word has length 121 [2024-10-12 19:55:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:59,716 INFO L471 AbstractCegarLoop]: Abstraction has 15423 states and 24933 transitions. [2024-10-12 19:55:59,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:55:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 15423 states and 24933 transitions. [2024-10-12 19:55:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:55:59,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:59,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:55:59,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:55:59,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:59,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:59,731 INFO L85 PathProgramCache]: Analyzing trace with hash -45724799, now seen corresponding path program 1 times [2024-10-12 19:55:59,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:59,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091788360] [2024-10-12 19:55:59,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:59,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:59,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:59,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:55:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:59,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:55:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:59,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:55:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:59,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:55:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:56:00,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:56:00,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091788360] [2024-10-12 19:56:00,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091788360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:56:00,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:56:00,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:56:00,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114961985] [2024-10-12 19:56:00,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:56:00,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:56:00,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:56:00,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:56:00,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:56:00,002 INFO L87 Difference]: Start difference. First operand 15423 states and 24933 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:56:01,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:56:01,884 INFO L93 Difference]: Finished difference Result 35445 states and 58291 transitions. [2024-10-12 19:56:01,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:56:01,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-12 19:56:01,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:56:02,065 INFO L225 Difference]: With dead ends: 35445 [2024-10-12 19:56:02,066 INFO L226 Difference]: Without dead ends: 20036 [2024-10-12 19:56:02,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:56:02,116 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 889 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:56:02,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 662 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 19:56:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20036 states. [2024-10-12 19:56:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20036 to 15423. [2024-10-12 19:56:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15423 states, 13920 states have (on average 1.579094827586207) internal successors, (21981), 13986 states have internal predecessors, (21981), 1048 states have call successors, (1048), 391 states have call predecessors, (1048), 454 states have return successors, (1839), 1109 states have call predecessors, (1839), 1046 states have call successors, (1839) [2024-10-12 19:56:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15423 states to 15423 states and 24868 transitions. [2024-10-12 19:56:03,702 INFO L78 Accepts]: Start accepts. Automaton has 15423 states and 24868 transitions. Word has length 121 [2024-10-12 19:56:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:56:03,703 INFO L471 AbstractCegarLoop]: Abstraction has 15423 states and 24868 transitions. [2024-10-12 19:56:03,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:56:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 15423 states and 24868 transitions. [2024-10-12 19:56:03,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:56:03,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:56:03,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:56:03,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:56:03,714 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:56:03,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:56:03,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1664699713, now seen corresponding path program 1 times [2024-10-12 19:56:03,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:56:03,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817531621] [2024-10-12 19:56:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:56:03,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:56:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:03,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:56:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:03,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:56:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:03,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:56:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:03,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:56:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:03,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:56:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:56:03,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:56:03,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817531621] [2024-10-12 19:56:03,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817531621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:56:03,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:56:03,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:56:03,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089141952] [2024-10-12 19:56:03,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:56:03,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:56:03,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:56:03,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:56:03,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:56:03,895 INFO L87 Difference]: Start difference. First operand 15423 states and 24868 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:56:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:56:08,172 INFO L93 Difference]: Finished difference Result 59002 states and 96247 transitions. [2024-10-12 19:56:08,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:56:08,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-12 19:56:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:56:08,360 INFO L225 Difference]: With dead ends: 59002 [2024-10-12 19:56:08,361 INFO L226 Difference]: Without dead ends: 43593 [2024-10-12 19:56:08,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:56:08,410 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 1225 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:56:08,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 1552 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 19:56:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43593 states. [2024-10-12 19:56:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43593 to 30633. [2024-10-12 19:56:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30633 states, 27722 states have (on average 1.577988601111031) internal successors, (43745), 27852 states have internal predecessors, (43745), 2008 states have call successors, (2008), 775 states have call predecessors, (2008), 902 states have return successors, (4321), 2133 states have call predecessors, (4321), 2006 states have call successors, (4321) [2024-10-12 19:56:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30633 states to 30633 states and 50074 transitions. [2024-10-12 19:56:11,482 INFO L78 Accepts]: Start accepts. Automaton has 30633 states and 50074 transitions. Word has length 121 [2024-10-12 19:56:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:56:11,483 INFO L471 AbstractCegarLoop]: Abstraction has 30633 states and 50074 transitions. [2024-10-12 19:56:11,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:56:11,483 INFO L276 IsEmpty]: Start isEmpty. Operand 30633 states and 50074 transitions. [2024-10-12 19:56:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:56:11,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:56:11,502 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:56:11,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:56:11,503 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:56:11,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:56:11,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1746758593, now seen corresponding path program 1 times [2024-10-12 19:56:11,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:56:11,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170929515] [2024-10-12 19:56:11,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:56:11,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:56:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:11,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:56:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:11,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:56:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:11,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:56:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:11,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:56:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:11,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:56:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:56:11,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:56:11,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170929515] [2024-10-12 19:56:11,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170929515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:56:11,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:56:11,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:56:11,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053195049] [2024-10-12 19:56:11,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:56:11,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:56:11,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:56:11,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:56:11,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:56:11,668 INFO L87 Difference]: Start difference. First operand 30633 states and 50074 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:56:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:56:18,979 INFO L93 Difference]: Finished difference Result 115442 states and 190975 transitions. [2024-10-12 19:56:18,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:56:18,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-12 19:56:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:56:19,615 INFO L225 Difference]: With dead ends: 115442 [2024-10-12 19:56:19,615 INFO L226 Difference]: Without dead ends: 84823 [2024-10-12 19:56:19,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:56:19,739 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 1073 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 2765 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:56:19,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 1552 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2765 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 19:56:19,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84823 states. [2024-10-12 19:56:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84823 to 61050. [2024-10-12 19:56:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61050 states, 55387 states have (on average 1.5778973405311716) internal successors, (87395), 55645 states have internal predecessors, (87395), 3864 states have call successors, (3864), 1543 states have call predecessors, (3864), 1798 states have return successors, (10679), 4117 states have call predecessors, (10679), 3862 states have call successors, (10679) [2024-10-12 19:56:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61050 states to 61050 states and 101938 transitions. [2024-10-12 19:56:24,709 INFO L78 Accepts]: Start accepts. Automaton has 61050 states and 101938 transitions. Word has length 121 [2024-10-12 19:56:24,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:56:24,709 INFO L471 AbstractCegarLoop]: Abstraction has 61050 states and 101938 transitions. [2024-10-12 19:56:24,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:56:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 61050 states and 101938 transitions. [2024-10-12 19:56:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:56:24,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:56:24,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:56:24,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:56:24,753 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:56:24,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:56:24,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1718258303, now seen corresponding path program 1 times [2024-10-12 19:56:24,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:56:24,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787028442] [2024-10-12 19:56:24,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:56:24,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:56:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:24,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:56:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:24,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:56:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:24,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:56:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:24,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:56:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:24,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:56:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:56:24,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:56:24,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787028442] [2024-10-12 19:56:24,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787028442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:56:24,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:56:24,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:56:24,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239426033] [2024-10-12 19:56:24,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:56:24,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:56:24,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:56:24,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:56:24,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:56:24,910 INFO L87 Difference]: Start difference. First operand 61050 states and 101938 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:56:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:56:31,140 INFO L93 Difference]: Finished difference Result 138661 states and 237320 transitions. [2024-10-12 19:56:31,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:56:31,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-12 19:56:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:56:31,753 INFO L225 Difference]: With dead ends: 138661 [2024-10-12 19:56:31,753 INFO L226 Difference]: Without dead ends: 77625 [2024-10-12 19:56:31,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:56:31,957 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 895 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:56:31,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 662 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 19:56:32,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77625 states.