./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.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 7ea381ec8ed14f66c767c1e3d74aca72e3c49fc21baf435ac33ef40352270e74 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:49:05,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:49:05,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:49:05,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:49:05,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:49:05,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:49:05,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:49:05,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:49:05,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:49:05,749 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:49:05,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:49:05,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:49:05,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:49:05,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:49:05,751 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:49:05,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:49:05,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:49:05,751 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:49:05,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:49:05,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:49:05,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:49:05,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:49:05,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:49:05,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:49:05,757 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:49:05,757 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:49:05,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:49:05,758 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:49:05,758 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:49:05,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:49:05,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:49:05,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:49:05,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:49:05,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:49:05,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:49:05,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:49:05,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:49:05,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:49:05,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:49:05,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:49:05,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:49:05,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:49:05,764 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 -> 7ea381ec8ed14f66c767c1e3d74aca72e3c49fc21baf435ac33ef40352270e74 [2024-11-10 00:49:06,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:49:06,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:49:06,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:49:06,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:49:06,071 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:49:06,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 00:49:07,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:49:07,946 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:49:07,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 00:49:07,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd02f1b9d/1f247ff761434df6b2f770f1d89518dc/FLAG962f4c4ef [2024-11-10 00:49:08,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd02f1b9d/1f247ff761434df6b2f770f1d89518dc [2024-11-10 00:49:08,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:49:08,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:49:08,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:49:08,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:49:08,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:49:08,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:49:08" (1/1) ... [2024-11-10 00:49:08,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7032057c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:08, skipping insertion in model container [2024-11-10 00:49:08,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:49:08" (1/1) ... [2024-11-10 00:49:08,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:49:08,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[6524,6537] [2024-11-10 00:49:08,470 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[14272,14285] [2024-11-10 00:49:09,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:49:09,065 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:49:09,102 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[6524,6537] [2024-11-10 00:49:09,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[14272,14285] [2024-11-10 00:49:09,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:49:09,468 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:49:09,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09 WrapperNode [2024-11-10 00:49:09,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:49:09,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:49:09,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:49:09,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:49:09,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:09,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:09,956 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4979 [2024-11-10 00:49:09,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:49:09,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:49:09,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:49:09,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:49:09,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:09,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,156 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:49:10,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,341 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:49:10,434 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:49:10,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:49:10,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:49:10,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (1/1) ... [2024-11-10 00:49:10,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:49:10,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:49:10,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:49:10,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:49:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:49:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:49:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:49:10,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:49:10,733 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:49:10,735 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:49:16,001 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1986: havoc calculate_output_#t~ret29#1; [2024-11-10 00:49:16,002 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3465: havoc calculate_output2_#t~ret30#1; [2024-11-10 00:49:16,002 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4955: havoc calculate_output3_#t~ret31#1; [2024-11-10 00:49:16,311 INFO L? ?]: Removed 2071 outVars from TransFormulas that were not future-live. [2024-11-10 00:49:16,311 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:49:16,346 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:49:16,347 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:49:16,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:49:16 BoogieIcfgContainer [2024-11-10 00:49:16,348 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:49:16,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:49:16,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:49:16,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:49:16,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:49:08" (1/3) ... [2024-11-10 00:49:16,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47159589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:49:16, skipping insertion in model container [2024-11-10 00:49:16,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:09" (2/3) ... [2024-11-10 00:49:16,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47159589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:49:16, skipping insertion in model container [2024-11-10 00:49:16,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:49:16" (3/3) ... [2024-11-10 00:49:16,359 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 00:49:16,375 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:49:16,376 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:49:16,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:49:16,483 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;@3799305a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:49:16,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:49:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 879 states, 876 states have (on average 2.675799086757991) internal successors, (2344), 878 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:49:16,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:16,505 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] [2024-11-10 00:49:16,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:16,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:16,512 INFO L85 PathProgramCache]: Analyzing trace with hash -754437650, now seen corresponding path program 1 times [2024-11-10 00:49:16,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:16,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030901152] [2024-11-10 00:49:16,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:16,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:16,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:16,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030901152] [2024-11-10 00:49:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030901152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:16,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:16,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:49:16,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290745432] [2024-11-10 00:49:16,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:16,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:49:16,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:16,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:49:16,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:49:16,810 INFO L87 Difference]: Start difference. First operand has 879 states, 876 states have (on average 2.675799086757991) internal successors, (2344), 878 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:16,891 INFO L93 Difference]: Finished difference Result 1732 states and 4644 transitions. [2024-11-10 00:49:16,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:49:16,893 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-10 00:49:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:16,918 INFO L225 Difference]: With dead ends: 1732 [2024-11-10 00:49:16,919 INFO L226 Difference]: Without dead ends: 811 [2024-11-10 00:49:16,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:49:16,934 INFO L432 NwaCegarLoop]: 2273 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2273 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:16,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2273 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:16,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-10 00:49:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2024-11-10 00:49:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 2.7305315203955502) internal successors, (2209), 810 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:17,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2209 transitions. [2024-11-10 00:49:17,022 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2209 transitions. Word has length 22 [2024-11-10 00:49:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:17,022 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 2209 transitions. [2024-11-10 00:49:17,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2209 transitions. [2024-11-10 00:49:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:49:17,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:17,024 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] [2024-11-10 00:49:17,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:49:17,024 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:17,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:17,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1264971827, now seen corresponding path program 1 times [2024-11-10 00:49:17,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:17,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054752293] [2024-11-10 00:49:17,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:17,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:17,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:17,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054752293] [2024-11-10 00:49:17,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054752293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:17,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:17,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:17,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75566433] [2024-11-10 00:49:17,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:17,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:17,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:17,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:17,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:17,269 INFO L87 Difference]: Start difference. First operand 811 states and 2209 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:17,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:17,388 INFO L93 Difference]: Finished difference Result 848 states and 2263 transitions. [2024-11-10 00:49:17,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:49:17,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-10 00:49:17,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:17,393 INFO L225 Difference]: With dead ends: 848 [2024-11-10 00:49:17,393 INFO L226 Difference]: Without dead ends: 811 [2024-11-10 00:49:17,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:17,395 INFO L432 NwaCegarLoop]: 2207 mSDtfsCounter, 0 mSDsluCounter, 6600 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8807 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:17,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8807 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-10 00:49:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2024-11-10 00:49:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 2.710754017305315) internal successors, (2193), 810 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2193 transitions. [2024-11-10 00:49:17,424 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2193 transitions. Word has length 22 [2024-11-10 00:49:17,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:17,425 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 2193 transitions. [2024-11-10 00:49:17,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2193 transitions. [2024-11-10 00:49:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 00:49:17,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:17,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] [2024-11-10 00:49:17,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:49:17,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:17,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash 606557701, now seen corresponding path program 1 times [2024-11-10 00:49:17,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:17,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640306010] [2024-11-10 00:49:17,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:17,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:17,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:17,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640306010] [2024-11-10 00:49:17,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640306010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:17,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:17,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:17,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211157940] [2024-11-10 00:49:17,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:17,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:17,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:17,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:17,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:17,580 INFO L87 Difference]: Start difference. First operand 811 states and 2193 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:17,740 INFO L93 Difference]: Finished difference Result 1009 states and 2493 transitions. [2024-11-10 00:49:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:49:17,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-10 00:49:17,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:17,750 INFO L225 Difference]: With dead ends: 1009 [2024-11-10 00:49:17,750 INFO L226 Difference]: Without dead ends: 976 [2024-11-10 00:49:17,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:49:17,753 INFO L432 NwaCegarLoop]: 2189 mSDtfsCounter, 6651 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6651 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:17,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6651 Valid, 2577 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:49:17,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-10 00:49:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 841. [2024-11-10 00:49:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 839 states have (on average 2.66865315852205) internal successors, (2239), 840 states have internal predecessors, (2239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2239 transitions. [2024-11-10 00:49:17,779 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 2239 transitions. Word has length 37 [2024-11-10 00:49:17,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:17,779 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 2239 transitions. [2024-11-10 00:49:17,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 2239 transitions. [2024-11-10 00:49:17,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 00:49:17,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:17,781 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] [2024-11-10 00:49:17,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:49:17,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:17,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:17,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1075758951, now seen corresponding path program 1 times [2024-11-10 00:49:17,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:17,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290112526] [2024-11-10 00:49:17,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:17,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:18,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:18,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290112526] [2024-11-10 00:49:18,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290112526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:18,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:18,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:18,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344343435] [2024-11-10 00:49:18,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:18,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:18,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:18,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:18,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:18,007 INFO L87 Difference]: Start difference. First operand 841 states and 2239 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:18,097 INFO L93 Difference]: Finished difference Result 907 states and 2337 transitions. [2024-11-10 00:49:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:49:18,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-10 00:49:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:18,102 INFO L225 Difference]: With dead ends: 907 [2024-11-10 00:49:18,102 INFO L226 Difference]: Without dead ends: 844 [2024-11-10 00:49:18,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:49:18,106 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 6469 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6469 SdHoareTripleChecker+Valid, 2280 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:18,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6469 Valid, 2280 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-10 00:49:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 841. [2024-11-10 00:49:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 839 states have (on average 2.66746126340882) internal successors, (2238), 840 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2238 transitions. [2024-11-10 00:49:18,130 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 2238 transitions. Word has length 39 [2024-11-10 00:49:18,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:18,131 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 2238 transitions. [2024-11-10 00:49:18,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,131 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 2238 transitions. [2024-11-10 00:49:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 00:49:18,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:18,134 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] [2024-11-10 00:49:18,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:49:18,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:18,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:18,135 INFO L85 PathProgramCache]: Analyzing trace with hash 712608318, now seen corresponding path program 1 times [2024-11-10 00:49:18,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:18,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895235646] [2024-11-10 00:49:18,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:18,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:18,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:18,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895235646] [2024-11-10 00:49:18,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895235646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:18,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:18,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:18,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494834592] [2024-11-10 00:49:18,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:18,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:18,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:18,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:18,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:18,213 INFO L87 Difference]: Start difference. First operand 841 states and 2238 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:18,245 INFO L93 Difference]: Finished difference Result 955 states and 2408 transitions. [2024-11-10 00:49:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:18,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-10 00:49:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:18,250 INFO L225 Difference]: With dead ends: 955 [2024-11-10 00:49:18,250 INFO L226 Difference]: Without dead ends: 892 [2024-11-10 00:49:18,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:18,252 INFO L432 NwaCegarLoop]: 2199 mSDtfsCounter, 2150 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2150 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:18,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2150 Valid, 2244 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:18,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-11-10 00:49:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 889. [2024-11-10 00:49:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 887 states have (on average 2.602029312288613) internal successors, (2308), 888 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 2308 transitions. [2024-11-10 00:49:18,272 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 2308 transitions. Word has length 40 [2024-11-10 00:49:18,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:18,272 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 2308 transitions. [2024-11-10 00:49:18,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 2308 transitions. [2024-11-10 00:49:18,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:49:18,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:18,274 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] [2024-11-10 00:49:18,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:49:18,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:18,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:18,275 INFO L85 PathProgramCache]: Analyzing trace with hash 55525097, now seen corresponding path program 1 times [2024-11-10 00:49:18,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:18,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523915517] [2024-11-10 00:49:18,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:18,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:18,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:18,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523915517] [2024-11-10 00:49:18,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523915517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:18,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:18,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:18,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710180935] [2024-11-10 00:49:18,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:18,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:18,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:18,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:18,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:18,327 INFO L87 Difference]: Start difference. First operand 889 states and 2308 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:18,366 INFO L93 Difference]: Finished difference Result 1010 states and 2488 transitions. [2024-11-10 00:49:18,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:18,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:49:18,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:18,371 INFO L225 Difference]: With dead ends: 1010 [2024-11-10 00:49:18,371 INFO L226 Difference]: Without dead ends: 947 [2024-11-10 00:49:18,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:18,372 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2160 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:18,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 2278 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-11-10 00:49:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 944. [2024-11-10 00:49:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 942 states have (on average 2.535031847133758) internal successors, (2388), 943 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 2388 transitions. [2024-11-10 00:49:18,395 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 2388 transitions. Word has length 41 [2024-11-10 00:49:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:18,395 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 2388 transitions. [2024-11-10 00:49:18,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 2388 transitions. [2024-11-10 00:49:18,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:49:18,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:18,397 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] [2024-11-10 00:49:18,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:49:18,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:18,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:18,398 INFO L85 PathProgramCache]: Analyzing trace with hash 41075241, now seen corresponding path program 1 times [2024-11-10 00:49:18,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:18,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798996320] [2024-11-10 00:49:18,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:18,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:18,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:18,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798996320] [2024-11-10 00:49:18,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798996320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:18,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:18,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:18,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731238406] [2024-11-10 00:49:18,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:18,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:18,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:18,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:18,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:18,442 INFO L87 Difference]: Start difference. First operand 944 states and 2388 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:18,473 INFO L93 Difference]: Finished difference Result 1246 states and 2830 transitions. [2024-11-10 00:49:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:18,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:49:18,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:18,479 INFO L225 Difference]: With dead ends: 1246 [2024-11-10 00:49:18,479 INFO L226 Difference]: Without dead ends: 1083 [2024-11-10 00:49:18,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:18,481 INFO L432 NwaCegarLoop]: 2229 mSDtfsCounter, 2158 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:18,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2158 Valid, 2284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:18,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-11-10 00:49:18,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1080. [2024-11-10 00:49:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1078 states have (on average 2.3933209647495364) internal successors, (2580), 1079 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 2580 transitions. [2024-11-10 00:49:18,509 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 2580 transitions. Word has length 41 [2024-11-10 00:49:18,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:18,510 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 2580 transitions. [2024-11-10 00:49:18,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 2580 transitions. [2024-11-10 00:49:18,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:49:18,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:18,512 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] [2024-11-10 00:49:18,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:49:18,512 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:18,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:18,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2132677993, now seen corresponding path program 1 times [2024-11-10 00:49:18,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:18,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386006355] [2024-11-10 00:49:18,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:18,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:18,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:18,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386006355] [2024-11-10 00:49:18,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386006355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:18,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:18,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:18,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885142711] [2024-11-10 00:49:18,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:18,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:18,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:18,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:18,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:18,564 INFO L87 Difference]: Start difference. First operand 1080 states and 2580 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:18,601 INFO L93 Difference]: Finished difference Result 1630 states and 3364 transitions. [2024-11-10 00:49:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:18,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:49:18,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:18,610 INFO L225 Difference]: With dead ends: 1630 [2024-11-10 00:49:18,610 INFO L226 Difference]: Without dead ends: 1331 [2024-11-10 00:49:18,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:18,613 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2156 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2156 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:18,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2156 Valid, 2286 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:18,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2024-11-10 00:49:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1328. [2024-11-10 00:49:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1326 states have (on average 2.1990950226244346) internal successors, (2916), 1327 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2916 transitions. [2024-11-10 00:49:18,650 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2916 transitions. Word has length 41 [2024-11-10 00:49:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:18,650 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2916 transitions. [2024-11-10 00:49:18,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2916 transitions. [2024-11-10 00:49:18,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:49:18,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:18,651 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] [2024-11-10 00:49:18,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:49:18,651 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:18,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:18,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1608400938, now seen corresponding path program 1 times [2024-11-10 00:49:18,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:18,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152847683] [2024-11-10 00:49:18,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:18,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:18,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:18,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152847683] [2024-11-10 00:49:18,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152847683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:18,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:18,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:18,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507825441] [2024-11-10 00:49:18,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:18,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:18,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:18,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:18,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:18,896 INFO L87 Difference]: Start difference. First operand 1328 states and 2916 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:18,949 INFO L93 Difference]: Finished difference Result 1379 states and 2982 transitions. [2024-11-10 00:49:18,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:49:18,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:49:18,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:18,956 INFO L225 Difference]: With dead ends: 1379 [2024-11-10 00:49:18,956 INFO L226 Difference]: Without dead ends: 1376 [2024-11-10 00:49:18,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:18,957 INFO L432 NwaCegarLoop]: 2190 mSDtfsCounter, 0 mSDsluCounter, 6561 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8751 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:18,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8751 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-10 00:49:18,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2024-11-10 00:49:18,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1374 states have (on average 2.1542940320232895) internal successors, (2960), 1375 states have internal predecessors, (2960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2960 transitions. [2024-11-10 00:49:18,988 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2960 transitions. Word has length 41 [2024-11-10 00:49:18,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:18,988 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 2960 transitions. [2024-11-10 00:49:18,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:18,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2960 transitions. [2024-11-10 00:49:18,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:49:18,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:18,990 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:18,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:49:18,990 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:18,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:18,991 INFO L85 PathProgramCache]: Analyzing trace with hash 18026415, now seen corresponding path program 1 times [2024-11-10 00:49:18,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:18,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946447774] [2024-11-10 00:49:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:18,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:49:19,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:19,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946447774] [2024-11-10 00:49:19,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946447774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:19,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:19,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:19,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157285041] [2024-11-10 00:49:19,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:19,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:19,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:19,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:19,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:19,135 INFO L87 Difference]: Start difference. First operand 1376 states and 2960 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:19,242 INFO L93 Difference]: Finished difference Result 3144 states and 5372 transitions. [2024-11-10 00:49:19,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:49:19,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:49:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:19,254 INFO L225 Difference]: With dead ends: 3144 [2024-11-10 00:49:19,254 INFO L226 Difference]: Without dead ends: 2709 [2024-11-10 00:49:19,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:49:19,256 INFO L432 NwaCegarLoop]: 2235 mSDtfsCounter, 4410 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4410 SdHoareTripleChecker+Valid, 4555 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:19,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4410 Valid, 4555 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:19,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states. [2024-11-10 00:49:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 1892. [2024-11-10 00:49:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1890 states have (on average 1.9343915343915343) internal successors, (3656), 1891 states have internal predecessors, (3656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 3656 transitions. [2024-11-10 00:49:19,304 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 3656 transitions. Word has length 58 [2024-11-10 00:49:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:19,305 INFO L471 AbstractCegarLoop]: Abstraction has 1892 states and 3656 transitions. [2024-11-10 00:49:19,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 3656 transitions. [2024-11-10 00:49:19,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:49:19,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:19,307 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:19,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:49:19,307 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:19,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash 3576559, now seen corresponding path program 1 times [2024-11-10 00:49:19,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:19,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999291152] [2024-11-10 00:49:19,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:19,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:49:19,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:19,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999291152] [2024-11-10 00:49:19,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999291152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:19,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:19,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:19,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243066908] [2024-11-10 00:49:19,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:19,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:19,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:19,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:19,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:19,435 INFO L87 Difference]: Start difference. First operand 1892 states and 3656 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:19,541 INFO L93 Difference]: Finished difference Result 3736 states and 6176 transitions. [2024-11-10 00:49:19,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:49:19,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:49:19,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:19,554 INFO L225 Difference]: With dead ends: 3736 [2024-11-10 00:49:19,555 INFO L226 Difference]: Without dead ends: 3141 [2024-11-10 00:49:19,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:49:19,557 INFO L432 NwaCegarLoop]: 2236 mSDtfsCounter, 4414 mSDsluCounter, 2292 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4414 SdHoareTripleChecker+Valid, 4528 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:19,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4414 Valid, 4528 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2024-11-10 00:49:19,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2700. [2024-11-10 00:49:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2698 states have (on average 1.7583395107487028) internal successors, (4744), 2699 states have internal predecessors, (4744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 4744 transitions. [2024-11-10 00:49:19,621 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 4744 transitions. Word has length 58 [2024-11-10 00:49:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:19,622 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 4744 transitions. [2024-11-10 00:49:19,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 4744 transitions. [2024-11-10 00:49:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:49:19,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:19,623 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:19,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:49:19,624 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:19,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2095179311, now seen corresponding path program 1 times [2024-11-10 00:49:19,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:19,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878198951] [2024-11-10 00:49:19,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:49:19,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:19,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878198951] [2024-11-10 00:49:19,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878198951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:19,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:19,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:19,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179371990] [2024-11-10 00:49:19,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:19,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:19,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:19,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:19,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:19,728 INFO L87 Difference]: Start difference. First operand 2700 states and 4744 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:19,844 INFO L93 Difference]: Finished difference Result 4328 states and 6976 transitions. [2024-11-10 00:49:19,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:49:19,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:49:19,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:19,858 INFO L225 Difference]: With dead ends: 4328 [2024-11-10 00:49:19,858 INFO L226 Difference]: Without dead ends: 3733 [2024-11-10 00:49:19,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:49:19,861 INFO L432 NwaCegarLoop]: 2237 mSDtfsCounter, 4421 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4421 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:19,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4421 Valid, 4538 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2024-11-10 00:49:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3292. [2024-11-10 00:49:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3292 states, 3290 states have (on average 1.6851063829787234) internal successors, (5544), 3291 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 5544 transitions. [2024-11-10 00:49:20,012 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 5544 transitions. Word has length 58 [2024-11-10 00:49:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:20,013 INFO L471 AbstractCegarLoop]: Abstraction has 3292 states and 5544 transitions. [2024-11-10 00:49:20,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 5544 transitions. [2024-11-10 00:49:20,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:49:20,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:20,015 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:20,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:49:20,015 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:20,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:20,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1862091119, now seen corresponding path program 1 times [2024-11-10 00:49:20,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:20,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030956128] [2024-11-10 00:49:20,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:20,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:20,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:20,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030956128] [2024-11-10 00:49:20,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030956128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:20,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:20,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:20,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30768271] [2024-11-10 00:49:20,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:20,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:20,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:20,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:20,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:20,136 INFO L87 Difference]: Start difference. First operand 3292 states and 5544 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:20,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:20,220 INFO L93 Difference]: Finished difference Result 5806 states and 8944 transitions. [2024-11-10 00:49:20,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:20,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:49:20,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:20,244 INFO L225 Difference]: With dead ends: 5806 [2024-11-10 00:49:20,244 INFO L226 Difference]: Without dead ends: 3295 [2024-11-10 00:49:20,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:20,249 INFO L432 NwaCegarLoop]: 2213 mSDtfsCounter, 28 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4394 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:20,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4394 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:20,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2024-11-10 00:49:20,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3292. [2024-11-10 00:49:20,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3292 states, 3290 states have (on average 1.6699088145896657) internal successors, (5494), 3291 states have internal predecessors, (5494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 5494 transitions. [2024-11-10 00:49:20,362 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 5494 transitions. Word has length 60 [2024-11-10 00:49:20,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:20,363 INFO L471 AbstractCegarLoop]: Abstraction has 3292 states and 5494 transitions. [2024-11-10 00:49:20,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 5494 transitions. [2024-11-10 00:49:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:49:20,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:20,365 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:20,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:49:20,365 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:20,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:20,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1431466449, now seen corresponding path program 1 times [2024-11-10 00:49:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:20,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716230924] [2024-11-10 00:49:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:20,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:20,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:20,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716230924] [2024-11-10 00:49:20,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716230924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:20,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:20,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:20,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435613463] [2024-11-10 00:49:20,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:20,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:20,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:20,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:20,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:20,473 INFO L87 Difference]: Start difference. First operand 3292 states and 5494 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:20,530 INFO L93 Difference]: Finished difference Result 4287 states and 6830 transitions. [2024-11-10 00:49:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:20,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:49:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:20,544 INFO L225 Difference]: With dead ends: 4287 [2024-11-10 00:49:20,548 INFO L226 Difference]: Without dead ends: 1776 [2024-11-10 00:49:20,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:20,553 INFO L432 NwaCegarLoop]: 2211 mSDtfsCounter, 24 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:20,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4391 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:20,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-10 00:49:20,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1766. [2024-11-10 00:49:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.9580498866213152) internal successors, (3454), 1765 states have internal predecessors, (3454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 3454 transitions. [2024-11-10 00:49:20,613 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 3454 transitions. Word has length 60 [2024-11-10 00:49:20,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:20,613 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 3454 transitions. [2024-11-10 00:49:20,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 3454 transitions. [2024-11-10 00:49:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:49:20,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:20,617 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:20,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:49:20,617 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:20,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:20,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1439328557, now seen corresponding path program 1 times [2024-11-10 00:49:20,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:20,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704726116] [2024-11-10 00:49:20,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:20,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:20,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:20,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704726116] [2024-11-10 00:49:20,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704726116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:20,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:20,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:20,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343134024] [2024-11-10 00:49:20,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:20,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:20,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:20,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:20,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:20,746 INFO L87 Difference]: Start difference. First operand 1766 states and 3454 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:20,791 INFO L93 Difference]: Finished difference Result 2258 states and 4106 transitions. [2024-11-10 00:49:20,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:20,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 00:49:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:20,796 INFO L225 Difference]: With dead ends: 2258 [2024-11-10 00:49:20,796 INFO L226 Difference]: Without dead ends: 1283 [2024-11-10 00:49:20,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:20,798 INFO L432 NwaCegarLoop]: 2205 mSDtfsCounter, 22 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4370 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:20,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4370 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:20,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2024-11-10 00:49:20,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1280. [2024-11-10 00:49:20,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1278 states have (on average 2.1885758998435056) internal successors, (2797), 1279 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 2797 transitions. [2024-11-10 00:49:20,841 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 2797 transitions. Word has length 62 [2024-11-10 00:49:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:20,841 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 2797 transitions. [2024-11-10 00:49:20,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 2797 transitions. [2024-11-10 00:49:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 00:49:20,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:20,845 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:20,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:49:20,846 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:20,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:20,846 INFO L85 PathProgramCache]: Analyzing trace with hash 111390330, now seen corresponding path program 1 times [2024-11-10 00:49:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:20,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148798640] [2024-11-10 00:49:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:21,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:21,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148798640] [2024-11-10 00:49:21,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148798640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:49:21,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270116133] [2024-11-10 00:49:21,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:21,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:21,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:49:21,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:49:21,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:49:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:21,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 00:49:21,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:49:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:25,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:49:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:29,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270116133] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:49:29,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:49:29,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 20] total 42 [2024-11-10 00:49:29,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911341671] [2024-11-10 00:49:29,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:49:29,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 00:49:29,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:29,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 00:49:29,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1425, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 00:49:29,213 INFO L87 Difference]: Start difference. First operand 1280 states and 2797 transitions. Second operand has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:41,191 INFO L93 Difference]: Finished difference Result 5811 states and 8685 transitions. [2024-11-10 00:49:41,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-10 00:49:41,192 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 00:49:41,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:41,201 INFO L225 Difference]: With dead ends: 5811 [2024-11-10 00:49:41,201 INFO L226 Difference]: Without dead ends: 5322 [2024-11-10 00:49:41,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4365 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=3014, Invalid=10326, Unknown=0, NotChecked=0, Total=13340 [2024-11-10 00:49:41,206 INFO L432 NwaCegarLoop]: 2171 mSDtfsCounter, 35606 mSDsluCounter, 17850 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35606 SdHoareTripleChecker+Valid, 20021 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:41,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35606 Valid, 20021 Invalid, 1049 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [125 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 00:49:41,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2024-11-10 00:49:41,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 2706. [2024-11-10 00:49:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2704 states have (on average 1.7126479289940828) internal successors, (4631), 2705 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4631 transitions. [2024-11-10 00:49:41,323 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4631 transitions. Word has length 64 [2024-11-10 00:49:41,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:41,323 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 4631 transitions. [2024-11-10 00:49:41,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:49:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4631 transitions. [2024-11-10 00:49:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 00:49:41,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:41,325 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:49:41,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:49:41,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 00:49:41,527 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:41,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:41,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1426733626, now seen corresponding path program 1 times [2024-11-10 00:49:41,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581771242] [2024-11-10 00:49:41,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:41,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:41,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:41,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581771242] [2024-11-10 00:49:41,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581771242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:49:41,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749798300] [2024-11-10 00:49:41,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:41,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:41,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:49:41,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:49:41,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:49:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:42,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-10 00:49:42,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:49:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:44,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:49:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:46,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749798300] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:49:46,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:49:46,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 42 [2024-11-10 00:49:46,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641793072] [2024-11-10 00:49:46,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:49:46,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 00:49:46,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:46,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 00:49:46,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1528, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 00:49:46,748 INFO L87 Difference]: Start difference. First operand 2706 states and 4631 transitions. Second operand has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:11,071 INFO L93 Difference]: Finished difference Result 10684 states and 15030 transitions. [2024-11-10 00:50:11,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2024-11-10 00:50:11,071 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 00:50:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:11,086 INFO L225 Difference]: With dead ends: 10684 [2024-11-10 00:50:11,086 INFO L226 Difference]: Without dead ends: 8769 [2024-11-10 00:50:11,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12297 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=5886, Invalid=26694, Unknown=0, NotChecked=0, Total=32580 [2024-11-10 00:50:11,097 INFO L432 NwaCegarLoop]: 2256 mSDtfsCounter, 24285 mSDsluCounter, 26455 mSDsCounter, 0 mSdLazyCounter, 2788 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24285 SdHoareTripleChecker+Valid, 28711 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:11,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24285 Valid, 28711 Invalid, 2904 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [116 Valid, 2788 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 00:50:11,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8769 states. [2024-11-10 00:50:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8769 to 5874. [2024-11-10 00:50:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5874 states, 5872 states have (on average 1.4875681198910082) internal successors, (8735), 5873 states have internal predecessors, (8735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5874 states to 5874 states and 8735 transitions. [2024-11-10 00:50:11,390 INFO L78 Accepts]: Start accepts. Automaton has 5874 states and 8735 transitions. Word has length 64 [2024-11-10 00:50:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:11,390 INFO L471 AbstractCegarLoop]: Abstraction has 5874 states and 8735 transitions. [2024-11-10 00:50:11,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:11,390 INFO L276 IsEmpty]: Start isEmpty. Operand 5874 states and 8735 transitions. [2024-11-10 00:50:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:50:11,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:11,391 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:11,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:50:11,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 00:50:11,593 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:11,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:11,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1274102374, now seen corresponding path program 1 times [2024-11-10 00:50:11,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:11,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599566244] [2024-11-10 00:50:11,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:11,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:12,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:12,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599566244] [2024-11-10 00:50:12,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599566244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:50:12,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092481447] [2024-11-10 00:50:12,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:12,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:12,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:50:12,792 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:50:12,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:50:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:12,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 00:50:12,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:50:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:13,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:50:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:13,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092481447] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:50:13,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:50:13,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 6] total 28 [2024-11-10 00:50:13,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699388502] [2024-11-10 00:50:13,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:50:13,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 00:50:13,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:13,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 00:50:13,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2024-11-10 00:50:13,353 INFO L87 Difference]: Start difference. First operand 5874 states and 8735 transitions. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:25,128 INFO L93 Difference]: Finished difference Result 23574 states and 31208 transitions. [2024-11-10 00:50:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2024-11-10 00:50:25,128 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:50:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:25,160 INFO L225 Difference]: With dead ends: 23574 [2024-11-10 00:50:25,160 INFO L226 Difference]: Without dead ends: 18203 [2024-11-10 00:50:25,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9860 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=4314, Invalid=22092, Unknown=0, NotChecked=0, Total=26406 [2024-11-10 00:50:25,174 INFO L432 NwaCegarLoop]: 2302 mSDtfsCounter, 21547 mSDsluCounter, 27885 mSDsCounter, 0 mSdLazyCounter, 4458 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21547 SdHoareTripleChecker+Valid, 30187 SdHoareTripleChecker+Invalid, 4550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 4458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:25,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21547 Valid, 30187 Invalid, 4550 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [92 Valid, 4458 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 00:50:25,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18203 states. [2024-11-10 00:50:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18203 to 12098. [2024-11-10 00:50:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12098 states, 12096 states have (on average 1.3384589947089947) internal successors, (16190), 12097 states have internal predecessors, (16190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12098 states to 12098 states and 16190 transitions. [2024-11-10 00:50:25,781 INFO L78 Accepts]: Start accepts. Automaton has 12098 states and 16190 transitions. Word has length 67 [2024-11-10 00:50:25,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:25,781 INFO L471 AbstractCegarLoop]: Abstraction has 12098 states and 16190 transitions. [2024-11-10 00:50:25,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:50:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 12098 states and 16190 transitions. [2024-11-10 00:50:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:50:25,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:25,783 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] [2024-11-10 00:50:25,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 00:50:25,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 00:50:25,984 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:25,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash -101920725, now seen corresponding path program 1 times [2024-11-10 00:50:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:25,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446351235] [2024-11-10 00:50:25,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:25,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:26,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:26,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446351235] [2024-11-10 00:50:26,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446351235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:50:26,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:50:26,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:50:26,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30065860] [2024-11-10 00:50:26,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:50:26,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:50:26,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:26,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:50:26,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:50:26,115 INFO L87 Difference]: Start difference. First operand 12098 states and 16190 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)