./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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.ufo.BOUNDED-16.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 2046fa69fcebe8f4159e2d29632b696c65fee77505bcacf51c3fef7658ce336a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 09:49:57,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 09:49:57,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 09:49:57,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 09:49:57,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 09:49:57,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 09:49:57,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 09:49:57,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 09:49:57,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 09:49:57,689 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 09:49:57,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 09:49:57,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 09:49:57,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 09:49:57,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 09:49:57,691 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 09:49:57,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 09:49:57,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 09:49:57,692 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 09:49:57,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 09:49:57,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 09:49:57,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 09:49:57,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 09:49:57,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 09:49:57,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 09:49:57,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 09:49:57,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 09:49:57,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 09:49:57,700 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 09:49:57,701 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 09:49:57,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 09:49:57,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 09:49:57,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 09:49:57,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:49:57,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 09:49:57,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 09:49:57,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 09:49:57,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 09:49:57,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 09:49:57,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 09:49:57,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 09:49:57,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 09:49:57,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 09:49:57,704 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 -> 2046fa69fcebe8f4159e2d29632b696c65fee77505bcacf51c3fef7658ce336a [2024-11-16 09:49:57,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 09:49:57,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 09:49:57,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 09:49:57,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 09:49:57,993 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 09:49:57,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label02.c [2024-11-16 09:49:59,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 09:49:59,992 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 09:49:59,995 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label02.c [2024-11-16 09:50:00,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7782f071f/56bddc32b2134d988ae301e12cdacc80/FLAG5eeea3a6b [2024-11-16 09:50:00,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7782f071f/56bddc32b2134d988ae301e12cdacc80 [2024-11-16 09:50:00,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 09:50:00,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 09:50:00,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 09:50:00,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 09:50:00,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 09:50:00,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:50:00" (1/1) ... [2024-11-16 09:50:00,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35d75d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:00, skipping insertion in model container [2024-11-16 09:50:00,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:50:00" (1/1) ... [2024-11-16 09:50:00,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 09:50:00,619 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.ufo.BOUNDED-16.pals+Problem12_label02.c[26860,26873] [2024-11-16 09:50:00,684 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.ufo.BOUNDED-16.pals+Problem12_label02.c[34150,34163] [2024-11-16 09:50:01,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:50:01,271 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 09:50:01,327 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.ufo.BOUNDED-16.pals+Problem12_label02.c[26860,26873] [2024-11-16 09:50:01,344 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.ufo.BOUNDED-16.pals+Problem12_label02.c[34150,34163] [2024-11-16 09:50:01,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:50:01,843 INFO L204 MainTranslator]: Completed translation [2024-11-16 09:50:01,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:01 WrapperNode [2024-11-16 09:50:01,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 09:50:01,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 09:50:01,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 09:50:01,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 09:50:01,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:01" (1/1) ... [2024-11-16 09:50:01,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:01" (1/1) ... [2024-11-16 09:50:02,247 INFO L138 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5291 [2024-11-16 09:50:02,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 09:50:02,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 09:50:02,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 09:50:02,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 09:50:02,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:01" (1/1) ... [2024-11-16 09:50:02,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:01" (1/1) ... [2024-11-16 09:50:02,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:01" (1/1) ... [2024-11-16 09:50:02,494 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-16 09:50:02,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:01" (1/1) ... [2024-11-16 09:50:02,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:01" (1/1) ... [2024-11-16 09:50:02,660 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:01" (1/1) ... [2024-11-16 09:50:02,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:01" (1/1) ... [2024-11-16 09:50:02,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:01" (1/1) ... [2024-11-16 09:50:02,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:01" (1/1) ... [2024-11-16 09:50:02,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 09:50:02,795 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 09:50:02,795 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 09:50:02,795 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 09:50:02,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:01" (1/1) ... [2024-11-16 09:50:02,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:50:02,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:50:02,833 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-16 09:50:02,838 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-16 09:50:02,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 09:50:02,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 09:50:02,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 09:50:02,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 09:50:03,050 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 09:50:03,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 09:50:07,336 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2373: havoc calculate_output_#t~ret50#1; [2024-11-16 09:50:07,337 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3852: havoc calculate_output2_#t~ret51#1; [2024-11-16 09:50:07,337 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L5342: havoc calculate_output3_#t~ret52#1; [2024-11-16 09:50:07,545 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-11-16 09:50:07,546 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 09:50:07,646 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 09:50:07,646 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 09:50:07,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:50:07 BoogieIcfgContainer [2024-11-16 09:50:07,650 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 09:50:07,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 09:50:07,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 09:50:07,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 09:50:07,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:50:00" (1/3) ... [2024-11-16 09:50:07,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12debef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:50:07, skipping insertion in model container [2024-11-16 09:50:07,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:50:01" (2/3) ... [2024-11-16 09:50:07,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12debef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:50:07, skipping insertion in model container [2024-11-16 09:50:07,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:50:07" (3/3) ... [2024-11-16 09:50:07,660 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label02.c [2024-11-16 09:50:07,677 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 09:50:07,677 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 09:50:07,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 09:50:07,791 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;@758306b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 09:50:07,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 09:50:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 954 states, 951 states have (on average 1.896950578338591) internal successors, (1804), 953 states have internal predecessors, (1804), 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-16 09:50:07,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 09:50:07,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:07,815 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-16 09:50:07,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:07,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:07,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1121255932, now seen corresponding path program 1 times [2024-11-16 09:50:07,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:07,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875929897] [2024-11-16 09:50:07,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:07,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:08,190 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-16 09:50:08,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:08,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875929897] [2024-11-16 09:50:08,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875929897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:08,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:08,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 09:50:08,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037866991] [2024-11-16 09:50:08,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:08,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 09:50:08,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:08,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 09:50:08,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 09:50:08,226 INFO L87 Difference]: Start difference. First operand has 954 states, 951 states have (on average 1.896950578338591) internal successors, (1804), 953 states have internal predecessors, (1804), 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-16 09:50:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:08,305 INFO L93 Difference]: Finished difference Result 1839 states and 3476 transitions. [2024-11-16 09:50:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 09:50:08,307 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-16 09:50:08,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:08,324 INFO L225 Difference]: With dead ends: 1839 [2024-11-16 09:50:08,325 INFO L226 Difference]: Without dead ends: 886 [2024-11-16 09:50:08,330 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-16 09:50:08,333 INFO L432 NwaCegarLoop]: 1736 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, 1736 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-16 09:50:08,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:50:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-16 09:50:08,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2024-11-16 09:50:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 884 states have (on average 1.8880090497737556) internal successors, (1669), 885 states have internal predecessors, (1669), 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-16 09:50:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1669 transitions. [2024-11-16 09:50:08,423 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1669 transitions. Word has length 32 [2024-11-16 09:50:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:08,424 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1669 transitions. [2024-11-16 09:50:08,424 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-16 09:50:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1669 transitions. [2024-11-16 09:50:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 09:50:08,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:08,426 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-16 09:50:08,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 09:50:08,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:08,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:08,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1152275739, now seen corresponding path program 1 times [2024-11-16 09:50:08,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:08,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397214557] [2024-11-16 09:50:08,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:08,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:08,769 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-16 09:50:08,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:08,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397214557] [2024-11-16 09:50:08,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397214557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:08,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:08,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:50:08,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031548359] [2024-11-16 09:50:08,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:08,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:50:08,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:08,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:50:08,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:50:08,776 INFO L87 Difference]: Start difference. First operand 886 states and 1669 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-16 09:50:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:08,959 INFO L93 Difference]: Finished difference Result 953 states and 1773 transitions. [2024-11-16 09:50:08,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:50:08,960 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-16 09:50:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:08,965 INFO L225 Difference]: With dead ends: 953 [2024-11-16 09:50:08,965 INFO L226 Difference]: Without dead ends: 886 [2024-11-16 09:50:08,966 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-16 09:50:08,967 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 0 mSDsluCounter, 4935 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6602 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-16 09:50:08,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6602 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:50:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-16 09:50:08,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2024-11-16 09:50:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 884 states have (on average 1.8190045248868778) internal successors, (1608), 885 states have internal predecessors, (1608), 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-16 09:50:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1608 transitions. [2024-11-16 09:50:08,995 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1608 transitions. Word has length 32 [2024-11-16 09:50:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:08,995 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1608 transitions. [2024-11-16 09:50:08,995 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-16 09:50:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1608 transitions. [2024-11-16 09:50:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-16 09:50:08,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:08,999 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-16 09:50:08,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 09:50:08,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:09,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:09,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1503768038, now seen corresponding path program 1 times [2024-11-16 09:50:09,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:09,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953870709] [2024-11-16 09:50:09,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:09,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:09,262 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-16 09:50:09,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:09,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953870709] [2024-11-16 09:50:09,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953870709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:09,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:09,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:50:09,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078208585] [2024-11-16 09:50:09,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:09,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 09:50:09,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:09,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 09:50:09,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 09:50:09,266 INFO L87 Difference]: Start difference. First operand 886 states and 1608 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-16 09:50:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:14,983 INFO L93 Difference]: Finished difference Result 3145 states and 5921 transitions. [2024-11-16 09:50:14,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 09:50:14,985 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-16 09:50:14,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:14,999 INFO L225 Difference]: With dead ends: 3145 [2024-11-16 09:50:15,000 INFO L226 Difference]: Without dead ends: 2390 [2024-11-16 09:50:15,002 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-16 09:50:15,003 INFO L432 NwaCegarLoop]: 862 mSDtfsCounter, 2529 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2529 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-16 09:50:15,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2529 Valid, 885 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-16 09:50:15,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2024-11-16 09:50:15,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2390. [2024-11-16 09:50:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2388 states have (on average 1.501675041876047) internal successors, (3586), 2389 states have internal predecessors, (3586), 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-16 09:50:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3586 transitions. [2024-11-16 09:50:15,120 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3586 transitions. Word has length 65 [2024-11-16 09:50:15,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:15,121 INFO L471 AbstractCegarLoop]: Abstraction has 2390 states and 3586 transitions. [2024-11-16 09:50:15,122 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-16 09:50:15,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3586 transitions. [2024-11-16 09:50:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-16 09:50:15,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:15,127 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-16 09:50:15,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 09:50:15,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:15,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1240650465, now seen corresponding path program 1 times [2024-11-16 09:50:15,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:15,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115602090] [2024-11-16 09:50:15,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:15,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:15,596 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-16 09:50:15,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:15,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115602090] [2024-11-16 09:50:15,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115602090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:15,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:15,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:50:15,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114750735] [2024-11-16 09:50:15,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:15,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:50:15,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:15,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:50:15,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:50:15,600 INFO L87 Difference]: Start difference. First operand 2390 states and 3586 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-16 09:50:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:16,123 INFO L93 Difference]: Finished difference Result 3398 states and 5186 transitions. [2024-11-16 09:50:16,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 09:50:16,124 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-16 09:50:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:16,137 INFO L225 Difference]: With dead ends: 3398 [2024-11-16 09:50:16,137 INFO L226 Difference]: Without dead ends: 3335 [2024-11-16 09:50:16,141 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-16 09:50:16,142 INFO L432 NwaCegarLoop]: 1604 mSDtfsCounter, 13437 mSDsluCounter, 5120 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13437 SdHoareTripleChecker+Valid, 6724 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:50:16,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13437 Valid, 6724 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 09:50:16,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2024-11-16 09:50:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2450. [2024-11-16 09:50:16,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2448 states have (on average 1.5040849673202614) internal successors, (3682), 2449 states have internal predecessors, (3682), 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-16 09:50:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3682 transitions. [2024-11-16 09:50:16,198 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3682 transitions. Word has length 92 [2024-11-16 09:50:16,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:16,200 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 3682 transitions. [2024-11-16 09:50:16,200 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-16 09:50:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3682 transitions. [2024-11-16 09:50:16,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 09:50:16,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:16,202 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-16 09:50:16,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 09:50:16,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:16,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:16,203 INFO L85 PathProgramCache]: Analyzing trace with hash -269795327, now seen corresponding path program 1 times [2024-11-16 09:50:16,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:16,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057120254] [2024-11-16 09:50:16,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:16,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:16,824 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-16 09:50:16,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:16,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057120254] [2024-11-16 09:50:16,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057120254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:16,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:16,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:50:16,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456356186] [2024-11-16 09:50:16,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:16,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:50:16,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:16,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:50:16,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:50:16,829 INFO L87 Difference]: Start difference. First operand 2450 states and 3682 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-16 09:50:17,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:17,297 INFO L93 Difference]: Finished difference Result 2576 states and 3880 transitions. [2024-11-16 09:50:17,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:50:17,298 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-16 09:50:17,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:17,306 INFO L225 Difference]: With dead ends: 2576 [2024-11-16 09:50:17,306 INFO L226 Difference]: Without dead ends: 2453 [2024-11-16 09:50:17,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-16 09:50:17,308 INFO L432 NwaCegarLoop]: 1598 mSDtfsCounter, 9144 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9144 SdHoareTripleChecker+Valid, 2280 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:50:17,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9144 Valid, 2280 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:50:17,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2024-11-16 09:50:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 2450. [2024-11-16 09:50:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2448 states have (on average 1.5036764705882353) internal successors, (3681), 2449 states have internal predecessors, (3681), 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-16 09:50:17,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3681 transitions. [2024-11-16 09:50:17,354 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3681 transitions. Word has length 94 [2024-11-16 09:50:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:17,355 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 3681 transitions. [2024-11-16 09:50:17,355 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-16 09:50:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3681 transitions. [2024-11-16 09:50:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-16 09:50:17,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:17,356 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-16 09:50:17,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 09:50:17,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:17,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:17,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1950098660, now seen corresponding path program 1 times [2024-11-16 09:50:17,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:17,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419976002] [2024-11-16 09:50:17,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:17,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:17,457 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-16 09:50:17,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:17,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419976002] [2024-11-16 09:50:17,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419976002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:17,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:17,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:50:17,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151415298] [2024-11-16 09:50:17,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:17,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:50:17,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:17,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:50:17,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:50:17,459 INFO L87 Difference]: Start difference. First operand 2450 states and 3681 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-16 09:50:17,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:17,497 INFO L93 Difference]: Finished difference Result 2684 states and 4051 transitions. [2024-11-16 09:50:17,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:50:17,498 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-16 09:50:17,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:17,506 INFO L225 Difference]: With dead ends: 2684 [2024-11-16 09:50:17,506 INFO L226 Difference]: Without dead ends: 2561 [2024-11-16 09:50:17,508 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-16 09:50:17,508 INFO L432 NwaCegarLoop]: 1614 mSDtfsCounter, 1510 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:50:17,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1709 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:50:17,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2024-11-16 09:50:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2558. [2024-11-16 09:50:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2556 states have (on average 1.5066510172143974) internal successors, (3851), 2557 states have internal predecessors, (3851), 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-16 09:50:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3851 transitions. [2024-11-16 09:50:17,553 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3851 transitions. Word has length 95 [2024-11-16 09:50:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:17,553 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 3851 transitions. [2024-11-16 09:50:17,554 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-16 09:50:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3851 transitions. [2024-11-16 09:50:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:50:17,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:17,555 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-16 09:50:17,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 09:50:17,555 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:17,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:17,556 INFO L85 PathProgramCache]: Analyzing trace with hash 696752323, now seen corresponding path program 1 times [2024-11-16 09:50:17,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:17,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615226922] [2024-11-16 09:50:17,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:17,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:17,669 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-16 09:50:17,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:17,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615226922] [2024-11-16 09:50:17,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615226922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:17,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:17,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:50:17,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402007754] [2024-11-16 09:50:17,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:17,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:50:17,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:17,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:50:17,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:50:17,672 INFO L87 Difference]: Start difference. First operand 2558 states and 3851 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-16 09:50:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:17,710 INFO L93 Difference]: Finished difference Result 2799 states and 4231 transitions. [2024-11-16 09:50:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:50:17,711 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-16 09:50:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:17,720 INFO L225 Difference]: With dead ends: 2799 [2024-11-16 09:50:17,720 INFO L226 Difference]: Without dead ends: 2676 [2024-11-16 09:50:17,721 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-16 09:50:17,722 INFO L432 NwaCegarLoop]: 1692 mSDtfsCounter, 1530 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 1793 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-16 09:50:17,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 1793 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:50:17,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2024-11-16 09:50:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2673. [2024-11-16 09:50:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2671 states have (on average 1.5091725945338825) internal successors, (4031), 2672 states have internal predecessors, (4031), 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-16 09:50:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 4031 transitions. [2024-11-16 09:50:17,774 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 4031 transitions. Word has length 96 [2024-11-16 09:50:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:17,774 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 4031 transitions. [2024-11-16 09:50:17,774 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-16 09:50:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 4031 transitions. [2024-11-16 09:50:17,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:50:17,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:17,776 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-16 09:50:17,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 09:50:17,776 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:17,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:17,777 INFO L85 PathProgramCache]: Analyzing trace with hash 428870659, now seen corresponding path program 1 times [2024-11-16 09:50:17,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:17,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665890108] [2024-11-16 09:50:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:17,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:17,875 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-16 09:50:17,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:17,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665890108] [2024-11-16 09:50:17,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665890108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:17,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:17,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:50:17,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751312828] [2024-11-16 09:50:17,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:17,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:50:17,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:17,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:50:17,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:50:17,877 INFO L87 Difference]: Start difference. First operand 2673 states and 4031 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-16 09:50:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:17,918 INFO L93 Difference]: Finished difference Result 3335 states and 5073 transitions. [2024-11-16 09:50:17,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:50:17,919 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-16 09:50:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:17,927 INFO L225 Difference]: With dead ends: 3335 [2024-11-16 09:50:17,927 INFO L226 Difference]: Without dead ends: 2992 [2024-11-16 09:50:17,929 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-16 09:50:17,929 INFO L432 NwaCegarLoop]: 1694 mSDtfsCounter, 1528 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1799 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-16 09:50:17,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1528 Valid, 1799 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:50:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2024-11-16 09:50:17,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2989. [2024-11-16 09:50:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2989 states, 2987 states have (on average 1.514228322731838) internal successors, (4523), 2988 states have internal predecessors, (4523), 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-16 09:50:17,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 4523 transitions. [2024-11-16 09:50:17,992 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 4523 transitions. Word has length 96 [2024-11-16 09:50:17,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:17,993 INFO L471 AbstractCegarLoop]: Abstraction has 2989 states and 4523 transitions. [2024-11-16 09:50:17,993 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-16 09:50:17,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 4523 transitions. [2024-11-16 09:50:17,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:50:17,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:17,994 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-16 09:50:17,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 09:50:17,994 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:17,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:17,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1536970563, now seen corresponding path program 1 times [2024-11-16 09:50:17,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:17,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604018885] [2024-11-16 09:50:17,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:17,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:18,102 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-16 09:50:18,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604018885] [2024-11-16 09:50:18,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604018885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:18,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:18,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:50:18,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781025928] [2024-11-16 09:50:18,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:18,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:50:18,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:18,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:50:18,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:50:18,105 INFO L87 Difference]: Start difference. First operand 2989 states and 4523 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-16 09:50:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:18,172 INFO L93 Difference]: Finished difference Result 4259 states and 6507 transitions. [2024-11-16 09:50:18,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:50:18,173 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-16 09:50:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:18,184 INFO L225 Difference]: With dead ends: 4259 [2024-11-16 09:50:18,185 INFO L226 Difference]: Without dead ends: 3600 [2024-11-16 09:50:18,187 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-16 09:50:18,188 INFO L432 NwaCegarLoop]: 1692 mSDtfsCounter, 1526 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1801 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-16 09:50:18,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1801 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:50:18,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2024-11-16 09:50:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 3597. [2024-11-16 09:50:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3597 states, 3595 states have (on average 1.5184979137691237) internal successors, (5459), 3596 states have internal predecessors, (5459), 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-16 09:50:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 5459 transitions. [2024-11-16 09:50:18,264 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 5459 transitions. Word has length 96 [2024-11-16 09:50:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:18,265 INFO L471 AbstractCegarLoop]: Abstraction has 3597 states and 5459 transitions. [2024-11-16 09:50:18,265 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-16 09:50:18,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 5459 transitions. [2024-11-16 09:50:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:50:18,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:18,266 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-16 09:50:18,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 09:50:18,266 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:18,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:18,267 INFO L85 PathProgramCache]: Analyzing trace with hash 764429763, now seen corresponding path program 1 times [2024-11-16 09:50:18,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:18,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144884454] [2024-11-16 09:50:18,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:18,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:18,347 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-16 09:50:18,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:18,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144884454] [2024-11-16 09:50:18,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144884454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:18,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:18,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:50:18,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740414702] [2024-11-16 09:50:18,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:18,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:50:18,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:18,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:50:18,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:50:18,352 INFO L87 Difference]: Start difference. First operand 3597 states and 5459 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-16 09:50:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:18,413 INFO L93 Difference]: Finished difference Result 6035 states and 9231 transitions. [2024-11-16 09:50:18,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:50:18,414 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-16 09:50:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:18,434 INFO L225 Difference]: With dead ends: 6035 [2024-11-16 09:50:18,434 INFO L226 Difference]: Without dead ends: 4768 [2024-11-16 09:50:18,442 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-16 09:50:18,442 INFO L432 NwaCegarLoop]: 1680 mSDtfsCounter, 1522 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1797 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-16 09:50:18,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1797 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:50:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4768 states. [2024-11-16 09:50:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4768 to 4765. [2024-11-16 09:50:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4765 states, 4763 states have (on average 1.5190006298551333) internal successors, (7235), 4764 states have internal predecessors, (7235), 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-16 09:50:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4765 states to 4765 states and 7235 transitions. [2024-11-16 09:50:18,562 INFO L78 Accepts]: Start accepts. Automaton has 4765 states and 7235 transitions. Word has length 96 [2024-11-16 09:50:18,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:18,562 INFO L471 AbstractCegarLoop]: Abstraction has 4765 states and 7235 transitions. [2024-11-16 09:50:18,563 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-16 09:50:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4765 states and 7235 transitions. [2024-11-16 09:50:18,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:50:18,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:18,564 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-16 09:50:18,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 09:50:18,564 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:18,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:18,565 INFO L85 PathProgramCache]: Analyzing trace with hash -236979965, now seen corresponding path program 1 times [2024-11-16 09:50:18,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:18,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106795161] [2024-11-16 09:50:18,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:18,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:18,666 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-16 09:50:18,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:18,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106795161] [2024-11-16 09:50:18,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106795161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:18,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:18,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:50:18,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523272461] [2024-11-16 09:50:18,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:18,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:50:18,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:18,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:50:18,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:50:18,668 INFO L87 Difference]: Start difference. First operand 4765 states and 7235 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-16 09:50:18,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:18,836 INFO L93 Difference]: Finished difference Result 9443 states and 14391 transitions. [2024-11-16 09:50:18,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:50:18,837 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-16 09:50:18,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:18,857 INFO L225 Difference]: With dead ends: 9443 [2024-11-16 09:50:18,857 INFO L226 Difference]: Without dead ends: 7008 [2024-11-16 09:50:18,863 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-16 09:50:18,863 INFO L432 NwaCegarLoop]: 1678 mSDtfsCounter, 1520 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1799 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-16 09:50:18,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1799 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:50:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7008 states. [2024-11-16 09:50:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7008 to 7005. [2024-11-16 09:50:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7005 states, 7003 states have (on average 1.5129230329858632) internal successors, (10595), 7004 states have internal predecessors, (10595), 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-16 09:50:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7005 states to 7005 states and 10595 transitions. [2024-11-16 09:50:19,047 INFO L78 Accepts]: Start accepts. Automaton has 7005 states and 10595 transitions. Word has length 96 [2024-11-16 09:50:19,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:19,047 INFO L471 AbstractCegarLoop]: Abstraction has 7005 states and 10595 transitions. [2024-11-16 09:50:19,047 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-16 09:50:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 7005 states and 10595 transitions. [2024-11-16 09:50:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:50:19,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:19,049 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-16 09:50:19,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 09:50:19,049 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:19,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:19,049 INFO L85 PathProgramCache]: Analyzing trace with hash -251429821, now seen corresponding path program 1 times [2024-11-16 09:50:19,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:19,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477300893] [2024-11-16 09:50:19,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:19,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:19,148 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-16 09:50:19,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:19,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477300893] [2024-11-16 09:50:19,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477300893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:19,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:19,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:50:19,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361643473] [2024-11-16 09:50:19,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:19,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:50:19,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:19,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:50:19,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:50:19,150 INFO L87 Difference]: Start difference. First operand 7005 states and 10595 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-16 09:50:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:19,316 INFO L93 Difference]: Finished difference Result 15971 states and 24135 transitions. [2024-11-16 09:50:19,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:50:19,317 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-16 09:50:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:19,339 INFO L225 Difference]: With dead ends: 15971 [2024-11-16 09:50:19,340 INFO L226 Difference]: Without dead ends: 11296 [2024-11-16 09:50:19,350 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-16 09:50:19,350 INFO L432 NwaCegarLoop]: 1676 mSDtfsCounter, 1518 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1801 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-16 09:50:19,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1801 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:50:19,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11296 states. [2024-11-16 09:50:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11296 to 11293. [2024-11-16 09:50:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11293 states, 11291 states have (on average 1.499512886369675) internal successors, (16931), 11292 states have internal predecessors, (16931), 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-16 09:50:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11293 states to 11293 states and 16931 transitions. [2024-11-16 09:50:19,650 INFO L78 Accepts]: Start accepts. Automaton has 11293 states and 16931 transitions. Word has length 96 [2024-11-16 09:50:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:19,651 INFO L471 AbstractCegarLoop]: Abstraction has 11293 states and 16931 transitions. [2024-11-16 09:50:19,651 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-16 09:50:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 11293 states and 16931 transitions. [2024-11-16 09:50:19,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:50:19,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:19,653 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-16 09:50:19,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 09:50:19,653 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:19,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:19,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1840172931, now seen corresponding path program 1 times [2024-11-16 09:50:19,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:19,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304582440] [2024-11-16 09:50:19,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:19,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:19,748 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-16 09:50:19,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:19,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304582440] [2024-11-16 09:50:19,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304582440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:19,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:19,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:50:19,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097819404] [2024-11-16 09:50:19,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:19,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:50:19,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:19,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:50:19,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:50:19,751 INFO L87 Difference]: Start difference. First operand 11293 states and 16931 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-16 09:50:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:20,150 INFO L93 Difference]: Finished difference Result 28451 states and 42471 transitions. [2024-11-16 09:50:20,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:50:20,151 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-16 09:50:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:20,191 INFO L225 Difference]: With dead ends: 28451 [2024-11-16 09:50:20,192 INFO L226 Difference]: Without dead ends: 19488 [2024-11-16 09:50:20,208 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-16 09:50:20,209 INFO L432 NwaCegarLoop]: 1674 mSDtfsCounter, 1516 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1803 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-16 09:50:20,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1803 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:50:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19488 states. [2024-11-16 09:50:20,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19488 to 19485. [2024-11-16 09:50:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19485 states, 19483 states have (on average 1.4800082122876355) internal successors, (28835), 19484 states have internal predecessors, (28835), 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-16 09:50:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19485 states to 19485 states and 28835 transitions. [2024-11-16 09:50:20,864 INFO L78 Accepts]: Start accepts. Automaton has 19485 states and 28835 transitions. Word has length 96 [2024-11-16 09:50:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:20,864 INFO L471 AbstractCegarLoop]: Abstraction has 19485 states and 28835 transitions. [2024-11-16 09:50:20,864 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-16 09:50:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 19485 states and 28835 transitions. [2024-11-16 09:50:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:50:20,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:20,865 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-16 09:50:20,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 09:50:20,866 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:20,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:20,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1315895876, now seen corresponding path program 1 times [2024-11-16 09:50:20,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:20,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244691584] [2024-11-16 09:50:20,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:20,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:21,192 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-16 09:50:21,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:21,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244691584] [2024-11-16 09:50:21,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244691584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:21,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:21,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:50:21,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430026827] [2024-11-16 09:50:21,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:21,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:50:21,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:21,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:50:21,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:50:21,195 INFO L87 Difference]: Start difference. First operand 19485 states and 28835 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-16 09:50:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:21,586 INFO L93 Difference]: Finished difference Result 20256 states and 29861 transitions. [2024-11-16 09:50:21,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 09:50:21,587 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-16 09:50:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:21,625 INFO L225 Difference]: With dead ends: 20256 [2024-11-16 09:50:21,625 INFO L226 Difference]: Without dead ends: 20253 [2024-11-16 09:50:21,630 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-16 09:50:21,631 INFO L432 NwaCegarLoop]: 1602 mSDtfsCounter, 0 mSDsluCounter, 9599 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11201 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-16 09:50:21,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11201 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:50:21,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20253 states. [2024-11-16 09:50:22,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20253 to 20253. [2024-11-16 09:50:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20253 states, 20251 states have (on average 1.458644017579379) internal successors, (29539), 20252 states have internal predecessors, (29539), 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-16 09:50:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20253 states to 20253 states and 29539 transitions. [2024-11-16 09:50:22,086 INFO L78 Accepts]: Start accepts. Automaton has 20253 states and 29539 transitions. Word has length 96 [2024-11-16 09:50:22,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:22,087 INFO L471 AbstractCegarLoop]: Abstraction has 20253 states and 29539 transitions. [2024-11-16 09:50:22,087 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-16 09:50:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 20253 states and 29539 transitions. [2024-11-16 09:50:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:50:22,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:22,088 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-16 09:50:22,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 09:50:22,089 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:22,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:22,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1046504067, now seen corresponding path program 1 times [2024-11-16 09:50:22,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:22,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835833454] [2024-11-16 09:50:22,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:22,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:22,187 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-16 09:50:22,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:22,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835833454] [2024-11-16 09:50:22,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835833454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:22,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:22,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:50:22,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760096203] [2024-11-16 09:50:22,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:22,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:50:22,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:22,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:50:22,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:50:22,189 INFO L87 Difference]: Start difference. First operand 20253 states and 29539 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-16 09:50:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:22,869 INFO L93 Difference]: Finished difference Result 54563 states and 78951 transitions. [2024-11-16 09:50:22,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:50:22,870 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-16 09:50:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:22,946 INFO L225 Difference]: With dead ends: 54563 [2024-11-16 09:50:22,946 INFO L226 Difference]: Without dead ends: 36640 [2024-11-16 09:50:22,965 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-16 09:50:22,966 INFO L432 NwaCegarLoop]: 1690 mSDtfsCounter, 1524 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1803 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-16 09:50:22,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1803 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:50:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36640 states. [2024-11-16 09:50:23,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36640 to 36637. [2024-11-16 09:50:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36637 states, 36635 states have (on average 1.4334652654565307) internal successors, (52515), 36636 states have internal predecessors, (52515), 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-16 09:50:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36637 states to 36637 states and 52515 transitions. [2024-11-16 09:50:23,946 INFO L78 Accepts]: Start accepts. Automaton has 36637 states and 52515 transitions. Word has length 96 [2024-11-16 09:50:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:23,946 INFO L471 AbstractCegarLoop]: Abstraction has 36637 states and 52515 transitions. [2024-11-16 09:50:23,946 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-16 09:50:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 36637 states and 52515 transitions. [2024-11-16 09:50:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 09:50:23,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:23,957 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-16 09:50:23,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 09:50:23,957 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:23,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:23,957 INFO L85 PathProgramCache]: Analyzing trace with hash -295534365, now seen corresponding path program 1 times [2024-11-16 09:50:23,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:23,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665696833] [2024-11-16 09:50:23,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:23,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 09:50:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665696833] [2024-11-16 09:50:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665696833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:24,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:24,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:50:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713929651] [2024-11-16 09:50:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:24,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:50:24,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:24,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:50:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:50:24,380 INFO L87 Difference]: Start difference. First operand 36637 states and 52515 transitions. Second operand has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 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-16 09:50:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:28,853 INFO L93 Difference]: Finished difference Result 307896 states and 439861 transitions. [2024-11-16 09:50:28,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:50:28,853 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 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-16 09:50:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:29,609 INFO L225 Difference]: With dead ends: 307896 [2024-11-16 09:50:29,609 INFO L226 Difference]: Without dead ends: 283829 [2024-11-16 09:50:29,696 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-16 09:50:29,700 INFO L432 NwaCegarLoop]: 1712 mSDtfsCounter, 11762 mSDsluCounter, 3733 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11762 SdHoareTripleChecker+Valid, 5445 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:50:29,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11762 Valid, 5445 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 09:50:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283829 states. [2024-11-16 09:50:33,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283829 to 65949. [2024-11-16 09:50:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65949 states, 65947 states have (on average 1.4251899252429983) internal successors, (93987), 65948 states have internal predecessors, (93987), 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-16 09:50:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65949 states to 65949 states and 93987 transitions. [2024-11-16 09:50:33,335 INFO L78 Accepts]: Start accepts. Automaton has 65949 states and 93987 transitions. Word has length 123 [2024-11-16 09:50:33,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:33,336 INFO L471 AbstractCegarLoop]: Abstraction has 65949 states and 93987 transitions. [2024-11-16 09:50:33,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 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-16 09:50:33,336 INFO L276 IsEmpty]: Start isEmpty. Operand 65949 states and 93987 transitions. [2024-11-16 09:50:33,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 09:50:33,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:33,351 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-16 09:50:33,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 09:50:33,352 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:33,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:33,353 INFO L85 PathProgramCache]: Analyzing trace with hash -563416029, now seen corresponding path program 1 times [2024-11-16 09:50:33,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:33,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728484023] [2024-11-16 09:50:33,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:33,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:33,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-16 09:50:33,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:33,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728484023] [2024-11-16 09:50:33,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728484023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:33,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:33,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:50:33,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249713698] [2024-11-16 09:50:33,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:33,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:50:33,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:33,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:50:33,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:50:33,913 INFO L87 Difference]: Start difference. First operand 65949 states and 93987 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-16 09:50:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:39,876 INFO L93 Difference]: Finished difference Result 342200 states and 488629 transitions. [2024-11-16 09:50:39,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:50:39,877 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-16 09:50:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:40,587 INFO L225 Difference]: With dead ends: 342200 [2024-11-16 09:50:40,587 INFO L226 Difference]: Without dead ends: 307893 [2024-11-16 09:50:40,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:50:40,880 INFO L432 NwaCegarLoop]: 1713 mSDtfsCounter, 11764 mSDsluCounter, 3666 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11764 SdHoareTripleChecker+Valid, 5379 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:50:40,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11764 Valid, 5379 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 09:50:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307893 states. [2024-11-16 09:50:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307893 to 112285. [2024-11-16 09:50:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112285 states, 112283 states have (on average 1.4207226383334965) internal successors, (159523), 112284 states have internal predecessors, (159523), 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-16 09:50:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112285 states to 112285 states and 159523 transitions. [2024-11-16 09:50:45,794 INFO L78 Accepts]: Start accepts. Automaton has 112285 states and 159523 transitions. Word has length 123 [2024-11-16 09:50:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:50:45,795 INFO L471 AbstractCegarLoop]: Abstraction has 112285 states and 159523 transitions. [2024-11-16 09:50:45,795 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-16 09:50:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 112285 states and 159523 transitions. [2024-11-16 09:50:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 09:50:45,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:50:45,813 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-16 09:50:45,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 09:50:45,813 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:50:45,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:50:45,814 INFO L85 PathProgramCache]: Analyzing trace with hash 544683875, now seen corresponding path program 1 times [2024-11-16 09:50:45,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:50:45,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460254595] [2024-11-16 09:50:45,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:50:45,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:50:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:50:46,155 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-16 09:50:46,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:50:46,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460254595] [2024-11-16 09:50:46,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460254595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:50:46,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:50:46,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:50:46,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901516216] [2024-11-16 09:50:46,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:50:46,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:50:46,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:50:46,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:50:46,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:50:46,158 INFO L87 Difference]: Start difference. First operand 112285 states and 159523 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-16 09:50:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:50:53,574 INFO L93 Difference]: Finished difference Result 376504 states and 537269 transitions. [2024-11-16 09:50:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:50:53,574 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-16 09:50:53,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:50:54,157 INFO L225 Difference]: With dead ends: 376504 [2024-11-16 09:50:54,158 INFO L226 Difference]: Without dead ends: 342197 [2024-11-16 09:50:54,246 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-16 09:50:54,248 INFO L432 NwaCegarLoop]: 1710 mSDtfsCounter, 11810 mSDsluCounter, 3539 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11810 SdHoareTripleChecker+Valid, 5249 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 09:50:54,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11810 Valid, 5249 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 09:50:54,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342197 states. [2024-11-16 09:50:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342197 to 146589. [2024-11-16 09:51:00,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146589 states, 146587 states have (on average 1.4200645350542682) internal successors, (208163), 146588 states have internal predecessors, (208163), 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-16 09:51:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146589 states to 146589 states and 208163 transitions. [2024-11-16 09:51:00,336 INFO L78 Accepts]: Start accepts. Automaton has 146589 states and 208163 transitions. Word has length 123 [2024-11-16 09:51:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:00,336 INFO L471 AbstractCegarLoop]: Abstraction has 146589 states and 208163 transitions. [2024-11-16 09:51:00,336 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-16 09:51:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 146589 states and 208163 transitions. [2024-11-16 09:51:00,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 09:51:00,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:00,357 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-16 09:51:00,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 09:51:00,357 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:00,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:00,358 INFO L85 PathProgramCache]: Analyzing trace with hash -227856925, now seen corresponding path program 1 times [2024-11-16 09:51:00,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:00,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678914593] [2024-11-16 09:51:00,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:00,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:00,617 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-16 09:51:00,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:00,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678914593] [2024-11-16 09:51:00,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678914593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:00,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:00,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:51:00,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372047881] [2024-11-16 09:51:00,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:00,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:51:00,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:00,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:51:00,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:51:00,621 INFO L87 Difference]: Start difference. First operand 146589 states and 208163 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)