./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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 aa83d3f5173117ef698c13f0bcf19338ee3f6f59e63ac9b8ac7bd80f7d40c635 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:52:14,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:52:15,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:52:15,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:52:15,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:52:15,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:52:15,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:52:15,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:52:15,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:52:15,088 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:52:15,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:52:15,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:52:15,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:52:15,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:52:15,095 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:52:15,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:52:15,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:52:15,095 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:52:15,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:52:15,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:52:15,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:52:15,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:52:15,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:52:15,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:52:15,100 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:52:15,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:52:15,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:52:15,100 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:52:15,101 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:52:15,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:52:15,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:52:15,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:52:15,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:52:15,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:52:15,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:52:15,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:52:15,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:52:15,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:52:15,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:52:15,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:52:15,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:52:15,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:52:15,104 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 -> aa83d3f5173117ef698c13f0bcf19338ee3f6f59e63ac9b8ac7bd80f7d40c635 [2024-11-10 00:52:15,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:52:15,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:52:15,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:52:15,375 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:52:15,376 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:52:15,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-11-10 00:52:17,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:52:17,677 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:52:17,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-11-10 00:52:17,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1d482040/59fb6f13fb624d9183ed31c902c1a929/FLAGfd14ac9d4 [2024-11-10 00:52:17,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1d482040/59fb6f13fb624d9183ed31c902c1a929 [2024-11-10 00:52:17,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:52:17,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:52:17,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:52:17,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:52:17,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:52:17,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:52:17" (1/1) ... [2024-11-10 00:52:17,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3948fde2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:17, skipping insertion in model container [2024-11-10 00:52:17,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:52:17" (1/1) ... [2024-11-10 00:52:17,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:52:18,253 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.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[8786,8799] [2024-11-10 00:52:18,309 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.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[14341,14354] [2024-11-10 00:52:18,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:52:18,980 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:52:19,028 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.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[8786,8799] [2024-11-10 00:52:19,042 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.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[14341,14354] [2024-11-10 00:52:19,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:52:19,439 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:52:19,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:19 WrapperNode [2024-11-10 00:52:19,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:52:19,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:52:19,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:52:19,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:52:19,446 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:52:19" (1/1) ... [2024-11-10 00:52:19,501 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:52:19" (1/1) ... [2024-11-10 00:52:19,834 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5035 [2024-11-10 00:52:19,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:52:19,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:52:19,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:52:19,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:52:19,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:19" (1/1) ... [2024-11-10 00:52:19,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:19" (1/1) ... [2024-11-10 00:52:20,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:19" (1/1) ... [2024-11-10 00:52:20,159 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:52:20,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:19" (1/1) ... [2024-11-10 00:52:20,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:19" (1/1) ... [2024-11-10 00:52:20,367 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:19" (1/1) ... [2024-11-10 00:52:20,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:19" (1/1) ... [2024-11-10 00:52:20,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:19" (1/1) ... [2024-11-10 00:52:20,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:19" (1/1) ... [2024-11-10 00:52:20,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:52:20,473 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:52:20,474 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:52:20,474 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:52:20,475 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:19" (1/1) ... [2024-11-10 00:52:20,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:52:20,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:20,507 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:52:20,509 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:52:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:52:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:52:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:52:20,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:52:20,673 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:52:20,675 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:52:26,221 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5024: havoc calculate_output3_#t~ret35#1; [2024-11-10 00:52:26,221 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2055: havoc calculate_output_#t~ret33#1; [2024-11-10 00:52:26,221 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3534: havoc calculate_output2_#t~ret34#1; [2024-11-10 00:52:26,419 INFO L? ?]: Removed 2076 outVars from TransFormulas that were not future-live. [2024-11-10 00:52:26,419 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:52:26,446 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:52:26,446 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:52:26,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:52:26 BoogieIcfgContainer [2024-11-10 00:52:26,447 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:52:26,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:52:26,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:52:26,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:52:26,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:52:17" (1/3) ... [2024-11-10 00:52:26,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9ac32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:52:26, skipping insertion in model container [2024-11-10 00:52:26,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:52:19" (2/3) ... [2024-11-10 00:52:26,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9ac32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:52:26, skipping insertion in model container [2024-11-10 00:52:26,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:52:26" (3/3) ... [2024-11-10 00:52:26,460 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-11-10 00:52:26,492 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:52:26,492 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:52:26,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:52:26,642 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;@2cf6272d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:52:26,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:52:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 892 states, 889 states have (on average 2.6636670416197976) internal successors, (2368), 891 states have internal predecessors, (2368), 0 states have call successors, (0), 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:52:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 00:52:26,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:26,676 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] [2024-11-10 00:52:26,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:26,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:26,688 INFO L85 PathProgramCache]: Analyzing trace with hash -576025244, now seen corresponding path program 1 times [2024-11-10 00:52:26,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:26,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97128171] [2024-11-10 00:52:26,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:26,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:26,901 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:52:26,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:26,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97128171] [2024-11-10 00:52:26,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97128171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:26,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:26,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:52:26,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393400777] [2024-11-10 00:52:26,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:26,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:52:26,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:26,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:52:26,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:52:26,926 INFO L87 Difference]: Start difference. First operand has 892 states, 889 states have (on average 2.6636670416197976) internal successors, (2368), 891 states have internal predecessors, (2368), 0 states have call successors, (0), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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:52:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:27,000 INFO L93 Difference]: Finished difference Result 1751 states and 4678 transitions. [2024-11-10 00:52:27,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:52:27,005 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-10 00:52:27,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:27,031 INFO L225 Difference]: With dead ends: 1751 [2024-11-10 00:52:27,032 INFO L226 Difference]: Without dead ends: 824 [2024-11-10 00:52:27,040 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:52:27,045 INFO L432 NwaCegarLoop]: 2297 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, 2297 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:52:27,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-11-10 00:52:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2024-11-10 00:52:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 822 states have (on average 2.71654501216545) internal successors, (2233), 823 states have internal predecessors, (2233), 0 states have call successors, (0), 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:52:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2233 transitions. [2024-11-10 00:52:27,140 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2233 transitions. Word has length 24 [2024-11-10 00:52:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:27,141 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 2233 transitions. [2024-11-10 00:52:27,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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:52:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2233 transitions. [2024-11-10 00:52:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 00:52:27,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:27,142 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] [2024-11-10 00:52:27,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:52:27,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:27,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1573097597, now seen corresponding path program 1 times [2024-11-10 00:52:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:27,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733164140] [2024-11-10 00:52:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:27,375 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:52:27,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:27,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733164140] [2024-11-10 00:52:27,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733164140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:27,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:27,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:52:27,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743525438] [2024-11-10 00:52:27,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:27,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:52:27,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:27,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:52:27,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:52:27,383 INFO L87 Difference]: Start difference. First operand 824 states and 2233 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:52:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:27,621 INFO L93 Difference]: Finished difference Result 867 states and 2297 transitions. [2024-11-10 00:52:27,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:52:27,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-10 00:52:27,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:27,633 INFO L225 Difference]: With dead ends: 867 [2024-11-10 00:52:27,633 INFO L226 Difference]: Without dead ends: 824 [2024-11-10 00:52:27,634 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:52:27,635 INFO L432 NwaCegarLoop]: 2231 mSDtfsCounter, 0 mSDsluCounter, 6665 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8896 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:27,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8896 Invalid, 35 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:27,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-11-10 00:52:27,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2024-11-10 00:52:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 822 states have (on average 2.6885644768856447) internal successors, (2210), 823 states have internal predecessors, (2210), 0 states have call successors, (0), 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:52:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2210 transitions. [2024-11-10 00:52:27,677 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2210 transitions. Word has length 24 [2024-11-10 00:52:27,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:27,678 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 2210 transitions. [2024-11-10 00:52:27,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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:52:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2210 transitions. [2024-11-10 00:52:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 00:52:27,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:27,683 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] [2024-11-10 00:52:27,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:52:27,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:27,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:27,684 INFO L85 PathProgramCache]: Analyzing trace with hash 67352845, now seen corresponding path program 1 times [2024-11-10 00:52:27,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:27,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787917609] [2024-11-10 00:52:27,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:27,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:27,975 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:52:27,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:27,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787917609] [2024-11-10 00:52:27,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787917609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:27,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:27,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:27,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142281152] [2024-11-10 00:52:27,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:27,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:27,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:27,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:27,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:27,981 INFO L87 Difference]: Start difference. First operand 824 states and 2210 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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:52:28,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:28,270 INFO L93 Difference]: Finished difference Result 1136 states and 2690 transitions. [2024-11-10 00:52:28,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 00:52:28,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-11-10 00:52:28,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:28,279 INFO L225 Difference]: With dead ends: 1136 [2024-11-10 00:52:28,279 INFO L226 Difference]: Without dead ends: 1097 [2024-11-10 00:52:28,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:52:28,285 INFO L432 NwaCegarLoop]: 2206 mSDtfsCounter, 8967 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8967 SdHoareTripleChecker+Valid, 3042 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:28,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8967 Valid, 3042 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-10 00:52:28,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 860. [2024-11-10 00:52:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 858 states have (on average 2.641025641025641) internal successors, (2266), 859 states have internal predecessors, (2266), 0 states have call successors, (0), 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:52:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2266 transitions. [2024-11-10 00:52:28,319 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 2266 transitions. Word has length 46 [2024-11-10 00:52:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:28,319 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 2266 transitions. [2024-11-10 00:52:28,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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:52:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 2266 transitions. [2024-11-10 00:52:28,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 00:52:28,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:28,323 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] [2024-11-10 00:52:28,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:52:28,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:28,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:28,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1704032145, now seen corresponding path program 1 times [2024-11-10 00:52:28,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:28,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656759914] [2024-11-10 00:52:28,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:28,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:28,560 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:52:28,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:28,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656759914] [2024-11-10 00:52:28,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656759914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:28,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:28,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:28,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256367059] [2024-11-10 00:52:28,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:28,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:28,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:28,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:28,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:28,563 INFO L87 Difference]: Start difference. First operand 860 states and 2266 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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:52:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:28,659 INFO L93 Difference]: Finished difference Result 938 states and 2384 transitions. [2024-11-10 00:52:28,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:28,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-11-10 00:52:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:28,663 INFO L225 Difference]: With dead ends: 938 [2024-11-10 00:52:28,663 INFO L226 Difference]: Without dead ends: 863 [2024-11-10 00:52:28,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:52:28,668 INFO L432 NwaCegarLoop]: 2204 mSDtfsCounter, 6498 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6498 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:28,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6498 Valid, 2372 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:28,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-10 00:52:28,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 860. [2024-11-10 00:52:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 858 states have (on average 2.63986013986014) internal successors, (2265), 859 states have internal predecessors, (2265), 0 states have call successors, (0), 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:52:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2265 transitions. [2024-11-10 00:52:28,684 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 2265 transitions. Word has length 48 [2024-11-10 00:52:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:28,684 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 2265 transitions. [2024-11-10 00:52:28,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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:52:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 2265 transitions. [2024-11-10 00:52:28,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 00:52:28,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:28,685 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] [2024-11-10 00:52:28,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:52:28,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:28,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:28,686 INFO L85 PathProgramCache]: Analyzing trace with hash 438430262, now seen corresponding path program 1 times [2024-11-10 00:52:28,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:28,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754236515] [2024-11-10 00:52:28,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:28,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:28,735 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:52:28,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:28,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754236515] [2024-11-10 00:52:28,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754236515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:28,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:28,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:28,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77675385] [2024-11-10 00:52:28,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:28,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:28,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:28,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:28,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:28,737 INFO L87 Difference]: Start difference. First operand 860 states and 2265 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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:52:28,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:28,763 INFO L93 Difference]: Finished difference Result 998 states and 2475 transitions. [2024-11-10 00:52:28,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:28,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-11-10 00:52:28,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:28,767 INFO L225 Difference]: With dead ends: 998 [2024-11-10 00:52:28,767 INFO L226 Difference]: Without dead ends: 923 [2024-11-10 00:52:28,767 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:52:28,768 INFO L432 NwaCegarLoop]: 2216 mSDtfsCounter, 2158 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 2271 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:52:28,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2158 Valid, 2271 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:28,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-10 00:52:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2024-11-10 00:52:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 918 states have (on average 2.565359477124183) internal successors, (2355), 919 states have internal predecessors, (2355), 0 states have call successors, (0), 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:52:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2355 transitions. [2024-11-10 00:52:28,783 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2355 transitions. Word has length 49 [2024-11-10 00:52:28,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:28,783 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 2355 transitions. [2024-11-10 00:52:28,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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:52:28,784 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2355 transitions. [2024-11-10 00:52:28,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:28,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:28,784 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] [2024-11-10 00:52:28,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:52:28,784 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:28,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:28,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1147349681, now seen corresponding path program 1 times [2024-11-10 00:52:28,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:28,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405042297] [2024-11-10 00:52:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:28,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:28,821 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:52:28,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:28,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405042297] [2024-11-10 00:52:28,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405042297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:28,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:28,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:28,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252701765] [2024-11-10 00:52:28,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:28,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:28,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:28,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:28,823 INFO L87 Difference]: Start difference. First operand 920 states and 2355 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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:52:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:28,844 INFO L93 Difference]: Finished difference Result 1065 states and 2575 transitions. [2024-11-10 00:52:28,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:28,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-10 00:52:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:28,847 INFO L225 Difference]: With dead ends: 1065 [2024-11-10 00:52:28,847 INFO L226 Difference]: Without dead ends: 990 [2024-11-10 00:52:28,848 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:52:28,848 INFO L432 NwaCegarLoop]: 2254 mSDtfsCounter, 2170 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 2315 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:52:28,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 2315 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:28,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-11-10 00:52:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 987. [2024-11-10 00:52:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 985 states have (on average 2.4923857868020303) internal successors, (2455), 986 states have internal predecessors, (2455), 0 states have call successors, (0), 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:52:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 2455 transitions. [2024-11-10 00:52:28,864 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 2455 transitions. Word has length 50 [2024-11-10 00:52:28,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:28,864 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 2455 transitions. [2024-11-10 00:52:28,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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:52:28,864 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 2455 transitions. [2024-11-10 00:52:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:28,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:28,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:28,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:52:28,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:28,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:28,865 INFO L85 PathProgramCache]: Analyzing trace with hash 145939953, now seen corresponding path program 1 times [2024-11-10 00:52:28,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:28,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841733511] [2024-11-10 00:52:28,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:28,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:28,909 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:52:28,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:28,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841733511] [2024-11-10 00:52:28,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841733511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:28,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:28,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:28,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15989610] [2024-11-10 00:52:28,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:28,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:28,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:28,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:28,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:28,911 INFO L87 Difference]: Start difference. First operand 987 states and 2455 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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:52:28,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:28,934 INFO L93 Difference]: Finished difference Result 1361 states and 3017 transitions. [2024-11-10 00:52:28,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:28,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-10 00:52:28,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:28,938 INFO L225 Difference]: With dead ends: 1361 [2024-11-10 00:52:28,938 INFO L226 Difference]: Without dead ends: 1162 [2024-11-10 00:52:28,938 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:52:28,939 INFO L432 NwaCegarLoop]: 2256 mSDtfsCounter, 2168 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2168 SdHoareTripleChecker+Valid, 2321 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:52:28,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2168 Valid, 2321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:28,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2024-11-10 00:52:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1159. [2024-11-10 00:52:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1157 states have (on average 2.3396715643906654) internal successors, (2707), 1158 states have internal predecessors, (2707), 0 states have call successors, (0), 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:52:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 2707 transitions. [2024-11-10 00:52:28,962 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 2707 transitions. Word has length 50 [2024-11-10 00:52:28,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:28,962 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 2707 transitions. [2024-11-10 00:52:28,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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:52:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 2707 transitions. [2024-11-10 00:52:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:28,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:28,963 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] [2024-11-10 00:52:28,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:52:28,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:28,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:28,963 INFO L85 PathProgramCache]: Analyzing trace with hash 131490097, now seen corresponding path program 1 times [2024-11-10 00:52:28,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:28,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629846052] [2024-11-10 00:52:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:28,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:29,011 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:52:29,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:29,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629846052] [2024-11-10 00:52:29,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629846052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:29,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:29,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:29,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377646397] [2024-11-10 00:52:29,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:29,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:29,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:29,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:29,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:29,014 INFO L87 Difference]: Start difference. First operand 1159 states and 2707 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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:52:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:29,039 INFO L93 Difference]: Finished difference Result 1853 states and 3731 transitions. [2024-11-10 00:52:29,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:29,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-10 00:52:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:29,045 INFO L225 Difference]: With dead ends: 1853 [2024-11-10 00:52:29,045 INFO L226 Difference]: Without dead ends: 1482 [2024-11-10 00:52:29,045 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:52:29,046 INFO L432 NwaCegarLoop]: 2254 mSDtfsCounter, 2166 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 2323 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:52:29,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 2323 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:29,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2024-11-10 00:52:29,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1479. [2024-11-10 00:52:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1477 states have (on average 2.1415030467163167) internal successors, (3163), 1478 states have internal predecessors, (3163), 0 states have call successors, (0), 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:52:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3163 transitions. [2024-11-10 00:52:29,071 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3163 transitions. Word has length 50 [2024-11-10 00:52:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:29,071 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 3163 transitions. [2024-11-10 00:52:29,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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:52:29,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3163 transitions. [2024-11-10 00:52:29,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:29,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:29,072 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] [2024-11-10 00:52:29,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:52:29,072 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:29,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:29,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2071874447, now seen corresponding path program 1 times [2024-11-10 00:52:29,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:29,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822106512] [2024-11-10 00:52:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:29,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:29,115 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:52:29,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:29,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822106512] [2024-11-10 00:52:29,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822106512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:29,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:29,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:29,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337386818] [2024-11-10 00:52:29,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:29,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:29,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:29,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:29,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:29,117 INFO L87 Difference]: Start difference. First operand 1479 states and 3163 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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:52:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:29,244 INFO L93 Difference]: Finished difference Result 2765 states and 5015 transitions. [2024-11-10 00:52:29,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:29,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-10 00:52:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:29,250 INFO L225 Difference]: With dead ends: 2765 [2024-11-10 00:52:29,250 INFO L226 Difference]: Without dead ends: 2074 [2024-11-10 00:52:29,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:29,252 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 2164 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2164 SdHoareTripleChecker+Valid, 2325 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:52:29,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2164 Valid, 2325 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:29,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2024-11-10 00:52:29,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2071. [2024-11-10 00:52:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 2069 states have (on average 1.9231512808119864) internal successors, (3979), 2070 states have internal predecessors, (3979), 0 states have call successors, (0), 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:52:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 3979 transitions. [2024-11-10 00:52:29,296 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 3979 transitions. Word has length 50 [2024-11-10 00:52:29,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:29,297 INFO L471 AbstractCegarLoop]: Abstraction has 2071 states and 3979 transitions. [2024-11-10 00:52:29,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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:52:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 3979 transitions. [2024-11-10 00:52:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:29,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:29,298 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] [2024-11-10 00:52:29,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:52:29,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:29,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:29,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1698815794, now seen corresponding path program 1 times [2024-11-10 00:52:29,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:29,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792817827] [2024-11-10 00:52:29,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:29,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:29,461 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:52:29,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:29,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792817827] [2024-11-10 00:52:29,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792817827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:29,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:29,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:52:29,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428080794] [2024-11-10 00:52:29,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:29,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:52:29,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:29,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:52:29,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:52:29,464 INFO L87 Difference]: Start difference. First operand 2071 states and 3979 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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:52:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:29,523 INFO L93 Difference]: Finished difference Result 2170 states and 4109 transitions. [2024-11-10 00:52:29,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:52:29,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-10 00:52:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:29,530 INFO L225 Difference]: With dead ends: 2170 [2024-11-10 00:52:29,530 INFO L226 Difference]: Without dead ends: 2167 [2024-11-10 00:52:29,531 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:52:29,531 INFO L432 NwaCegarLoop]: 2207 mSDtfsCounter, 0 mSDsluCounter, 6612 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8819 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:29,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8819 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2024-11-10 00:52:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 2167. [2024-11-10 00:52:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 2165 states have (on average 1.8785219399538107) internal successors, (4067), 2166 states have internal predecessors, (4067), 0 states have call successors, (0), 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:52:29,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 4067 transitions. [2024-11-10 00:52:29,575 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 4067 transitions. Word has length 50 [2024-11-10 00:52:29,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:29,575 INFO L471 AbstractCegarLoop]: Abstraction has 2167 states and 4067 transitions. [2024-11-10 00:52:29,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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:52:29,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 4067 transitions. [2024-11-10 00:52:29,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 00:52:29,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:29,576 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] [2024-11-10 00:52:29,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:52:29,576 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:29,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:29,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2030651655, now seen corresponding path program 1 times [2024-11-10 00:52:29,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:29,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964012100] [2024-11-10 00:52:29,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:29,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:29,624 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:52:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964012100] [2024-11-10 00:52:29,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964012100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:29,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:29,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:52:29,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853828036] [2024-11-10 00:52:29,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:29,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:29,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:29,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:29,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:29,627 INFO L87 Difference]: Start difference. First operand 2167 states and 4067 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 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:52:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:35,009 INFO L93 Difference]: Finished difference Result 3674 states and 8303 transitions. [2024-11-10 00:52:35,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:35,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-11-10 00:52:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:35,031 INFO L225 Difference]: With dead ends: 3674 [2024-11-10 00:52:35,031 INFO L226 Difference]: Without dead ends: 2919 [2024-11-10 00:52:35,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:52:35,033 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1536 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3637 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 4635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 3637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:35,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 170 Invalid, 4635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 3637 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-10 00:52:35,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2024-11-10 00:52:35,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2919. [2024-11-10 00:52:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2917 states have (on average 2.0990743914981147) internal successors, (6123), 2918 states have internal predecessors, (6123), 0 states have call successors, (0), 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:52:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 6123 transitions. [2024-11-10 00:52:35,088 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 6123 transitions. Word has length 50 [2024-11-10 00:52:35,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:35,089 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 6123 transitions. [2024-11-10 00:52:35,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 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:52:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 6123 transitions. [2024-11-10 00:52:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:35,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:35,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:35,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:52:35,090 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:35,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:35,091 INFO L85 PathProgramCache]: Analyzing trace with hash -26766179, now seen corresponding path program 1 times [2024-11-10 00:52:35,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:35,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281680679] [2024-11-10 00:52:35,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:35,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:52:35,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:35,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281680679] [2024-11-10 00:52:35,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281680679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:35,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:35,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:35,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508976487] [2024-11-10 00:52:35,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:35,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:35,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:35,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:35,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:35,205 INFO L87 Difference]: Start difference. First operand 2919 states and 6123 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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:52:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:35,354 INFO L93 Difference]: Finished difference Result 8366 states and 13669 transitions. [2024-11-10 00:52:35,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:35,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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 69 [2024-11-10 00:52:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:35,378 INFO L225 Difference]: With dead ends: 8366 [2024-11-10 00:52:35,381 INFO L226 Difference]: Without dead ends: 7371 [2024-11-10 00:52:35,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:35,384 INFO L432 NwaCegarLoop]: 2265 mSDtfsCounter, 6705 mSDsluCounter, 2518 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6705 SdHoareTripleChecker+Valid, 4783 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:35,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6705 Valid, 4783 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:35,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7371 states. [2024-11-10 00:52:35,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7371 to 4111. [2024-11-10 00:52:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4111 states, 4109 states have (on average 1.8873205159406181) internal successors, (7755), 4110 states have internal predecessors, (7755), 0 states have call successors, (0), 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:52:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 7755 transitions. [2024-11-10 00:52:35,467 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 7755 transitions. Word has length 69 [2024-11-10 00:52:35,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:35,467 INFO L471 AbstractCegarLoop]: Abstraction has 4111 states and 7755 transitions. [2024-11-10 00:52:35,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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:52:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 7755 transitions. [2024-11-10 00:52:35,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:35,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:35,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:35,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:52:35,469 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:35,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:35,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1028175907, now seen corresponding path program 1 times [2024-11-10 00:52:35,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:35,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027906024] [2024-11-10 00:52:35,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:35,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:52:35,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:35,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027906024] [2024-11-10 00:52:35,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027906024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:35,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:35,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:35,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892139533] [2024-11-10 00:52:35,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:35,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:35,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:35,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:35,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:35,589 INFO L87 Difference]: Start difference. First operand 4111 states and 7755 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:35,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:35,750 INFO L93 Difference]: Finished difference Result 9742 states and 15565 transitions. [2024-11-10 00:52:35,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:35,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:52:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:35,777 INFO L225 Difference]: With dead ends: 9742 [2024-11-10 00:52:35,778 INFO L226 Difference]: Without dead ends: 8363 [2024-11-10 00:52:35,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:35,787 INFO L432 NwaCegarLoop]: 2266 mSDtfsCounter, 6709 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6709 SdHoareTripleChecker+Valid, 4740 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:35,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6709 Valid, 4740 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:35,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8363 states. [2024-11-10 00:52:36,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8363 to 5983. [2024-11-10 00:52:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5983 states, 5981 states have (on average 1.7246279886306637) internal successors, (10315), 5982 states have internal predecessors, (10315), 0 states have call successors, (0), 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:52:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 10315 transitions. [2024-11-10 00:52:36,251 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 10315 transitions. Word has length 69 [2024-11-10 00:52:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:36,251 INFO L471 AbstractCegarLoop]: Abstraction has 5983 states and 10315 transitions. [2024-11-10 00:52:36,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:52:36,252 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 10315 transitions. [2024-11-10 00:52:36,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:36,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:36,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:36,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:52:36,254 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:36,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:36,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1042625763, now seen corresponding path program 1 times [2024-11-10 00:52:36,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:36,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778561375] [2024-11-10 00:52:36,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:36,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:52:36,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:36,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778561375] [2024-11-10 00:52:36,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778561375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:36,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:36,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:36,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203273867] [2024-11-10 00:52:36,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:36,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:36,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:36,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:36,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:36,439 INFO L87 Difference]: Start difference. First operand 5983 states and 10315 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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:52:36,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:36,682 INFO L93 Difference]: Finished difference Result 11118 states and 17453 transitions. [2024-11-10 00:52:36,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:36,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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 69 [2024-11-10 00:52:36,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:36,702 INFO L225 Difference]: With dead ends: 11118 [2024-11-10 00:52:36,702 INFO L226 Difference]: Without dead ends: 9739 [2024-11-10 00:52:36,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:36,713 INFO L432 NwaCegarLoop]: 2263 mSDtfsCounter, 6733 mSDsluCounter, 2461 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6733 SdHoareTripleChecker+Valid, 4724 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:36,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6733 Valid, 4724 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:36,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2024-11-10 00:52:36,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 7359. [2024-11-10 00:52:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7359 states, 7357 states have (on average 1.6586924017942095) internal successors, (12203), 7358 states have internal predecessors, (12203), 0 states have call successors, (0), 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:52:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7359 states to 7359 states and 12203 transitions. [2024-11-10 00:52:36,919 INFO L78 Accepts]: Start accepts. Automaton has 7359 states and 12203 transitions. Word has length 69 [2024-11-10 00:52:36,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:36,919 INFO L471 AbstractCegarLoop]: Abstraction has 7359 states and 12203 transitions. [2024-11-10 00:52:36,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 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:52:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 7359 states and 12203 transitions. [2024-11-10 00:52:36,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:52:36,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:36,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:36,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:52:36,921 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:36,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:36,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1048976989, now seen corresponding path program 1 times [2024-11-10 00:52:36,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:36,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142821513] [2024-11-10 00:52:36,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:36,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:52:37,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:37,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142821513] [2024-11-10 00:52:37,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142821513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:37,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:37,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 00:52:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384913979] [2024-11-10 00:52:37,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:37,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:52:37,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:37,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:52:37,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:52:37,034 INFO L87 Difference]: Start difference. First operand 7359 states and 12203 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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:52:37,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:37,261 INFO L93 Difference]: Finished difference Result 12494 states and 19341 transitions. [2024-11-10 00:52:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 00:52:37,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 69 [2024-11-10 00:52:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:37,280 INFO L225 Difference]: With dead ends: 12494 [2024-11-10 00:52:37,280 INFO L226 Difference]: Without dead ends: 11115 [2024-11-10 00:52:37,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:52:37,288 INFO L432 NwaCegarLoop]: 2264 mSDtfsCounter, 6723 mSDsluCounter, 2489 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6723 SdHoareTripleChecker+Valid, 4753 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:37,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6723 Valid, 4753 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:52:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11115 states. [2024-11-10 00:52:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11115 to 8735. [2024-11-10 00:52:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8735 states, 8733 states have (on average 1.6135348677430437) internal successors, (14091), 8734 states have internal predecessors, (14091), 0 states have call successors, (0), 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:52:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8735 states to 8735 states and 14091 transitions. [2024-11-10 00:52:37,531 INFO L78 Accepts]: Start accepts. Automaton has 8735 states and 14091 transitions. Word has length 69 [2024-11-10 00:52:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:37,532 INFO L471 AbstractCegarLoop]: Abstraction has 8735 states and 14091 transitions. [2024-11-10 00:52:37,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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:52:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 8735 states and 14091 transitions. [2024-11-10 00:52:37,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:52:37,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:37,533 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:37,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:52:37,534 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:37,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:37,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1958100993, now seen corresponding path program 1 times [2024-11-10 00:52:37,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:37,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303086125] [2024-11-10 00:52:37,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:37,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:37,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:37,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303086125] [2024-11-10 00:52:37,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303086125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:37,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:37,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:37,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230865740] [2024-11-10 00:52:37,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:37,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:37,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:37,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:37,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:37,644 INFO L87 Difference]: Start difference. First operand 8735 states and 14091 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:52:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:37,829 INFO L93 Difference]: Finished difference Result 15933 states and 23975 transitions. [2024-11-10 00:52:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:37,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:52:37,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:37,867 INFO L225 Difference]: With dead ends: 15933 [2024-11-10 00:52:37,867 INFO L226 Difference]: Without dead ends: 8738 [2024-11-10 00:52:37,898 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:52:37,901 INFO L432 NwaCegarLoop]: 2238 mSDtfsCounter, 36 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4436 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:52:37,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4436 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8738 states. [2024-11-10 00:52:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8738 to 8735. [2024-11-10 00:52:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8735 states, 8733 states have (on average 1.5993358525134547) internal successors, (13967), 8734 states have internal predecessors, (13967), 0 states have call successors, (0), 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:52:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8735 states to 8735 states and 13967 transitions. [2024-11-10 00:52:38,048 INFO L78 Accepts]: Start accepts. Automaton has 8735 states and 13967 transitions. Word has length 71 [2024-11-10 00:52:38,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:38,049 INFO L471 AbstractCegarLoop]: Abstraction has 8735 states and 13967 transitions. [2024-11-10 00:52:38,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:52:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 8735 states and 13967 transitions. [2024-11-10 00:52:38,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:52:38,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:38,050 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:38,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:52:38,051 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:38,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:38,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2054791999, now seen corresponding path program 1 times [2024-11-10 00:52:38,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:38,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699742375] [2024-11-10 00:52:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:38,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:38,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:38,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:38,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699742375] [2024-11-10 00:52:38,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699742375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:38,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:38,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:38,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606427051] [2024-11-10 00:52:38,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:38,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:38,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:38,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:38,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:38,127 INFO L87 Difference]: Start difference. First operand 8735 states and 13967 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:52:38,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:38,193 INFO L93 Difference]: Finished difference Result 11488 states and 17731 transitions. [2024-11-10 00:52:38,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:38,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-10 00:52:38,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:38,204 INFO L225 Difference]: With dead ends: 11488 [2024-11-10 00:52:38,205 INFO L226 Difference]: Without dead ends: 4293 [2024-11-10 00:52:38,211 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:52:38,211 INFO L432 NwaCegarLoop]: 2236 mSDtfsCounter, 32 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4433 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:52:38,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4433 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:38,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2024-11-10 00:52:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 4283. [2024-11-10 00:52:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4283 states, 4281 states have (on average 1.8498014482597525) internal successors, (7919), 4282 states have internal predecessors, (7919), 0 states have call successors, (0), 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:52:38,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 7919 transitions. [2024-11-10 00:52:38,274 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 7919 transitions. Word has length 71 [2024-11-10 00:52:38,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:38,275 INFO L471 AbstractCegarLoop]: Abstraction has 4283 states and 7919 transitions. [2024-11-10 00:52:38,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:52:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 7919 transitions. [2024-11-10 00:52:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:52:38,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:38,276 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:38,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:52:38,276 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:38,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:38,277 INFO L85 PathProgramCache]: Analyzing trace with hash 798912897, now seen corresponding path program 1 times [2024-11-10 00:52:38,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:38,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361342216] [2024-11-10 00:52:38,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:38,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:38,352 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:52:38,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:38,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361342216] [2024-11-10 00:52:38,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361342216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:38,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:38,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:38,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112676356] [2024-11-10 00:52:38,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:38,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:38,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:38,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:38,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:38,355 INFO L87 Difference]: Start difference. First operand 4283 states and 7919 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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:52:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:38,386 INFO L93 Difference]: Finished difference Result 5653 states and 9771 transitions. [2024-11-10 00:52:38,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:38,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-11-10 00:52:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:38,391 INFO L225 Difference]: With dead ends: 5653 [2024-11-10 00:52:38,392 INFO L226 Difference]: Without dead ends: 2922 [2024-11-10 00:52:38,394 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:52:38,394 INFO L432 NwaCegarLoop]: 2230 mSDtfsCounter, 30 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4412 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:52:38,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4412 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:38,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2024-11-10 00:52:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2919. [2024-11-10 00:52:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2917 states have (on average 2.0737058621871785) internal successors, (6049), 2918 states have internal predecessors, (6049), 0 states have call successors, (0), 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:52:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 6049 transitions. [2024-11-10 00:52:38,432 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 6049 transitions. Word has length 73 [2024-11-10 00:52:38,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:38,432 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 6049 transitions. [2024-11-10 00:52:38,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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:52:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 6049 transitions. [2024-11-10 00:52:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 00:52:38,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:38,434 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:38,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:52:38,434 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:38,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:38,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1102118600, now seen corresponding path program 1 times [2024-11-10 00:52:38,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:38,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025135675] [2024-11-10 00:52:38,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:38,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:38,515 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:52:38,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:38,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025135675] [2024-11-10 00:52:38,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025135675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:52:38,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:52:38,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:52:38,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277957473] [2024-11-10 00:52:38,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:52:38,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:52:38,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:38,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:52:38,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:52:38,517 INFO L87 Difference]: Start difference. First operand 2919 states and 6049 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:52:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:38,549 INFO L93 Difference]: Finished difference Result 3607 states and 6966 transitions. [2024-11-10 00:52:38,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:52:38,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-11-10 00:52:38,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:38,554 INFO L225 Difference]: With dead ends: 3607 [2024-11-10 00:52:38,554 INFO L226 Difference]: Without dead ends: 2240 [2024-11-10 00:52:38,555 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:52:38,556 INFO L432 NwaCegarLoop]: 2223 mSDtfsCounter, 27 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4397 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:52:38,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4397 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:52:38,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2024-11-10 00:52:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2237. [2024-11-10 00:52:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 2235 states have (on average 2.2930648769574944) internal successors, (5125), 2236 states have internal predecessors, (5125), 0 states have call successors, (0), 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:52:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 5125 transitions. [2024-11-10 00:52:38,594 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 5125 transitions. Word has length 75 [2024-11-10 00:52:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:38,594 INFO L471 AbstractCegarLoop]: Abstraction has 2237 states and 5125 transitions. [2024-11-10 00:52:38,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:52:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 5125 transitions. [2024-11-10 00:52:38,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 00:52:38,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:38,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:38,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:52:38,601 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:38,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:38,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1394283217, now seen corresponding path program 1 times [2024-11-10 00:52:38,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:38,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521586911] [2024-11-10 00:52:38,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:38,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:38,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:38,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521586911] [2024-11-10 00:52:38,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521586911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:38,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77507999] [2024-11-10 00:52:38,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:38,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:38,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:38,955 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:52:38,961 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:52:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:39,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 00:52:39,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:40,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:52:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:42,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77507999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:52:42,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:52:42,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 33 [2024-11-10 00:52:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348707007] [2024-11-10 00:52:42,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:52:42,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-10 00:52:42,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:42,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-10 00:52:42,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 00:52:42,594 INFO L87 Difference]: Start difference. First operand 2237 states and 5125 transitions. Second operand has 33 states, 33 states have (on average 6.393939393939394) internal successors, (211), 33 states have internal predecessors, (211), 0 states have call successors, (0), 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:52:46,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:46,371 INFO L93 Difference]: Finished difference Result 5844 states and 9882 transitions. [2024-11-10 00:52:46,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-10 00:52:46,372 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.393939393939394) internal successors, (211), 33 states have internal predecessors, (211), 0 states have call successors, (0), 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 77 [2024-11-10 00:52:46,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:46,385 INFO L225 Difference]: With dead ends: 5844 [2024-11-10 00:52:46,386 INFO L226 Difference]: Without dead ends: 5159 [2024-11-10 00:52:46,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1482, Invalid=6000, Unknown=0, NotChecked=0, Total=7482 [2024-11-10 00:52:46,390 INFO L432 NwaCegarLoop]: 2177 mSDtfsCounter, 30726 mSDsluCounter, 15653 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30726 SdHoareTripleChecker+Valid, 17830 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:46,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30726 Valid, 17830 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:52:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5159 states. [2024-11-10 00:52:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5159 to 5124. [2024-11-10 00:52:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5124 states, 5122 states have (on average 1.7295978133541585) internal successors, (8859), 5123 states have internal predecessors, (8859), 0 states have call successors, (0), 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:52:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 8859 transitions. [2024-11-10 00:52:46,482 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 8859 transitions. Word has length 77 [2024-11-10 00:52:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:46,482 INFO L471 AbstractCegarLoop]: Abstraction has 5124 states and 8859 transitions. [2024-11-10 00:52:46,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.393939393939394) internal successors, (211), 33 states have internal predecessors, (211), 0 states have call successors, (0), 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:52:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 8859 transitions. [2024-11-10 00:52:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 00:52:46,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:46,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:46,496 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:52:46,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:46,688 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:46,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:46,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1476797615, now seen corresponding path program 1 times [2024-11-10 00:52:46,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:46,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639854925] [2024-11-10 00:52:46,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:46,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:46,949 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:52:46,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:46,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639854925] [2024-11-10 00:52:46,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639854925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:46,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633663425] [2024-11-10 00:52:46,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:46,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:46,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:46,951 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:52:46,952 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:52:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:47,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:52:47,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:47,373 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:52:47,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:52:47,935 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:52:47,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633663425] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:52:47,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:52:47,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-11-10 00:52:47,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284141777] [2024-11-10 00:52:47,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:52:47,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 00:52:47,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:47,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 00:52:47,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2024-11-10 00:52:47,938 INFO L87 Difference]: Start difference. First operand 5124 states and 8859 transitions. Second operand has 26 states, 26 states have (on average 7.346153846153846) internal successors, (191), 25 states have internal predecessors, (191), 0 states have call successors, (0), 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:52:49,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:52:49,296 INFO L93 Difference]: Finished difference Result 20081 states and 28407 transitions. [2024-11-10 00:52:49,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-10 00:52:49,297 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.346153846153846) internal successors, (191), 25 states have internal predecessors, (191), 0 states have call successors, (0), 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 77 [2024-11-10 00:52:49,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:52:49,318 INFO L225 Difference]: With dead ends: 20081 [2024-11-10 00:52:49,319 INFO L226 Difference]: Without dead ends: 16509 [2024-11-10 00:52:49,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=629, Invalid=2341, Unknown=0, NotChecked=0, Total=2970 [2024-11-10 00:52:49,326 INFO L432 NwaCegarLoop]: 2201 mSDtfsCounter, 26564 mSDsluCounter, 11481 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26564 SdHoareTripleChecker+Valid, 13682 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:52:49,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26564 Valid, 13682 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:52:49,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16509 states. [2024-11-10 00:52:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16509 to 16271. [2024-11-10 00:52:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16271 states, 16269 states have (on average 1.4129325711475813) internal successors, (22987), 16270 states have internal predecessors, (22987), 0 states have call successors, (0), 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:52:49,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16271 states to 16271 states and 22987 transitions. [2024-11-10 00:52:49,639 INFO L78 Accepts]: Start accepts. Automaton has 16271 states and 22987 transitions. Word has length 77 [2024-11-10 00:52:49,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:52:49,639 INFO L471 AbstractCegarLoop]: Abstraction has 16271 states and 22987 transitions. [2024-11-10 00:52:49,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.346153846153846) internal successors, (191), 25 states have internal predecessors, (191), 0 states have call successors, (0), 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:52:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 16271 states and 22987 transitions. [2024-11-10 00:52:49,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:52:49,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:52:49,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:52:49,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:52:49,845 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,SelfDestructingSolverStorable20 [2024-11-10 00:52:49,846 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:52:49,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:52:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash -114225462, now seen corresponding path program 1 times [2024-11-10 00:52:49,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:52:49,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622550410] [2024-11-10 00:52:49,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:49,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:52:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:51,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:52:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622550410] [2024-11-10 00:52:51,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622550410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:52:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108548381] [2024-11-10 00:52:51,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:52:51,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:52:51,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:52:51,980 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:52:51,981 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:52:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:52:52,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-10 00:52:52,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:52:55,872 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:52:55,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:52:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:52:59,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108548381] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:52:59,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:52:59,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 20] total 62 [2024-11-10 00:52:59,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157364573] [2024-11-10 00:52:59,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:52:59,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-10 00:52:59,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:52:59,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-10 00:52:59,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=3457, Unknown=0, NotChecked=0, Total=3782 [2024-11-10 00:52:59,807 INFO L87 Difference]: Start difference. First operand 16271 states and 22987 transitions. Second operand has 62 states, 62 states have (on average 3.5) internal successors, (217), 62 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)