./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.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 c91ca4899b5af8ca28cd56fdb53af71cf5c86f932b323279b0b6773f1f060e71 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:45:47,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:45:47,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:45:47,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:45:47,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:45:47,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:45:47,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:45:47,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:45:47,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:45:47,845 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:45:47,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:45:47,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:45:47,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:45:47,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:45:47,847 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:45:47,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:45:47,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:45:47,850 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:45:47,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:45:47,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:45:47,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:45:47,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:45:47,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:45:47,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:45:47,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:45:47,853 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:45:47,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:45:47,854 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:45:47,854 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:45:47,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:45:47,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:45:47,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:45:47,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:45:47,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:45:47,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:45:47,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:45:47,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:45:47,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:45:47,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:45:47,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:45:47,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:45:47,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:45:47,860 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 -> c91ca4899b5af8ca28cd56fdb53af71cf5c86f932b323279b0b6773f1f060e71 [2024-11-10 00:45:48,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:45:48,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:45:48,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:45:48,101 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:45:48,102 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:45:48,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c [2024-11-10 00:45:49,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:45:49,966 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:45:49,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c [2024-11-10 00:45:49,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bfa07cb0/526760e552f6400d99ad68fe91309173/FLAG7943662b3 [2024-11-10 00:45:50,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bfa07cb0/526760e552f6400d99ad68fe91309173 [2024-11-10 00:45:50,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:45:50,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:45:50,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:45:50,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:45:50,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:45:50,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:45:50" (1/1) ... [2024-11-10 00:45:50,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6cc2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:45:50, skipping insertion in model container [2024-11-10 00:45:50,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:45:50" (1/1) ... [2024-11-10 00:45:50,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:45:50,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c[6391,6404] [2024-11-10 00:45:50,534 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c[13452,13465] [2024-11-10 00:45:51,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:45:51,053 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:45:51,082 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c[6391,6404] [2024-11-10 00:45:51,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c[13452,13465] [2024-11-10 00:45:51,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:45:51,420 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:45:51,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:45:51 WrapperNode [2024-11-10 00:45:51,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:45:51,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:45:51,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:45:51,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:45:51,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:45:51" (1/1) ... [2024-11-10 00:45:51,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:45:51" (1/1) ... [2024-11-10 00:45:51,680 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4982 [2024-11-10 00:45:51,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:45:51,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:45:51,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:45:51,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:45:51,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:45:51" (1/1) ... [2024-11-10 00:45:51,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:45:51" (1/1) ... [2024-11-10 00:45:51,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:45:51" (1/1) ... [2024-11-10 00:45:51,976 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:45:51,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:45:51" (1/1) ... [2024-11-10 00:45:51,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:45:51" (1/1) ... [2024-11-10 00:45:52,113 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:45:51" (1/1) ... [2024-11-10 00:45:52,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:45:51" (1/1) ... [2024-11-10 00:45:52,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:45:51" (1/1) ... [2024-11-10 00:45:52,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:45:51" (1/1) ... [2024-11-10 00:45:52,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:45:52,223 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:45:52,223 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:45:52,223 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:45:52,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:45:51" (1/1) ... [2024-11-10 00:45:52,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:45:52,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:45:52,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:45:52,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:45:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:45:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:45:52,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:45:52,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:45:52,468 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:45:52,470 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:45:56,908 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1984: havoc calculate_output_#t~ret30#1; [2024-11-10 00:45:56,908 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3463: havoc calculate_output2_#t~ret31#1; [2024-11-10 00:45:56,908 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4953: havoc calculate_output3_#t~ret32#1; [2024-11-10 00:45:57,151 INFO L? ?]: Removed 2069 outVars from TransFormulas that were not future-live. [2024-11-10 00:45:57,151 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:45:57,177 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:45:57,178 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:45:57,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:45:57 BoogieIcfgContainer [2024-11-10 00:45:57,178 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:45:57,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:45:57,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:45:57,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:45:57,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:45:50" (1/3) ... [2024-11-10 00:45:57,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18925513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:45:57, skipping insertion in model container [2024-11-10 00:45:57,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:45:51" (2/3) ... [2024-11-10 00:45:57,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18925513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:45:57, skipping insertion in model container [2024-11-10 00:45:57,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:45:57" (3/3) ... [2024-11-10 00:45:57,185 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c [2024-11-10 00:45:57,198 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:45:57,199 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:45:57,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:45:57,289 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;@25998ee3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:45:57,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:45:57,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 879 states, 876 states have (on average 2.675799086757991) internal successors, (2344), 878 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:57,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:45:57,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:45:57,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:45:57,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:45:57,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:45:57,334 INFO L85 PathProgramCache]: Analyzing trace with hash -754437650, now seen corresponding path program 1 times [2024-11-10 00:45:57,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:45:57,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592201722] [2024-11-10 00:45:57,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:45:57,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:45:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:45:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:45:57,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:45:57,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592201722] [2024-11-10 00:45:57,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592201722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:45:57,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:45:57,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:45:57,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602388476] [2024-11-10 00:45:57,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:45:57,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:45:57,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:45:57,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:45:57,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:45:57,697 INFO L87 Difference]: Start difference. First operand has 879 states, 876 states have (on average 2.675799086757991) internal successors, (2344), 878 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:45:57,776 INFO L93 Difference]: Finished difference Result 1734 states and 4646 transitions. [2024-11-10 00:45:57,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:45:57,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-10 00:45:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:45:57,793 INFO L225 Difference]: With dead ends: 1734 [2024-11-10 00:45:57,794 INFO L226 Difference]: Without dead ends: 811 [2024-11-10 00:45:57,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:45:57,800 INFO L432 NwaCegarLoop]: 2276 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, 2276 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:45:57,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:45:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-10 00:45:57,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2024-11-10 00:45:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 2.7305315203955502) internal successors, (2209), 810 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2209 transitions. [2024-11-10 00:45:57,862 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2209 transitions. Word has length 22 [2024-11-10 00:45:57,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:45:57,862 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 2209 transitions. [2024-11-10 00:45:57,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2209 transitions. [2024-11-10 00:45:57,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:45:57,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:45:57,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:45:57,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:45:57,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:45:57,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:45:57,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1264971827, now seen corresponding path program 1 times [2024-11-10 00:45:57,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:45:57,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072257311] [2024-11-10 00:45:57,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:45:57,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:45:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:45:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:45:57,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:45:57,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072257311] [2024-11-10 00:45:57,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072257311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:45:57,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:45:57,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:45:57,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49865840] [2024-11-10 00:45:57,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:45:57,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:45:57,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:45:57,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:45:57,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:45:57,984 INFO L87 Difference]: Start difference. First operand 811 states and 2209 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:58,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:45:58,091 INFO L93 Difference]: Finished difference Result 881 states and 2313 transitions. [2024-11-10 00:45:58,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:45:58,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-10 00:45:58,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:45:58,096 INFO L225 Difference]: With dead ends: 881 [2024-11-10 00:45:58,097 INFO L226 Difference]: Without dead ends: 844 [2024-11-10 00:45:58,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:45:58,099 INFO L432 NwaCegarLoop]: 2205 mSDtfsCounter, 49 mSDsluCounter, 6593 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 8798 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:45:58,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 8798 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:45:58,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-10 00:45:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 811. [2024-11-10 00:45:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 2.710754017305315) internal successors, (2193), 810 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2193 transitions. [2024-11-10 00:45:58,132 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2193 transitions. Word has length 22 [2024-11-10 00:45:58,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:45:58,133 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 2193 transitions. [2024-11-10 00:45:58,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2193 transitions. [2024-11-10 00:45:58,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 00:45:58,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:45:58,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:45:58,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:45:58,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:45:58,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:45:58,140 INFO L85 PathProgramCache]: Analyzing trace with hash 606557701, now seen corresponding path program 1 times [2024-11-10 00:45:58,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:45:58,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039627273] [2024-11-10 00:45:58,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:45:58,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:45:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:45:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:45:58,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:45:58,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039627273] [2024-11-10 00:45:58,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039627273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:45:58,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:45:58,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:45:58,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103357479] [2024-11-10 00:45:58,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:45:58,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:45:58,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:45:58,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:45:58,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:45:58,285 INFO L87 Difference]: Start difference. First operand 811 states and 2193 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:45:58,410 INFO L93 Difference]: Finished difference Result 1009 states and 2493 transitions. [2024-11-10 00:45:58,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:45:58,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-10 00:45:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:45:58,416 INFO L225 Difference]: With dead ends: 1009 [2024-11-10 00:45:58,417 INFO L226 Difference]: Without dead ends: 976 [2024-11-10 00:45:58,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:45:58,419 INFO L432 NwaCegarLoop]: 2189 mSDtfsCounter, 6651 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6651 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:45:58,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6651 Valid, 2577 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:45:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-10 00:45:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 841. [2024-11-10 00:45:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 839 states have (on average 2.66865315852205) internal successors, (2239), 840 states have internal predecessors, (2239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2239 transitions. [2024-11-10 00:45:58,440 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 2239 transitions. Word has length 37 [2024-11-10 00:45:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:45:58,440 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 2239 transitions. [2024-11-10 00:45:58,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 2239 transitions. [2024-11-10 00:45:58,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 00:45:58,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:45:58,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:45:58,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:45:58,443 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:45:58,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:45:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1075758951, now seen corresponding path program 1 times [2024-11-10 00:45:58,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:45:58,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802287403] [2024-11-10 00:45:58,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:45:58,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:45:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:45:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:45:58,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:45:58,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802287403] [2024-11-10 00:45:58,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802287403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:45:58,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:45:58,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:45:58,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601866683] [2024-11-10 00:45:58,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:45:58,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:45:58,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:45:58,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:45:58,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:45:58,703 INFO L87 Difference]: Start difference. First operand 841 states and 2239 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:45:58,764 INFO L93 Difference]: Finished difference Result 907 states and 2337 transitions. [2024-11-10 00:45:58,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:45:58,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-10 00:45:58,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:45:58,768 INFO L225 Difference]: With dead ends: 907 [2024-11-10 00:45:58,768 INFO L226 Difference]: Without dead ends: 844 [2024-11-10 00:45:58,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:45:58,769 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 4314 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4314 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:45:58,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4314 Valid, 2283 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:45:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-10 00:45:58,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 841. [2024-11-10 00:45:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 839 states have (on average 2.66746126340882) internal successors, (2238), 840 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2238 transitions. [2024-11-10 00:45:58,786 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 2238 transitions. Word has length 39 [2024-11-10 00:45:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:45:58,786 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 2238 transitions. [2024-11-10 00:45:58,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:58,787 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 2238 transitions. [2024-11-10 00:45:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 00:45:58,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:45:58,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:45:58,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:45:58,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:45:58,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:45:58,788 INFO L85 PathProgramCache]: Analyzing trace with hash 712608318, now seen corresponding path program 1 times [2024-11-10 00:45:58,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:45:58,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069173844] [2024-11-10 00:45:58,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:45:58,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:45:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:45:58,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:45:58,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:45:58,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069173844] [2024-11-10 00:45:58,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069173844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:45:58,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:45:58,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:45:58,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43410776] [2024-11-10 00:45:58,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:45:58,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:45:58,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:45:58,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:45:58,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:45:58,827 INFO L87 Difference]: Start difference. First operand 841 states and 2238 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:45:58,852 INFO L93 Difference]: Finished difference Result 955 states and 2408 transitions. [2024-11-10 00:45:58,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:45:58,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-10 00:45:58,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:45:58,855 INFO L225 Difference]: With dead ends: 955 [2024-11-10 00:45:58,856 INFO L226 Difference]: Without dead ends: 892 [2024-11-10 00:45:58,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:45:58,857 INFO L432 NwaCegarLoop]: 2199 mSDtfsCounter, 2150 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2150 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:45:58,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2150 Valid, 2244 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:45:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-11-10 00:45:58,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 889. [2024-11-10 00:45:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 887 states have (on average 2.602029312288613) internal successors, (2308), 888 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 2308 transitions. [2024-11-10 00:45:58,875 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 2308 transitions. Word has length 40 [2024-11-10 00:45:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:45:58,875 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 2308 transitions. [2024-11-10 00:45:58,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 2308 transitions. [2024-11-10 00:45:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:45:58,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:45:58,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:45:58,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:45:58,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:45:58,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:45:58,882 INFO L85 PathProgramCache]: Analyzing trace with hash 55525097, now seen corresponding path program 1 times [2024-11-10 00:45:58,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:45:58,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48424673] [2024-11-10 00:45:58,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:45:58,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:45:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:45:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:45:58,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:45:58,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48424673] [2024-11-10 00:45:58,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48424673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:45:58,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:45:58,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:45:58,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468123286] [2024-11-10 00:45:58,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:45:58,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:45:58,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:45:58,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:45:58,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:45:58,940 INFO L87 Difference]: Start difference. First operand 889 states and 2308 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:58,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:45:58,964 INFO L93 Difference]: Finished difference Result 1010 states and 2488 transitions. [2024-11-10 00:45:58,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:45:58,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:45:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:45:58,968 INFO L225 Difference]: With dead ends: 1010 [2024-11-10 00:45:58,968 INFO L226 Difference]: Without dead ends: 947 [2024-11-10 00:45:58,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:45:58,970 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2160 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:45:58,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 2278 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:45:58,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-11-10 00:45:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 944. [2024-11-10 00:45:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 942 states have (on average 2.535031847133758) internal successors, (2388), 943 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 2388 transitions. [2024-11-10 00:45:58,992 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 2388 transitions. Word has length 41 [2024-11-10 00:45:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:45:58,993 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 2388 transitions. [2024-11-10 00:45:58,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 2388 transitions. [2024-11-10 00:45:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:45:58,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:45:58,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] [2024-11-10 00:45:58,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:45:58,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:45:58,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:45:58,995 INFO L85 PathProgramCache]: Analyzing trace with hash 41075241, now seen corresponding path program 1 times [2024-11-10 00:45:58,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:45:58,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999303066] [2024-11-10 00:45:58,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:45:58,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:45:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:45:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:45:59,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:45:59,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999303066] [2024-11-10 00:45:59,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999303066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:45:59,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:45:59,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:45:59,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285596237] [2024-11-10 00:45:59,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:45:59,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:45:59,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:45:59,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:45:59,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:45:59,037 INFO L87 Difference]: Start difference. First operand 944 states and 2388 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:45:59,060 INFO L93 Difference]: Finished difference Result 1246 states and 2830 transitions. [2024-11-10 00:45:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:45:59,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:45:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:45:59,064 INFO L225 Difference]: With dead ends: 1246 [2024-11-10 00:45:59,064 INFO L226 Difference]: Without dead ends: 1083 [2024-11-10 00:45:59,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:45:59,066 INFO L432 NwaCegarLoop]: 2229 mSDtfsCounter, 2158 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:45:59,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2158 Valid, 2284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:45:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-11-10 00:45:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1080. [2024-11-10 00:45:59,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1078 states have (on average 2.3933209647495364) internal successors, (2580), 1079 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 2580 transitions. [2024-11-10 00:45:59,088 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 2580 transitions. Word has length 41 [2024-11-10 00:45:59,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:45:59,088 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 2580 transitions. [2024-11-10 00:45:59,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:59,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 2580 transitions. [2024-11-10 00:45:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:45:59,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:45:59,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:45:59,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:45:59,090 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:45:59,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:45:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2132677993, now seen corresponding path program 1 times [2024-11-10 00:45:59,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:45:59,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068898774] [2024-11-10 00:45:59,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:45:59,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:45:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:45:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:45:59,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:45:59,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068898774] [2024-11-10 00:45:59,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068898774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:45:59,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:45:59,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:45:59,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444145200] [2024-11-10 00:45:59,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:45:59,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:45:59,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:45:59,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:45:59,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:45:59,133 INFO L87 Difference]: Start difference. First operand 1080 states and 2580 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:45:59,160 INFO L93 Difference]: Finished difference Result 1630 states and 3364 transitions. [2024-11-10 00:45:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:45:59,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:45:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:45:59,167 INFO L225 Difference]: With dead ends: 1630 [2024-11-10 00:45:59,167 INFO L226 Difference]: Without dead ends: 1331 [2024-11-10 00:45:59,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:45:59,170 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2156 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2156 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:45:59,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2156 Valid, 2286 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:45:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2024-11-10 00:45:59,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1328. [2024-11-10 00:45:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1326 states have (on average 2.1990950226244346) internal successors, (2916), 1327 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2916 transitions. [2024-11-10 00:45:59,198 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2916 transitions. Word has length 41 [2024-11-10 00:45:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:45:59,199 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2916 transitions. [2024-11-10 00:45:59,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:59,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2916 transitions. [2024-11-10 00:45:59,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:45:59,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:45:59,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:45:59,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:45:59,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:45:59,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:45:59,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1608400938, now seen corresponding path program 1 times [2024-11-10 00:45:59,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:45:59,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108117021] [2024-11-10 00:45:59,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:45:59,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:45:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:45:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:45:59,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:45:59,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108117021] [2024-11-10 00:45:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108117021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:45:59,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:45:59,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:45:59,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988772249] [2024-11-10 00:45:59,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:45:59,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:45:59,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:45:59,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:45:59,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:45:59,348 INFO L87 Difference]: Start difference. First operand 1328 states and 2916 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:45:59,414 INFO L93 Difference]: Finished difference Result 1379 states and 2982 transitions. [2024-11-10 00:45:59,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:45:59,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:45:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:45:59,419 INFO L225 Difference]: With dead ends: 1379 [2024-11-10 00:45:59,419 INFO L226 Difference]: Without dead ends: 1376 [2024-11-10 00:45:59,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:45:59,420 INFO L432 NwaCegarLoop]: 2187 mSDtfsCounter, 0 mSDsluCounter, 13106 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15293 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:45:59,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15293 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:45:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-10 00:45:59,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2024-11-10 00:45:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1374 states have (on average 2.1542940320232895) internal successors, (2960), 1375 states have internal predecessors, (2960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2960 transitions. [2024-11-10 00:45:59,444 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2960 transitions. Word has length 41 [2024-11-10 00:45:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:45:59,444 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 2960 transitions. [2024-11-10 00:45:59,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2960 transitions. [2024-11-10 00:45:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:45:59,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:45:59,445 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:45:59,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:45:59,446 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:45:59,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:45:59,446 INFO L85 PathProgramCache]: Analyzing trace with hash 18026415, now seen corresponding path program 1 times [2024-11-10 00:45:59,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:45:59,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305331941] [2024-11-10 00:45:59,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:45:59,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:45:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:45:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:45:59,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:45:59,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305331941] [2024-11-10 00:45:59,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305331941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:45:59,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:45:59,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:45:59,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672054513] [2024-11-10 00:45:59,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:45:59,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:45:59,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:45:59,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:45:59,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:45:59,524 INFO L87 Difference]: Start difference. First operand 1376 states and 2960 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:45:59,609 INFO L93 Difference]: Finished difference Result 3144 states and 5372 transitions. [2024-11-10 00:45:59,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:45:59,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:45:59,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:45:59,621 INFO L225 Difference]: With dead ends: 3144 [2024-11-10 00:45:59,621 INFO L226 Difference]: Without dead ends: 2709 [2024-11-10 00:45:59,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:45:59,624 INFO L432 NwaCegarLoop]: 2235 mSDtfsCounter, 4415 mSDsluCounter, 2306 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4415 SdHoareTripleChecker+Valid, 4541 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:45:59,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4415 Valid, 4541 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:45:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states. [2024-11-10 00:45:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 1892. [2024-11-10 00:45:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1890 states have (on average 1.9343915343915343) internal successors, (3656), 1891 states have internal predecessors, (3656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 3656 transitions. [2024-11-10 00:45:59,679 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 3656 transitions. Word has length 58 [2024-11-10 00:45:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:45:59,680 INFO L471 AbstractCegarLoop]: Abstraction has 1892 states and 3656 transitions. [2024-11-10 00:45:59,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 3656 transitions. [2024-11-10 00:45:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:45:59,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:45:59,681 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:45:59,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:45:59,681 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:45:59,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:45:59,682 INFO L85 PathProgramCache]: Analyzing trace with hash 3576559, now seen corresponding path program 1 times [2024-11-10 00:45:59,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:45:59,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105149400] [2024-11-10 00:45:59,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:45:59,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:45:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:45:59,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:45:59,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:45:59,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105149400] [2024-11-10 00:45:59,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105149400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:45:59,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:45:59,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:45:59,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758541674] [2024-11-10 00:45:59,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:45:59,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:45:59,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:45:59,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:45:59,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:45:59,797 INFO L87 Difference]: Start difference. First operand 1892 states and 3656 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:45:59,886 INFO L93 Difference]: Finished difference Result 3736 states and 6176 transitions. [2024-11-10 00:45:59,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:45:59,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:45:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:45:59,895 INFO L225 Difference]: With dead ends: 3736 [2024-11-10 00:45:59,896 INFO L226 Difference]: Without dead ends: 3141 [2024-11-10 00:45:59,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:45:59,898 INFO L432 NwaCegarLoop]: 2236 mSDtfsCounter, 4412 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4412 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:45:59,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4412 Valid, 4539 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:45:59,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2024-11-10 00:45:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2700. [2024-11-10 00:45:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2698 states have (on average 1.7583395107487028) internal successors, (4744), 2699 states have internal predecessors, (4744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 4744 transitions. [2024-11-10 00:45:59,951 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 4744 transitions. Word has length 58 [2024-11-10 00:45:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:45:59,951 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 4744 transitions. [2024-11-10 00:45:59,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:45:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 4744 transitions. [2024-11-10 00:45:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:45:59,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:45:59,953 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:45:59,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:45:59,953 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:45:59,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:45:59,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2095179311, now seen corresponding path program 1 times [2024-11-10 00:45:59,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:45:59,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615309853] [2024-11-10 00:45:59,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:45:59,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:45:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:46:00,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:00,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615309853] [2024-11-10 00:46:00,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615309853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:00,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:00,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:46:00,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112855713] [2024-11-10 00:46:00,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:00,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:46:00,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:00,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:46:00,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:00,029 INFO L87 Difference]: Start difference. First operand 2700 states and 4744 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:00,189 INFO L93 Difference]: Finished difference Result 4328 states and 6976 transitions. [2024-11-10 00:46:00,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:46:00,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:46:00,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:00,199 INFO L225 Difference]: With dead ends: 4328 [2024-11-10 00:46:00,200 INFO L226 Difference]: Without dead ends: 3733 [2024-11-10 00:46:00,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:46:00,201 INFO L432 NwaCegarLoop]: 2237 mSDtfsCounter, 4421 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4421 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:00,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4421 Valid, 4538 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2024-11-10 00:46:00,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3292. [2024-11-10 00:46:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3292 states, 3290 states have (on average 1.6851063829787234) internal successors, (5544), 3291 states have internal predecessors, (5544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 5544 transitions. [2024-11-10 00:46:00,262 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 5544 transitions. Word has length 58 [2024-11-10 00:46:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:00,262 INFO L471 AbstractCegarLoop]: Abstraction has 3292 states and 5544 transitions. [2024-11-10 00:46:00,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:00,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 5544 transitions. [2024-11-10 00:46:00,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:46:00,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:00,264 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:00,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:46:00,264 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:00,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:00,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1862091119, now seen corresponding path program 1 times [2024-11-10 00:46:00,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:00,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679660974] [2024-11-10 00:46:00,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:00,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:00,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:00,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679660974] [2024-11-10 00:46:00,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679660974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:00,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:00,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:00,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332138769] [2024-11-10 00:46:00,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:00,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:00,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:00,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:00,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:00,329 INFO L87 Difference]: Start difference. First operand 3292 states and 5544 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:00,375 INFO L93 Difference]: Finished difference Result 5806 states and 8944 transitions. [2024-11-10 00:46:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:00,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:46:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:00,385 INFO L225 Difference]: With dead ends: 5806 [2024-11-10 00:46:00,385 INFO L226 Difference]: Without dead ends: 3295 [2024-11-10 00:46:00,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:00,389 INFO L432 NwaCegarLoop]: 2213 mSDtfsCounter, 28 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4394 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:00,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4394 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:00,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2024-11-10 00:46:00,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3292. [2024-11-10 00:46:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3292 states, 3290 states have (on average 1.6699088145896657) internal successors, (5494), 3291 states have internal predecessors, (5494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 5494 transitions. [2024-11-10 00:46:00,448 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 5494 transitions. Word has length 60 [2024-11-10 00:46:00,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:00,448 INFO L471 AbstractCegarLoop]: Abstraction has 3292 states and 5494 transitions. [2024-11-10 00:46:00,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 5494 transitions. [2024-11-10 00:46:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:46:00,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:00,449 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:00,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:46:00,449 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:00,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1431466449, now seen corresponding path program 1 times [2024-11-10 00:46:00,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:00,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041685697] [2024-11-10 00:46:00,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:00,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:00,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:00,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041685697] [2024-11-10 00:46:00,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041685697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:00,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:00,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:00,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477908670] [2024-11-10 00:46:00,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:00,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:00,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:00,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:00,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:00,508 INFO L87 Difference]: Start difference. First operand 3292 states and 5494 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:00,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:00,536 INFO L93 Difference]: Finished difference Result 4287 states and 6830 transitions. [2024-11-10 00:46:00,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:00,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:46:00,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:00,544 INFO L225 Difference]: With dead ends: 4287 [2024-11-10 00:46:00,544 INFO L226 Difference]: Without dead ends: 1776 [2024-11-10 00:46:00,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:00,547 INFO L432 NwaCegarLoop]: 2211 mSDtfsCounter, 24 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:00,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4391 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:00,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-10 00:46:00,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1766. [2024-11-10 00:46:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.9580498866213152) internal successors, (3454), 1765 states have internal predecessors, (3454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 3454 transitions. [2024-11-10 00:46:00,583 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 3454 transitions. Word has length 60 [2024-11-10 00:46:00,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:00,584 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 3454 transitions. [2024-11-10 00:46:00,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 3454 transitions. [2024-11-10 00:46:00,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:46:00,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:00,586 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:00,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:46:00,586 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:00,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:00,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1439328557, now seen corresponding path program 1 times [2024-11-10 00:46:00,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:00,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042545799] [2024-11-10 00:46:00,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:00,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:00,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:00,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042545799] [2024-11-10 00:46:00,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042545799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:00,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:00,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:00,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791619011] [2024-11-10 00:46:00,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:00,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:00,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:00,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:00,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:00,658 INFO L87 Difference]: Start difference. First operand 1766 states and 3454 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:00,679 INFO L93 Difference]: Finished difference Result 2258 states and 4106 transitions. [2024-11-10 00:46:00,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:00,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 00:46:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:00,686 INFO L225 Difference]: With dead ends: 2258 [2024-11-10 00:46:00,686 INFO L226 Difference]: Without dead ends: 1283 [2024-11-10 00:46:00,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:00,688 INFO L432 NwaCegarLoop]: 2205 mSDtfsCounter, 22 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4370 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:00,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4370 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2024-11-10 00:46:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1280. [2024-11-10 00:46:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1278 states have (on average 2.1885758998435056) internal successors, (2797), 1279 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 2797 transitions. [2024-11-10 00:46:00,713 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 2797 transitions. Word has length 62 [2024-11-10 00:46:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:00,714 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 2797 transitions. [2024-11-10 00:46:00,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 2797 transitions. [2024-11-10 00:46:00,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 00:46:00,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:00,716 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] [2024-11-10 00:46:00,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:46:00,716 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:00,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:00,716 INFO L85 PathProgramCache]: Analyzing trace with hash -588989900, now seen corresponding path program 1 times [2024-11-10 00:46:00,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:00,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926998721] [2024-11-10 00:46:00,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:00,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:00,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:00,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926998721] [2024-11-10 00:46:00,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926998721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:00,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:00,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298076346] [2024-11-10 00:46:00,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:00,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:46:00,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:00,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:46:00,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:46:00,837 INFO L87 Difference]: Start difference. First operand 1280 states and 2797 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:08,075 INFO L93 Difference]: Finished difference Result 3539 states and 9150 transitions. [2024-11-10 00:46:08,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:46:08,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2024-11-10 00:46:08,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:08,082 INFO L225 Difference]: With dead ends: 3539 [2024-11-10 00:46:08,082 INFO L226 Difference]: Without dead ends: 2784 [2024-11-10 00:46:08,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:08,084 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 4383 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4383 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 9119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:08,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4383 Valid, 790 Invalid, 9119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-11-10 00:46:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2024-11-10 00:46:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2784. [2024-11-10 00:46:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2782 states have (on average 2.205248023005032) internal successors, (6135), 2783 states have internal predecessors, (6135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 6135 transitions. [2024-11-10 00:46:08,148 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 6135 transitions. Word has length 63 [2024-11-10 00:46:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:08,148 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 6135 transitions. [2024-11-10 00:46:08,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 6135 transitions. [2024-11-10 00:46:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 00:46:08,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:08,150 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:08,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:46:08,150 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:08,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:08,151 INFO L85 PathProgramCache]: Analyzing trace with hash 111390330, now seen corresponding path program 1 times [2024-11-10 00:46:08,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:08,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748203300] [2024-11-10 00:46:08,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:08,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:08,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748203300] [2024-11-10 00:46:08,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748203300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:46:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989132614] [2024-11-10 00:46:08,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:08,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:46:08,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:46:08,568 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:46:08,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:46:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:08,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 00:46:08,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:46:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:10,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:46:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:12,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989132614] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:46:12,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:46:12,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 17] total 42 [2024-11-10 00:46:12,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893090738] [2024-11-10 00:46:12,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:46:12,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 00:46:12,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:12,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 00:46:12,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1533, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 00:46:12,922 INFO L87 Difference]: Start difference. First operand 2784 states and 6135 transitions. Second operand has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:25,447 INFO L93 Difference]: Finished difference Result 6116 states and 10479 transitions. [2024-11-10 00:46:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-11-10 00:46:25,448 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 00:46:25,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:25,457 INFO L225 Difference]: With dead ends: 6116 [2024-11-10 00:46:25,457 INFO L226 Difference]: Without dead ends: 5627 [2024-11-10 00:46:25,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5284 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=2700, Invalid=13812, Unknown=0, NotChecked=0, Total=16512 [2024-11-10 00:46:25,462 INFO L432 NwaCegarLoop]: 2193 mSDtfsCounter, 28153 mSDsluCounter, 27012 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28153 SdHoareTripleChecker+Valid, 29205 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:25,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28153 Valid, 29205 Invalid, 1637 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [70 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 00:46:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5627 states. [2024-11-10 00:46:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5627 to 4025. [2024-11-10 00:46:25,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4025 states, 4023 states have (on average 1.920705940840169) internal successors, (7727), 4024 states have internal predecessors, (7727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4025 states to 4025 states and 7727 transitions. [2024-11-10 00:46:25,542 INFO L78 Accepts]: Start accepts. Automaton has 4025 states and 7727 transitions. Word has length 64 [2024-11-10 00:46:25,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:25,542 INFO L471 AbstractCegarLoop]: Abstraction has 4025 states and 7727 transitions. [2024-11-10 00:46:25,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4025 states and 7727 transitions. [2024-11-10 00:46:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 00:46:25,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:25,544 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:25,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:46:25,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 00:46:25,748 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:25,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:25,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2088033447, now seen corresponding path program 1 times [2024-11-10 00:46:25,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:25,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458264264] [2024-11-10 00:46:25,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:25,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:26,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:26,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458264264] [2024-11-10 00:46:26,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458264264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:46:26,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699712148] [2024-11-10 00:46:26,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:26,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:46:26,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:46:26,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:46:26,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:46:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:26,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 00:46:26,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:46:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:27,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:46:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:28,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699712148] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:46:28,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:46:28,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2024-11-10 00:46:28,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734790381] [2024-11-10 00:46:28,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:46:28,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 00:46:28,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:28,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 00:46:28,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2024-11-10 00:46:28,028 INFO L87 Difference]: Start difference. First operand 4025 states and 7727 transitions. Second operand has 27 states, 27 states have (on average 5.814814814814815) internal successors, (157), 26 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:29,309 INFO L93 Difference]: Finished difference Result 7128 states and 11740 transitions. [2024-11-10 00:46:29,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-10 00:46:29,310 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.814814814814815) internal successors, (157), 26 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-10 00:46:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:29,318 INFO L225 Difference]: With dead ends: 7128 [2024-11-10 00:46:29,318 INFO L226 Difference]: Without dead ends: 5645 [2024-11-10 00:46:29,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=617, Invalid=2035, Unknown=0, NotChecked=0, Total=2652 [2024-11-10 00:46:29,322 INFO L432 NwaCegarLoop]: 2186 mSDtfsCounter, 26621 mSDsluCounter, 7034 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26621 SdHoareTripleChecker+Valid, 9220 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:29,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26621 Valid, 9220 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:46:29,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5645 states. [2024-11-10 00:46:29,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5645 to 5558. [2024-11-10 00:46:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5558 states, 5556 states have (on average 1.7368610511159108) internal successors, (9650), 5557 states have internal predecessors, (9650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 9650 transitions. [2024-11-10 00:46:29,428 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 9650 transitions. Word has length 65 [2024-11-10 00:46:29,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:29,428 INFO L471 AbstractCegarLoop]: Abstraction has 5558 states and 9650 transitions. [2024-11-10 00:46:29,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.814814814814815) internal successors, (157), 26 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:29,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 9650 transitions. [2024-11-10 00:46:29,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 00:46:29,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:29,429 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:29,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 00:46:29,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 00:46:29,634 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:29,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:29,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1924712451, now seen corresponding path program 1 times [2024-11-10 00:46:29,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:29,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813186208] [2024-11-10 00:46:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:31,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:31,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813186208] [2024-11-10 00:46:31,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813186208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:46:31,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975046461] [2024-11-10 00:46:31,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:31,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:46:31,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:46:31,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:46:31,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:46:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:31,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 00:46:31,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:46:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:32,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:46:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:32,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975046461] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:46:32,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:46:32,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 43 [2024-11-10 00:46:32,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894338290] [2024-11-10 00:46:32,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:46:32,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-10 00:46:32,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:32,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-10 00:46:32,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1662, Unknown=0, NotChecked=0, Total=1806 [2024-11-10 00:46:32,785 INFO L87 Difference]: Start difference. First operand 5558 states and 9650 transitions. Second operand has 43 states, 43 states have (on average 4.093023255813954) internal successors, (176), 43 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:47,639 INFO L93 Difference]: Finished difference Result 21097 states and 29353 transitions. [2024-11-10 00:46:47,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2024-11-10 00:46:47,640 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 4.093023255813954) internal successors, (176), 43 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-10 00:46:47,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:47,668 INFO L225 Difference]: With dead ends: 21097 [2024-11-10 00:46:47,668 INFO L226 Difference]: Without dead ends: 18667 [2024-11-10 00:46:47,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8534 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=5007, Invalid=20115, Unknown=0, NotChecked=0, Total=25122 [2024-11-10 00:46:47,679 INFO L432 NwaCegarLoop]: 2251 mSDtfsCounter, 32860 mSDsluCounter, 34893 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32860 SdHoareTripleChecker+Valid, 37144 SdHoareTripleChecker+Invalid, 2794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:47,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32860 Valid, 37144 Invalid, 2794 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [125 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 00:46:47,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18667 states. [2024-11-10 00:46:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18667 to 6747. [2024-11-10 00:46:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6747 states, 6745 states have (on average 1.65114899925871) internal successors, (11137), 6746 states have internal predecessors, (11137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6747 states to 6747 states and 11137 transitions. [2024-11-10 00:46:47,929 INFO L78 Accepts]: Start accepts. Automaton has 6747 states and 11137 transitions. Word has length 65 [2024-11-10 00:46:47,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:47,929 INFO L471 AbstractCegarLoop]: Abstraction has 6747 states and 11137 transitions. [2024-11-10 00:46:47,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.093023255813954) internal successors, (176), 43 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 6747 states and 11137 transitions. [2024-11-10 00:46:47,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:46:47,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:47,930 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:47,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 00:46:48,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:46:48,132 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:48,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:48,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1274102374, now seen corresponding path program 1 times [2024-11-10 00:46:48,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:48,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381498626] [2024-11-10 00:46:48,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:48,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:46:48,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:48,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381498626] [2024-11-10 00:46:48,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381498626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:46:48,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035362327] [2024-11-10 00:46:48,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:48,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:46:48,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:46:48,345 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:46:48,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:46:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:48,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 00:46:48,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:46:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:46:48,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:46:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:46:48,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035362327] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:46:48,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:46:48,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2024-11-10 00:46:48,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015161253] [2024-11-10 00:46:48,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:46:48,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:46:48,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:48,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:46:48,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:46:48,682 INFO L87 Difference]: Start difference. First operand 6747 states and 11137 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:49,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:49,091 INFO L93 Difference]: Finished difference Result 13736 states and 19764 transitions. [2024-11-10 00:46:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:46:49,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:46:49,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:49,113 INFO L225 Difference]: With dead ends: 13736 [2024-11-10 00:46:49,117 INFO L226 Difference]: Without dead ends: 9312 [2024-11-10 00:46:49,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:46:49,128 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 2221 mSDsluCounter, 4517 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2221 SdHoareTripleChecker+Valid, 6705 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:49,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2221 Valid, 6705 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9312 states. [2024-11-10 00:46:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9312 to 8808. [2024-11-10 00:46:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8808 states, 8806 states have (on average 1.5200999318646378) internal successors, (13386), 8807 states have internal predecessors, (13386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8808 states to 8808 states and 13386 transitions. [2024-11-10 00:46:49,531 INFO L78 Accepts]: Start accepts. Automaton has 8808 states and 13386 transitions. Word has length 67 [2024-11-10 00:46:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:49,531 INFO L471 AbstractCegarLoop]: Abstraction has 8808 states and 13386 transitions. [2024-11-10 00:46:49,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 8808 states and 13386 transitions. [2024-11-10 00:46:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:46:49,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:49,532 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:49,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 00:46:49,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:46:49,736 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:49,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash -989829978, now seen corresponding path program 1 times [2024-11-10 00:46:49,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:49,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816767790] [2024-11-10 00:46:49,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:49,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:50,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:50,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816767790] [2024-11-10 00:46:50,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816767790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:46:50,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344546209] [2024-11-10 00:46:50,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:50,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:46:50,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:46:50,146 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:46:50,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 00:46:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:50,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 00:46:50,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:46:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:51,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:46:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:53,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344546209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:46:53,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:46:53,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 18] total 44 [2024-11-10 00:46:53,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810691607] [2024-11-10 00:46:53,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:46:53,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-10 00:46:53,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:53,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-10 00:46:53,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1628, Unknown=0, NotChecked=0, Total=1892 [2024-11-10 00:46:53,275 INFO L87 Difference]: Start difference. First operand 8808 states and 13386 transitions. Second operand has 44 states, 44 states have (on average 3.727272727272727) internal successors, (164), 44 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:56,675 INFO L93 Difference]: Finished difference Result 16045 states and 22239 transitions. [2024-11-10 00:46:56,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-10 00:46:56,676 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.727272727272727) internal successors, (164), 44 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:46:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:56,685 INFO L225 Difference]: With dead ends: 16045 [2024-11-10 00:46:56,685 INFO L226 Difference]: Without dead ends: 11429 [2024-11-10 00:46:56,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1216, Invalid=4334, Unknown=0, NotChecked=0, Total=5550 [2024-11-10 00:46:56,690 INFO L432 NwaCegarLoop]: 2172 mSDtfsCounter, 35501 mSDsluCounter, 28488 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35501 SdHoareTripleChecker+Valid, 30660 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:56,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35501 Valid, 30660 Invalid, 1079 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [79 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 00:46:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11429 states. [2024-11-10 00:46:56,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11429 to 8120. [2024-11-10 00:46:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8120 states, 8118 states have (on average 1.5458240946045825) internal successors, (12549), 8119 states have internal predecessors, (12549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8120 states to 8120 states and 12549 transitions. [2024-11-10 00:46:56,971 INFO L78 Accepts]: Start accepts. Automaton has 8120 states and 12549 transitions. Word has length 67 [2024-11-10 00:46:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:56,972 INFO L471 AbstractCegarLoop]: Abstraction has 8120 states and 12549 transitions. [2024-11-10 00:46:56,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.727272727272727) internal successors, (164), 44 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:56,972 INFO L276 IsEmpty]: Start isEmpty. Operand 8120 states and 12549 transitions. [2024-11-10 00:46:56,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 00:46:56,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:56,974 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 00:46:56,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 00:46:57,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:46:57,178 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:57,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash 862412274, now seen corresponding path program 1 times [2024-11-10 00:46:57,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:57,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969030963] [2024-11-10 00:46:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:57,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:57,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:57,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969030963] [2024-11-10 00:46:57,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969030963] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:46:57,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525136998] [2024-11-10 00:46:57,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:57,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:46:57,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:46:57,678 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:46:57,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 00:46:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:57,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 00:46:57,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:46:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:58,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:01,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525136998] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:01,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:01,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 17] total 44 [2024-11-10 00:47:01,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132524380] [2024-11-10 00:47:01,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:01,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-10 00:47:01,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:01,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-10 00:47:01,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1718, Unknown=0, NotChecked=0, Total=1892 [2024-11-10 00:47:01,409 INFO L87 Difference]: Start difference. First operand 8120 states and 12549 transitions. Second operand has 44 states, 44 states have (on average 6.613636363636363) internal successors, (291), 44 states have internal predecessors, (291), 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)