./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label02.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.8.1.ufo.UNBOUNDED.pals+Problem12_label02.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 dfa3eba44a9bea88c5e5172bb0d59f15b4500aac9e1ca0a62eab29a7e65f8827 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:03:00,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:03:00,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 01:03:00,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:03:00,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:03:00,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:03:00,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:03:00,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:03:00,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:03:00,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:03:00,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:03:00,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:03:00,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:03:00,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:03:00,366 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:03:00,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:03:00,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:03:00,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 01:03:00,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:03:00,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 01:03:00,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:03:00,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:03:00,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:03:00,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:03:00,370 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:03:00,370 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 01:03:00,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:03:00,371 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:03:00,371 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:03:00,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:03:00,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:03:00,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:03:00,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:03:00,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:03:00,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:03:00,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:03:00,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:03:00,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:03:00,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:03:00,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:03:00,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:03:00,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:03:00,376 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 -> dfa3eba44a9bea88c5e5172bb0d59f15b4500aac9e1ca0a62eab29a7e65f8827 [2024-11-10 01:03:00,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:03:00,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:03:00,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:03:00,659 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:03:00,660 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:03:00,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-10 01:03:02,178 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:03:02,613 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:03:02,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-10 01:03:02,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2673ec7/b6ca533141924b379adcf0e8c99889bb/FLAG1b9afc1e5 [2024-11-10 01:03:02,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a2673ec7/b6ca533141924b379adcf0e8c99889bb [2024-11-10 01:03:02,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:03:02,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:03:02,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:03:02,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:03:02,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:03:02,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:03:02" (1/1) ... [2024-11-10 01:03:02,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ea6f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:02, skipping insertion in model container [2024-11-10 01:03:02,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:03:02" (1/1) ... [2024-11-10 01:03:02,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:03:03,194 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.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c[26925,26938] [2024-11-10 01:03:03,247 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.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c[34215,34228] [2024-11-10 01:03:03,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:03:03,841 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:03:03,893 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.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c[26925,26938] [2024-11-10 01:03:03,904 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.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c[34215,34228] [2024-11-10 01:03:04,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:03:04,378 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:03:04,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:04 WrapperNode [2024-11-10 01:03:04,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:03:04,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:03:04,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:03:04,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:03:04,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:04" (1/1) ... [2024-11-10 01:03:04,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:04" (1/1) ... [2024-11-10 01:03:04,850 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5290 [2024-11-10 01:03:04,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:03:04,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:03:04,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:03:04,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:03:04,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:04" (1/1) ... [2024-11-10 01:03:04,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:04" (1/1) ... [2024-11-10 01:03:04,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:04" (1/1) ... [2024-11-10 01:03:05,085 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 01:03:05,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:04" (1/1) ... [2024-11-10 01:03:05,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:04" (1/1) ... [2024-11-10 01:03:05,261 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:04" (1/1) ... [2024-11-10 01:03:05,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:04" (1/1) ... [2024-11-10 01:03:05,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:04" (1/1) ... [2024-11-10 01:03:05,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:04" (1/1) ... [2024-11-10 01:03:05,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:03:05,472 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:03:05,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:03:05,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:03:05,473 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:04" (1/1) ... [2024-11-10 01:03:05,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:03:05,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:03:05,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 01:03:05,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 01:03:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:03:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:03:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:03:05,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:03:05,732 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:03:05,735 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:03:11,201 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2377: havoc calculate_output_#t~ret49#1; [2024-11-10 01:03:11,202 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3856: havoc calculate_output2_#t~ret50#1; [2024-11-10 01:03:11,202 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5346: havoc calculate_output3_#t~ret51#1; [2024-11-10 01:03:11,590 INFO L? ?]: Removed 2096 outVars from TransFormulas that were not future-live. [2024-11-10 01:03:11,591 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:03:11,630 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:03:11,631 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:03:11,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:03:11 BoogieIcfgContainer [2024-11-10 01:03:11,631 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:03:11,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:03:11,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:03:11,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:03:11,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:03:02" (1/3) ... [2024-11-10 01:03:11,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242b8b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:03:11, skipping insertion in model container [2024-11-10 01:03:11,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:04" (2/3) ... [2024-11-10 01:03:11,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242b8b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:03:11, skipping insertion in model container [2024-11-10 01:03:11,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:03:11" (3/3) ... [2024-11-10 01:03:11,646 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-10 01:03:11,662 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:03:11,662 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 01:03:11,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:03:11,770 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;@244363be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:03:11,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 01:03:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 956 states, 953 states have (on average 2.6096537250786986) internal successors, (2487), 955 states have internal predecessors, (2487), 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 01:03:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 01:03:11,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:11,792 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] [2024-11-10 01:03:11,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:11,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:11,797 INFO L85 PathProgramCache]: Analyzing trace with hash -759466470, now seen corresponding path program 1 times [2024-11-10 01:03:11,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:11,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896137787] [2024-11-10 01:03:11,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:11,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:12,153 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 01:03:12,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:12,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896137787] [2024-11-10 01:03:12,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896137787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:12,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:12,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:03:12,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250416089] [2024-11-10 01:03:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:12,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 01:03:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:12,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 01:03:12,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:03:12,196 INFO L87 Difference]: Start difference. First operand has 956 states, 953 states have (on average 2.6096537250786986) internal successors, (2487), 955 states have internal predecessors, (2487), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 01:03:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:12,306 INFO L93 Difference]: Finished difference Result 1841 states and 4840 transitions. [2024-11-10 01:03:12,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:03:12,308 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 32 [2024-11-10 01:03:12,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:12,332 INFO L225 Difference]: With dead ends: 1841 [2024-11-10 01:03:12,332 INFO L226 Difference]: Without dead ends: 888 [2024-11-10 01:03:12,343 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 01:03:12,346 INFO L432 NwaCegarLoop]: 2416 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, 2416 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 01:03:12,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:03:12,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-11-10 01:03:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2024-11-10 01:03:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 886 states have (on average 2.654627539503386) internal successors, (2352), 887 states have internal predecessors, (2352), 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 01:03:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 2352 transitions. [2024-11-10 01:03:12,445 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 2352 transitions. Word has length 32 [2024-11-10 01:03:12,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:12,446 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 2352 transitions. [2024-11-10 01:03:12,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 01:03:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 2352 transitions. [2024-11-10 01:03:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 01:03:12,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:12,450 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] [2024-11-10 01:03:12,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:03:12,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:12,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:12,452 INFO L85 PathProgramCache]: Analyzing trace with hash -728446663, now seen corresponding path program 1 times [2024-11-10 01:03:12,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:12,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395209316] [2024-11-10 01:03:12,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:12,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:12,784 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 01:03:12,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:12,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395209316] [2024-11-10 01:03:12,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395209316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:12,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:12,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:03:12,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939213622] [2024-11-10 01:03:12,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:12,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:03:12,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:12,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:03:12,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:03:12,790 INFO L87 Difference]: Start difference. First operand 888 states and 2352 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 01:03:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:12,953 INFO L93 Difference]: Finished difference Result 957 states and 2459 transitions. [2024-11-10 01:03:12,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:03:12,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2024-11-10 01:03:12,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:12,959 INFO L225 Difference]: With dead ends: 957 [2024-11-10 01:03:12,959 INFO L226 Difference]: Without dead ends: 888 [2024-11-10 01:03:12,960 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 01:03:12,961 INFO L432 NwaCegarLoop]: 2350 mSDtfsCounter, 0 mSDsluCounter, 6984 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9334 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:03:12,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9334 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:03:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-11-10 01:03:12,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2024-11-10 01:03:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 886 states have (on average 2.5857787810383748) internal successors, (2291), 887 states have internal predecessors, (2291), 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 01:03:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 2291 transitions. [2024-11-10 01:03:12,987 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 2291 transitions. Word has length 32 [2024-11-10 01:03:12,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:12,987 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 2291 transitions. [2024-11-10 01:03:12,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 01:03:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 2291 transitions. [2024-11-10 01:03:12,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 01:03:12,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:12,989 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] [2024-11-10 01:03:12,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:03:12,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:12,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:12,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2033473339, now seen corresponding path program 1 times [2024-11-10 01:03:12,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:12,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936475171] [2024-11-10 01:03:12,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:12,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:13,250 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 01:03:13,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:13,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936475171] [2024-11-10 01:03:13,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936475171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:13,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:13,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:03:13,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755757642] [2024-11-10 01:03:13,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:13,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:03:13,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:13,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:03:13,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:03:13,254 INFO L87 Difference]: Start difference. First operand 888 states and 2291 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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 01:03:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:20,968 INFO L93 Difference]: Finished difference Result 3147 states and 8644 transitions. [2024-11-10 01:03:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:03:20,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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 65 [2024-11-10 01:03:20,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:20,982 INFO L225 Difference]: With dead ends: 3147 [2024-11-10 01:03:20,982 INFO L226 Difference]: Without dead ends: 2392 [2024-11-10 01:03:20,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:03:20,987 INFO L432 NwaCegarLoop]: 847 mSDtfsCounter, 4569 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8074 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4569 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 9227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 8074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:03:20,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4569 Valid, 870 Invalid, 9227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 8074 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-10 01:03:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2024-11-10 01:03:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2392. [2024-11-10 01:03:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 2390 states have (on average 2.412970711297071) internal successors, (5767), 2391 states have internal predecessors, (5767), 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 01:03:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 5767 transitions. [2024-11-10 01:03:21,057 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 5767 transitions. Word has length 65 [2024-11-10 01:03:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:21,058 INFO L471 AbstractCegarLoop]: Abstraction has 2392 states and 5767 transitions. [2024-11-10 01:03:21,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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 01:03:21,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 5767 transitions. [2024-11-10 01:03:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 01:03:21,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:21,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:03:21,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:03:21,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:21,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:21,063 INFO L85 PathProgramCache]: Analyzing trace with hash -234036099, now seen corresponding path program 1 times [2024-11-10 01:03:21,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:21,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055918046] [2024-11-10 01:03:21,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:21,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:21,427 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 01:03:21,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:21,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055918046] [2024-11-10 01:03:21,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055918046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:21,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:21,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:03:21,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042920938] [2024-11-10 01:03:21,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:21,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:03:21,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:21,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:03:21,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:03:21,432 INFO L87 Difference]: Start difference. First operand 2392 states and 5767 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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 01:03:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:21,951 INFO L93 Difference]: Finished difference Result 3432 states and 7415 transitions. [2024-11-10 01:03:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 01:03:21,952 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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 92 [2024-11-10 01:03:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:21,965 INFO L225 Difference]: With dead ends: 3432 [2024-11-10 01:03:21,966 INFO L226 Difference]: Without dead ends: 3367 [2024-11-10 01:03:21,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-10 01:03:21,969 INFO L432 NwaCegarLoop]: 2285 mSDtfsCounter, 19002 mSDsluCounter, 4183 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19002 SdHoareTripleChecker+Valid, 6468 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:03:21,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19002 Valid, 6468 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:03:21,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2024-11-10 01:03:22,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 2454. [2024-11-10 01:03:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2454 states, 2452 states have (on average 2.392332789559543) internal successors, (5866), 2453 states have internal predecessors, (5866), 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 01:03:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2454 states and 5866 transitions. [2024-11-10 01:03:22,031 INFO L78 Accepts]: Start accepts. Automaton has 2454 states and 5866 transitions. Word has length 92 [2024-11-10 01:03:22,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:22,032 INFO L471 AbstractCegarLoop]: Abstraction has 2454 states and 5866 transitions. [2024-11-10 01:03:22,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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 01:03:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 5866 transitions. [2024-11-10 01:03:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 01:03:22,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:22,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:03:22,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:03:22,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:22,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:22,035 INFO L85 PathProgramCache]: Analyzing trace with hash 718968799, now seen corresponding path program 1 times [2024-11-10 01:03:22,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:22,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919573064] [2024-11-10 01:03:22,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:22,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:22,619 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 01:03:22,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:22,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919573064] [2024-11-10 01:03:22,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919573064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:22,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:22,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:03:22,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681322739] [2024-11-10 01:03:22,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:22,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:03:22,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:03:22,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:03:22,622 INFO L87 Difference]: Start difference. First operand 2454 states and 5866 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:03:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:23,112 INFO L93 Difference]: Finished difference Result 2584 states and 6070 transitions. [2024-11-10 01:03:23,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:03:23,113 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 94 [2024-11-10 01:03:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:23,124 INFO L225 Difference]: With dead ends: 2584 [2024-11-10 01:03:23,125 INFO L226 Difference]: Without dead ends: 2457 [2024-11-10 01:03:23,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-10 01:03:23,127 INFO L432 NwaCegarLoop]: 2281 mSDtfsCounter, 15435 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15435 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:03:23,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15435 Valid, 2987 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:03:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2024-11-10 01:03:23,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2454. [2024-11-10 01:03:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2454 states, 2452 states have (on average 2.391924959216966) internal successors, (5865), 2453 states have internal predecessors, (5865), 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 01:03:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2454 states and 5865 transitions. [2024-11-10 01:03:23,199 INFO L78 Accepts]: Start accepts. Automaton has 2454 states and 5865 transitions. Word has length 94 [2024-11-10 01:03:23,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:23,200 INFO L471 AbstractCegarLoop]: Abstraction has 2454 states and 5865 transitions. [2024-11-10 01:03:23,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:03:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 5865 transitions. [2024-11-10 01:03:23,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 01:03:23,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:23,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:03:23,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:03:23,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:23,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1757951802, now seen corresponding path program 1 times [2024-11-10 01:03:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:23,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784946685] [2024-11-10 01:03:23,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:23,414 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 01:03:23,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:23,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784946685] [2024-11-10 01:03:23,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784946685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:23,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:23,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:03:23,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145853984] [2024-11-10 01:03:23,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:23,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:03:23,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:23,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:03:23,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:03:23,419 INFO L87 Difference]: Start difference. First operand 2454 states and 5865 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 01:03:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:23,477 INFO L93 Difference]: Finished difference Result 2696 states and 6247 transitions. [2024-11-10 01:03:23,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:03:23,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-11-10 01:03:23,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:23,490 INFO L225 Difference]: With dead ends: 2696 [2024-11-10 01:03:23,490 INFO L226 Difference]: Without dead ends: 2569 [2024-11-10 01:03:23,492 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 01:03:23,494 INFO L432 NwaCegarLoop]: 2287 mSDtfsCounter, 2192 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2192 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:03:23,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2192 Valid, 2383 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:03:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2024-11-10 01:03:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2564. [2024-11-10 01:03:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2562 states have (on average 2.3563622170179546) internal successors, (6037), 2563 states have internal predecessors, (6037), 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 01:03:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 6037 transitions. [2024-11-10 01:03:23,573 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 6037 transitions. Word has length 95 [2024-11-10 01:03:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:23,575 INFO L471 AbstractCegarLoop]: Abstraction has 2564 states and 6037 transitions. [2024-11-10 01:03:23,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 01:03:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 6037 transitions. [2024-11-10 01:03:23,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:03:23,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:23,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:03:23,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:03:23,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:23,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1443423329, now seen corresponding path program 1 times [2024-11-10 01:03:23,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:23,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585482564] [2024-11-10 01:03:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:23,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:23,686 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 01:03:23,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:23,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585482564] [2024-11-10 01:03:23,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585482564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:23,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:23,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:03:23,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621109899] [2024-11-10 01:03:23,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:23,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:03:23,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:23,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:03:23,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:03:23,689 INFO L87 Difference]: Start difference. First operand 2564 states and 6037 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:03:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:23,738 INFO L93 Difference]: Finished difference Result 3022 states and 6755 transitions. [2024-11-10 01:03:23,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:03:23,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-10 01:03:23,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:23,751 INFO L225 Difference]: With dead ends: 3022 [2024-11-10 01:03:23,751 INFO L226 Difference]: Without dead ends: 2785 [2024-11-10 01:03:23,753 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 01:03:23,754 INFO L432 NwaCegarLoop]: 2370 mSDtfsCounter, 2211 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2211 SdHoareTripleChecker+Valid, 2478 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 01:03:23,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2211 Valid, 2478 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:03:23,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2024-11-10 01:03:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 2782. [2024-11-10 01:03:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2780 states have (on average 2.293525179856115) internal successors, (6376), 2781 states have internal predecessors, (6376), 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 01:03:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 6376 transitions. [2024-11-10 01:03:23,831 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 6376 transitions. Word has length 96 [2024-11-10 01:03:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:23,832 INFO L471 AbstractCegarLoop]: Abstraction has 2782 states and 6376 transitions. [2024-11-10 01:03:23,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:03:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 6376 transitions. [2024-11-10 01:03:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:03:23,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:23,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:03:23,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:03:23,834 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:23,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:23,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1743444063, now seen corresponding path program 1 times [2024-11-10 01:03:23,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:23,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465597016] [2024-11-10 01:03:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:23,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:23,939 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 01:03:23,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:23,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465597016] [2024-11-10 01:03:23,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465597016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:23,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:23,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:03:23,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887842779] [2024-11-10 01:03:23,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:23,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:03:23,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:23,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:03:23,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:03:23,942 INFO L87 Difference]: Start difference. First operand 2782 states and 6376 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:03:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:24,007 INFO L93 Difference]: Finished difference Result 3660 states and 7744 transitions. [2024-11-10 01:03:24,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:03:24,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-10 01:03:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:24,022 INFO L225 Difference]: With dead ends: 3660 [2024-11-10 01:03:24,023 INFO L226 Difference]: Without dead ends: 3205 [2024-11-10 01:03:24,026 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 01:03:24,027 INFO L432 NwaCegarLoop]: 2368 mSDtfsCounter, 2209 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 2480 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 01:03:24,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2209 Valid, 2480 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:03:24,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2024-11-10 01:03:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 3202. [2024-11-10 01:03:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3202 states, 3200 states have (on average 2.194375) internal successors, (7022), 3201 states have internal predecessors, (7022), 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 01:03:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 7022 transitions. [2024-11-10 01:03:24,131 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 7022 transitions. Word has length 96 [2024-11-10 01:03:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:24,132 INFO L471 AbstractCegarLoop]: Abstraction has 3202 states and 7022 transitions. [2024-11-10 01:03:24,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:03:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 7022 transitions. [2024-11-10 01:03:24,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:03:24,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:03:24,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:03:24,134 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:24,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:24,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1778982433, now seen corresponding path program 1 times [2024-11-10 01:03:24,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:24,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343733652] [2024-11-10 01:03:24,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:24,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:24,275 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 01:03:24,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:24,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343733652] [2024-11-10 01:03:24,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343733652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:24,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:24,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:03:24,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514505099] [2024-11-10 01:03:24,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:24,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:03:24,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:24,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:03:24,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:03:24,278 INFO L87 Difference]: Start difference. First operand 3202 states and 7022 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:03:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:24,336 INFO L93 Difference]: Finished difference Result 4888 states and 9626 transitions. [2024-11-10 01:03:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:03:24,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-10 01:03:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:24,354 INFO L225 Difference]: With dead ends: 4888 [2024-11-10 01:03:24,358 INFO L226 Difference]: Without dead ends: 4013 [2024-11-10 01:03:24,361 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 01:03:24,364 INFO L432 NwaCegarLoop]: 2356 mSDtfsCounter, 2205 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 2476 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 01:03:24,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2205 Valid, 2476 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:03:24,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2024-11-10 01:03:24,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 4010. [2024-11-10 01:03:24,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4010 states, 4008 states have (on average 2.058383233532934) internal successors, (8250), 4009 states have internal predecessors, (8250), 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 01:03:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 8250 transitions. [2024-11-10 01:03:24,466 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 8250 transitions. Word has length 96 [2024-11-10 01:03:24,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:24,467 INFO L471 AbstractCegarLoop]: Abstraction has 4010 states and 8250 transitions. [2024-11-10 01:03:24,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:03:24,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 8250 transitions. [2024-11-10 01:03:24,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:03:24,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:24,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:03:24,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:03:24,469 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:24,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:24,469 INFO L85 PathProgramCache]: Analyzing trace with hash 777572705, now seen corresponding path program 1 times [2024-11-10 01:03:24,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:24,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641643142] [2024-11-10 01:03:24,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:24,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:24,551 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 01:03:24,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:24,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641643142] [2024-11-10 01:03:24,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641643142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:24,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:24,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:03:24,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371937349] [2024-11-10 01:03:24,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:24,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:03:24,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:24,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:03:24,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:03:24,554 INFO L87 Difference]: Start difference. First operand 4010 states and 8250 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:03:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:24,643 INFO L93 Difference]: Finished difference Result 7248 states and 13198 transitions. [2024-11-10 01:03:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:03:24,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-10 01:03:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:24,663 INFO L225 Difference]: With dead ends: 7248 [2024-11-10 01:03:24,663 INFO L226 Difference]: Without dead ends: 5565 [2024-11-10 01:03:24,668 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 01:03:24,669 INFO L432 NwaCegarLoop]: 2354 mSDtfsCounter, 2203 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2203 SdHoareTripleChecker+Valid, 2478 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 01:03:24,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2203 Valid, 2478 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:03:24,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5565 states. [2024-11-10 01:03:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5565 to 5562. [2024-11-10 01:03:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5562 states, 5560 states have (on average 1.9025179856115109) internal successors, (10578), 5561 states have internal predecessors, (10578), 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 01:03:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5562 states to 5562 states and 10578 transitions. [2024-11-10 01:03:24,831 INFO L78 Accepts]: Start accepts. Automaton has 5562 states and 10578 transitions. Word has length 96 [2024-11-10 01:03:24,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:24,831 INFO L471 AbstractCegarLoop]: Abstraction has 5562 states and 10578 transitions. [2024-11-10 01:03:24,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:03:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 5562 states and 10578 transitions. [2024-11-10 01:03:24,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:03:24,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:24,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:03:24,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:03:24,837 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:24,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:24,837 INFO L85 PathProgramCache]: Analyzing trace with hash 763122849, now seen corresponding path program 1 times [2024-11-10 01:03:24,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:24,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236409378] [2024-11-10 01:03:24,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:24,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:24,928 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 01:03:24,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:24,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236409378] [2024-11-10 01:03:24,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236409378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:24,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:24,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:03:24,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447597301] [2024-11-10 01:03:24,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:24,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:03:24,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:24,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:03:24,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:03:24,931 INFO L87 Difference]: Start difference. First operand 5562 states and 10578 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:03:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:25,054 INFO L93 Difference]: Finished difference Result 11776 states and 19958 transitions. [2024-11-10 01:03:25,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:03:25,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-10 01:03:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:25,074 INFO L225 Difference]: With dead ends: 11776 [2024-11-10 01:03:25,074 INFO L226 Difference]: Without dead ends: 8541 [2024-11-10 01:03:25,082 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 01:03:25,083 INFO L432 NwaCegarLoop]: 2352 mSDtfsCounter, 2201 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2201 SdHoareTripleChecker+Valid, 2480 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 01:03:25,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2201 Valid, 2480 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:03:25,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8541 states. [2024-11-10 01:03:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8541 to 8538. [2024-11-10 01:03:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8538 states, 8536 states have (on average 1.7546860356138707) internal successors, (14978), 8537 states have internal predecessors, (14978), 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 01:03:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8538 states to 8538 states and 14978 transitions. [2024-11-10 01:03:25,308 INFO L78 Accepts]: Start accepts. Automaton has 8538 states and 14978 transitions. Word has length 96 [2024-11-10 01:03:25,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:25,308 INFO L471 AbstractCegarLoop]: Abstraction has 8538 states and 14978 transitions. [2024-11-10 01:03:25,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:03:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 8538 states and 14978 transitions. [2024-11-10 01:03:25,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:03:25,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:25,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:03:25,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:03:25,310 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:25,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:25,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1440241695, now seen corresponding path program 1 times [2024-11-10 01:03:25,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:25,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664305073] [2024-11-10 01:03:25,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:25,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:25,392 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 01:03:25,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:25,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664305073] [2024-11-10 01:03:25,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664305073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:25,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:25,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:03:25,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627401607] [2024-11-10 01:03:25,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:25,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:03:25,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:25,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:03:25,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:03:25,394 INFO L87 Difference]: Start difference. First operand 8538 states and 14978 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:03:25,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:25,671 INFO L93 Difference]: Finished difference Result 20448 states and 32710 transitions. [2024-11-10 01:03:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:03:25,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-10 01:03:25,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:25,703 INFO L225 Difference]: With dead ends: 20448 [2024-11-10 01:03:25,703 INFO L226 Difference]: Without dead ends: 14237 [2024-11-10 01:03:25,716 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 01:03:25,716 INFO L432 NwaCegarLoop]: 2350 mSDtfsCounter, 2199 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2199 SdHoareTripleChecker+Valid, 2482 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 01:03:25,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2199 Valid, 2482 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:03:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14237 states. [2024-11-10 01:03:26,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14237 to 14234. [2024-11-10 01:03:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14234 states, 14232 states have (on average 1.6347667228780214) internal successors, (23266), 14233 states have internal predecessors, (23266), 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 01:03:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14234 states to 14234 states and 23266 transitions. [2024-11-10 01:03:26,092 INFO L78 Accepts]: Start accepts. Automaton has 14234 states and 23266 transitions. Word has length 96 [2024-11-10 01:03:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:26,093 INFO L471 AbstractCegarLoop]: Abstraction has 14234 states and 23266 transitions. [2024-11-10 01:03:26,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:03:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 14234 states and 23266 transitions. [2024-11-10 01:03:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:03:26,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:26,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:03:26,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:03:26,095 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:26,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:26,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1964518750, now seen corresponding path program 1 times [2024-11-10 01:03:26,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:26,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414573345] [2024-11-10 01:03:26,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:26,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:26,397 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 01:03:26,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:26,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414573345] [2024-11-10 01:03:26,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414573345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:26,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:26,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:03:26,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810692545] [2024-11-10 01:03:26,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:26,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:03:26,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:26,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:03:26,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:03:26,400 INFO L87 Difference]: Start difference. First operand 14234 states and 23266 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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 01:03:26,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:26,656 INFO L93 Difference]: Finished difference Result 14621 states and 23780 transitions. [2024-11-10 01:03:26,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:03:26,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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 96 [2024-11-10 01:03:26,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:26,685 INFO L225 Difference]: With dead ends: 14621 [2024-11-10 01:03:26,685 INFO L226 Difference]: Without dead ends: 14618 [2024-11-10 01:03:26,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:03:26,693 INFO L432 NwaCegarLoop]: 2285 mSDtfsCounter, 0 mSDsluCounter, 13697 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15982 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:03:26,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15982 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:03:26,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14618 states. [2024-11-10 01:03:27,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14618 to 14618. [2024-11-10 01:03:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14618 states, 14616 states have (on average 1.6137110016420362) internal successors, (23586), 14617 states have internal predecessors, (23586), 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 01:03:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14618 states to 14618 states and 23586 transitions. [2024-11-10 01:03:27,181 INFO L78 Accepts]: Start accepts. Automaton has 14618 states and 23586 transitions. Word has length 96 [2024-11-10 01:03:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:27,182 INFO L471 AbstractCegarLoop]: Abstraction has 14618 states and 23586 transitions. [2024-11-10 01:03:27,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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 01:03:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 14618 states and 23586 transitions. [2024-11-10 01:03:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:03:27,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:27,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:03:27,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:03:27,184 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:27,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:27,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2061056737, now seen corresponding path program 1 times [2024-11-10 01:03:27,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:27,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784759872] [2024-11-10 01:03:27,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:27,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:27,260 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 01:03:27,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:27,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784759872] [2024-11-10 01:03:27,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784759872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:27,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:27,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:03:27,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605061822] [2024-11-10 01:03:27,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:27,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:03:27,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:27,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:03:27,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:03:27,262 INFO L87 Difference]: Start difference. First operand 14618 states and 23586 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:03:27,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:27,633 INFO L93 Difference]: Finished difference Result 38176 states and 57638 transitions. [2024-11-10 01:03:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:03:27,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-10 01:03:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:27,690 INFO L225 Difference]: With dead ends: 38176 [2024-11-10 01:03:27,691 INFO L226 Difference]: Without dead ends: 25885 [2024-11-10 01:03:27,716 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 01:03:27,716 INFO L432 NwaCegarLoop]: 2366 mSDtfsCounter, 2207 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2207 SdHoareTripleChecker+Valid, 2482 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 01:03:27,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2207 Valid, 2482 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:03:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25885 states. [2024-11-10 01:03:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25885 to 25882. [2024-11-10 01:03:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25882 states, 25880 states have (on average 1.5246522411128285) internal successors, (39458), 25881 states have internal predecessors, (39458), 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 01:03:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25882 states to 25882 states and 39458 transitions. [2024-11-10 01:03:28,642 INFO L78 Accepts]: Start accepts. Automaton has 25882 states and 39458 transitions. Word has length 96 [2024-11-10 01:03:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:28,642 INFO L471 AbstractCegarLoop]: Abstraction has 25882 states and 39458 transitions. [2024-11-10 01:03:28,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:03:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 25882 states and 39458 transitions. [2024-11-10 01:03:28,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 01:03:28,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:28,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:03:28,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:03:28,645 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:28,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash -360366943, now seen corresponding path program 1 times [2024-11-10 01:03:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:28,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830533078] [2024-11-10 01:03:28,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:28,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:28,757 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 01:03:28,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:28,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830533078] [2024-11-10 01:03:28,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830533078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:28,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:28,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:03:28,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407976369] [2024-11-10 01:03:28,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:28,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:03:28,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:28,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:03:28,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:03:28,761 INFO L87 Difference]: Start difference. First operand 25882 states and 39458 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 01:03:29,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:29,592 INFO L93 Difference]: Finished difference Result 50468 states and 75051 transitions. [2024-11-10 01:03:29,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:03:29,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 98 [2024-11-10 01:03:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:29,662 INFO L225 Difference]: With dead ends: 50468 [2024-11-10 01:03:29,663 INFO L226 Difference]: Without dead ends: 37408 [2024-11-10 01:03:29,688 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 01:03:29,688 INFO L432 NwaCegarLoop]: 2375 mSDtfsCounter, 2210 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2210 SdHoareTripleChecker+Valid, 2479 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 01:03:29,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2210 Valid, 2479 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:03:29,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37408 states. [2024-11-10 01:03:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37408 to 37405. [2024-11-10 01:03:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37405 states, 37403 states have (on average 1.4896398684597492) internal successors, (55717), 37404 states have internal predecessors, (55717), 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 01:03:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37405 states to 37405 states and 55717 transitions. [2024-11-10 01:03:30,611 INFO L78 Accepts]: Start accepts. Automaton has 37405 states and 55717 transitions. Word has length 98 [2024-11-10 01:03:30,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:30,612 INFO L471 AbstractCegarLoop]: Abstraction has 37405 states and 55717 transitions. [2024-11-10 01:03:30,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 01:03:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 37405 states and 55717 transitions. [2024-11-10 01:03:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:03:30,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:30,621 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:03:30,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:03:30,621 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:30,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:30,621 INFO L85 PathProgramCache]: Analyzing trace with hash -469450845, now seen corresponding path program 1 times [2024-11-10 01:03:30,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:30,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025379020] [2024-11-10 01:03:30,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:30,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 01:03:30,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:30,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025379020] [2024-11-10 01:03:30,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025379020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:30,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:30,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:03:30,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408933913] [2024-11-10 01:03:30,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:30,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:03:30,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:30,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:03:30,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:03:30,912 INFO L87 Difference]: Start difference. First operand 37405 states and 55717 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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 01:03:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:35,403 INFO L93 Difference]: Finished difference Result 325176 states and 465975 transitions. [2024-11-10 01:03:35,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:03:35,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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 123 [2024-11-10 01:03:35,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:36,249 INFO L225 Difference]: With dead ends: 325176 [2024-11-10 01:03:36,250 INFO L226 Difference]: Without dead ends: 290101 [2024-11-10 01:03:36,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:03:36,334 INFO L432 NwaCegarLoop]: 2401 mSDtfsCounter, 16563 mSDsluCounter, 4121 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16563 SdHoareTripleChecker+Valid, 6522 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:03:36,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16563 Valid, 6522 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:03:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290101 states. [2024-11-10 01:03:39,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290101 to 72477. [2024-11-10 01:03:40,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72477 states, 72475 states have (on average 1.454032424974129) internal successors, (105381), 72476 states have internal predecessors, (105381), 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 01:03:40,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72477 states to 72477 states and 105381 transitions. [2024-11-10 01:03:40,274 INFO L78 Accepts]: Start accepts. Automaton has 72477 states and 105381 transitions. Word has length 123 [2024-11-10 01:03:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:40,275 INFO L471 AbstractCegarLoop]: Abstraction has 72477 states and 105381 transitions. [2024-11-10 01:03:40,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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 01:03:40,275 INFO L276 IsEmpty]: Start isEmpty. Operand 72477 states and 105381 transitions. [2024-11-10 01:03:40,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:03:40,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:40,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:03:40,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:03:40,287 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:40,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:40,288 INFO L85 PathProgramCache]: Analyzing trace with hash 638649059, now seen corresponding path program 1 times [2024-11-10 01:03:40,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:40,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320429428] [2024-11-10 01:03:40,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:40,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:40,726 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 01:03:40,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:40,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320429428] [2024-11-10 01:03:40,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320429428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:40,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:40,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:03:40,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382761923] [2024-11-10 01:03:40,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:40,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:03:40,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:40,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:03:40,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:03:40,729 INFO L87 Difference]: Start difference. First operand 72477 states and 105381 transitions. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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 01:03:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:03:46,874 INFO L93 Difference]: Finished difference Result 360248 states and 515639 transitions. [2024-11-10 01:03:46,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:03:46,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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 123 [2024-11-10 01:03:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:03:47,665 INFO L225 Difference]: With dead ends: 360248 [2024-11-10 01:03:47,665 INFO L226 Difference]: Without dead ends: 325173 [2024-11-10 01:03:47,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:03:47,762 INFO L432 NwaCegarLoop]: 2397 mSDtfsCounter, 16618 mSDsluCounter, 3903 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16618 SdHoareTripleChecker+Valid, 6300 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:03:47,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16618 Valid, 6300 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:03:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325173 states. [2024-11-10 01:03:52,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325173 to 125213. [2024-11-10 01:03:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125213 states, 125211 states have (on average 1.4345464855324213) internal successors, (179621), 125212 states have internal predecessors, (179621), 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 01:03:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125213 states to 125213 states and 179621 transitions. [2024-11-10 01:03:53,245 INFO L78 Accepts]: Start accepts. Automaton has 125213 states and 179621 transitions. Word has length 123 [2024-11-10 01:03:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:03:53,246 INFO L471 AbstractCegarLoop]: Abstraction has 125213 states and 179621 transitions. [2024-11-10 01:03:53,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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 01:03:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 125213 states and 179621 transitions. [2024-11-10 01:03:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:03:53,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:03:53,257 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:03:53,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:03:53,257 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:03:53,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:03:53,258 INFO L85 PathProgramCache]: Analyzing trace with hash -133891741, now seen corresponding path program 1 times [2024-11-10 01:03:53,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:03:53,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273446741] [2024-11-10 01:03:53,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:03:53,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:03:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:03:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 01:03:53,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:03:53,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273446741] [2024-11-10 01:03:53,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273446741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:03:53,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:03:53,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:03:53,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644772807] [2024-11-10 01:03:53,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:03:53,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:03:53,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:03:53,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:03:53,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:03:53,561 INFO L87 Difference]: Start difference. First operand 125213 states and 179621 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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 01:04:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:01,286 INFO L93 Difference]: Finished difference Result 395320 states and 565303 transitions. [2024-11-10 01:04:01,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:04:01,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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 123 [2024-11-10 01:04:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:01,966 INFO L225 Difference]: With dead ends: 395320 [2024-11-10 01:04:01,966 INFO L226 Difference]: Without dead ends: 360245 [2024-11-10 01:04:02,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:04:02,077 INFO L432 NwaCegarLoop]: 2393 mSDtfsCounter, 16695 mSDsluCounter, 3897 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16695 SdHoareTripleChecker+Valid, 6290 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:02,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16695 Valid, 6290 Invalid, 231 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [7 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:04:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360245 states.