./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.09.cil-1.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 d46cc80a8d21eeff79ba02488456fda09c76eb75ff8eedd6b93124365a06d1f9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 23:30:01,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 23:30:01,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 23:30:01,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 23:30:01,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 23:30:01,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 23:30:01,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 23:30:01,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 23:30:01,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 23:30:01,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 23:30:01,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 23:30:01,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 23:30:01,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 23:30:01,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 23:30:01,811 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 23:30:01,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 23:30:01,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 23:30:01,812 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 23:30:01,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 23:30:01,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 23:30:01,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 23:30:01,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 23:30:01,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 23:30:01,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 23:30:01,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 23:30:01,815 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 23:30:01,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 23:30:01,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 23:30:01,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 23:30:01,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 23:30:01,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 23:30:01,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 23:30:01,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:30:01,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 23:30:01,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 23:30:01,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 23:30:01,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 23:30:01,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 23:30:01,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 23:30:01,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 23:30:01,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 23:30:01,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 23:30:01,820 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 -> d46cc80a8d21eeff79ba02488456fda09c76eb75ff8eedd6b93124365a06d1f9 [2024-11-19 23:30:02,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 23:30:02,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 23:30:02,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 23:30:02,111 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 23:30:02,111 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 23:30:02,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.09.cil-1.c [2024-11-19 23:30:03,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 23:30:04,154 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 23:30:04,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.09.cil-1.c [2024-11-19 23:30:04,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80f1a42af/0a02598e55a14e008f0b87b66a4dd13c/FLAG8174214ee [2024-11-19 23:30:04,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80f1a42af/0a02598e55a14e008f0b87b66a4dd13c [2024-11-19 23:30:04,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 23:30:04,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 23:30:04,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 23:30:04,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 23:30:04,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 23:30:04,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:30:04" (1/1) ... [2024-11-19 23:30:04,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@591f88cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:04, skipping insertion in model container [2024-11-19 23:30:04,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:30:04" (1/1) ... [2024-11-19 23:30:04,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 23:30:06,340 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/Problem05_label47+token_ring.09.cil-1.c[377612,377625] [2024-11-19 23:30:06,368 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/Problem05_label47+token_ring.09.cil-1.c[383339,383352] [2024-11-19 23:30:06,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:30:06,564 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 23:30:07,363 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/Problem05_label47+token_ring.09.cil-1.c[377612,377625] [2024-11-19 23:30:07,377 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/Problem05_label47+token_ring.09.cil-1.c[383339,383352] [2024-11-19 23:30:07,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:30:07,469 INFO L204 MainTranslator]: Completed translation [2024-11-19 23:30:07,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:07 WrapperNode [2024-11-19 23:30:07,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 23:30:07,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 23:30:07,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 23:30:07,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 23:30:07,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:07" (1/1) ... [2024-11-19 23:30:07,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:07" (1/1) ... [2024-11-19 23:30:08,046 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13053 [2024-11-19 23:30:08,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 23:30:08,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 23:30:08,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 23:30:08,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 23:30:08,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:07" (1/1) ... [2024-11-19 23:30:08,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:07" (1/1) ... [2024-11-19 23:30:08,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:07" (1/1) ... [2024-11-19 23:30:08,264 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-19 23:30:08,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:07" (1/1) ... [2024-11-19 23:30:08,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:07" (1/1) ... [2024-11-19 23:30:08,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:07" (1/1) ... [2024-11-19 23:30:08,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:07" (1/1) ... [2024-11-19 23:30:08,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:07" (1/1) ... [2024-11-19 23:30:08,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:07" (1/1) ... [2024-11-19 23:30:08,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 23:30:08,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 23:30:08,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 23:30:08,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 23:30:08,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:07" (1/1) ... [2024-11-19 23:30:08,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:30:08,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 23:30:08,718 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-19 23:30:08,721 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-19 23:30:08,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 23:30:08,761 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-19 23:30:08,761 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-19 23:30:08,761 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-19 23:30:08,762 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-19 23:30:08,762 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-19 23:30:08,762 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-19 23:30:08,762 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-19 23:30:08,762 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-19 23:30:08,762 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-19 23:30:08,762 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-19 23:30:08,762 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-19 23:30:08,762 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-19 23:30:08,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 23:30:08,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 23:30:08,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 23:30:08,886 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 23:30:08,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 23:30:16,507 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2024-11-19 23:30:16,507 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 23:30:16,567 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 23:30:16,568 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-19 23:30:16,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:30:16 BoogieIcfgContainer [2024-11-19 23:30:16,568 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 23:30:16,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 23:30:16,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 23:30:16,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 23:30:16,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:30:04" (1/3) ... [2024-11-19 23:30:16,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a53e647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:30:16, skipping insertion in model container [2024-11-19 23:30:16,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:30:07" (2/3) ... [2024-11-19 23:30:16,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a53e647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:30:16, skipping insertion in model container [2024-11-19 23:30:16,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:30:16" (3/3) ... [2024-11-19 23:30:16,579 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.09.cil-1.c [2024-11-19 23:30:16,594 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 23:30:16,595 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 23:30:16,763 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 23:30:16,771 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;@3352fd6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 23:30:16,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 23:30:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 2500 states, 2468 states have (on average 1.8435980551053484) internal successors, (4550), 2471 states have internal predecessors, (4550), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 23:30:16,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:30:16,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:30:16,805 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:30:16,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:30:16,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:30:16,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2141989661, now seen corresponding path program 1 times [2024-11-19 23:30:16,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:30:16,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940543184] [2024-11-19 23:30:16,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:30:16,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:30:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:17,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:30:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:17,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:30:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:17,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:30:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:17,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:30:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:17,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:30:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:17,412 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-19 23:30:17,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:30:17,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940543184] [2024-11-19 23:30:17,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940543184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:30:17,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:30:17,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 23:30:17,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108985044] [2024-11-19 23:30:17,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:30:17,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 23:30:17,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:30:17,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 23:30:17,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 23:30:17,457 INFO L87 Difference]: Start difference. First operand has 2500 states, 2468 states have (on average 1.8435980551053484) internal successors, (4550), 2471 states have internal predecessors, (4550), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:18,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:30:18,971 INFO L93 Difference]: Finished difference Result 5101 states and 9365 transitions. [2024-11-19 23:30:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 23:30:18,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2024-11-19 23:30:18,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:30:18,999 INFO L225 Difference]: With dead ends: 5101 [2024-11-19 23:30:18,999 INFO L226 Difference]: Without dead ends: 2542 [2024-11-19 23:30:19,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 23:30:19,015 INFO L432 NwaCegarLoop]: 4314 mSDtfsCounter, 821 mSDsluCounter, 12407 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 16721 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 23:30:19,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 16721 Invalid, 855 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 23:30:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2024-11-19 23:30:19,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2433. [2024-11-19 23:30:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2433 states, 2402 states have (on average 1.8288925895087427) internal successors, (4393), 2404 states have internal predecessors, (4393), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 23:30:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 4439 transitions. [2024-11-19 23:30:19,156 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 4439 transitions. Word has length 145 [2024-11-19 23:30:19,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:30:19,157 INFO L471 AbstractCegarLoop]: Abstraction has 2433 states and 4439 transitions. [2024-11-19 23:30:19,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 4439 transitions. [2024-11-19 23:30:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:30:19,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:30:19,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:30:19,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 23:30:19,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:30:19,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:30:19,164 INFO L85 PathProgramCache]: Analyzing trace with hash -535537185, now seen corresponding path program 1 times [2024-11-19 23:30:19,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:30:19,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748118803] [2024-11-19 23:30:19,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:30:19,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:30:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:19,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:30:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:19,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:30:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:19,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:30:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:19,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:30:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:19,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:30:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:19,532 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-19 23:30:19,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:30:19,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748118803] [2024-11-19 23:30:19,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748118803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:30:19,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:30:19,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 23:30:19,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394126853] [2024-11-19 23:30:19,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:30:19,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 23:30:19,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:30:19,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 23:30:19,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 23:30:19,538 INFO L87 Difference]: Start difference. First operand 2433 states and 4439 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:21,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:30:21,993 INFO L93 Difference]: Finished difference Result 3253 states and 5746 transitions. [2024-11-19 23:30:21,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 23:30:21,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2024-11-19 23:30:21,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:30:22,007 INFO L225 Difference]: With dead ends: 3253 [2024-11-19 23:30:22,008 INFO L226 Difference]: Without dead ends: 2958 [2024-11-19 23:30:22,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-19 23:30:22,012 INFO L432 NwaCegarLoop]: 4221 mSDtfsCounter, 5183 mSDsluCounter, 12669 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5199 SdHoareTripleChecker+Valid, 16890 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 23:30:22,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5199 Valid, 16890 Invalid, 1857 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [96 Valid, 1761 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 23:30:22,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2024-11-19 23:30:22,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2741. [2024-11-19 23:30:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2741 states, 2685 states have (on average 1.8011173184357543) internal successors, (4836), 2688 states have internal predecessors, (4836), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-11-19 23:30:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4921 transitions. [2024-11-19 23:30:22,112 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4921 transitions. Word has length 145 [2024-11-19 23:30:22,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:30:22,113 INFO L471 AbstractCegarLoop]: Abstraction has 2741 states and 4921 transitions. [2024-11-19 23:30:22,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4921 transitions. [2024-11-19 23:30:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:30:22,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:30:22,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:30:22,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 23:30:22,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:30:22,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:30:22,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1207466339, now seen corresponding path program 1 times [2024-11-19 23:30:22,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:30:22,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416516079] [2024-11-19 23:30:22,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:30:22,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:30:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:22,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:30:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:22,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:30:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:22,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:30:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:22,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:30:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:22,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:30:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:22,416 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-19 23:30:22,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:30:22,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416516079] [2024-11-19 23:30:22,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416516079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:30:22,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:30:22,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:30:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786092746] [2024-11-19 23:30:22,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:30:22,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:30:22,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:30:22,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:30:22,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:30:22,419 INFO L87 Difference]: Start difference. First operand 2741 states and 4921 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:25,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:30:25,773 INFO L93 Difference]: Finished difference Result 3991 states and 6913 transitions. [2024-11-19 23:30:25,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:30:25,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2024-11-19 23:30:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:30:25,791 INFO L225 Difference]: With dead ends: 3991 [2024-11-19 23:30:25,791 INFO L226 Difference]: Without dead ends: 3388 [2024-11-19 23:30:25,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:30:25,796 INFO L432 NwaCegarLoop]: 4421 mSDtfsCounter, 5214 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2794 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5230 SdHoareTripleChecker+Valid, 21831 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 23:30:25,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5230 Valid, 21831 Invalid, 2849 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 2794 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 23:30:25,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2024-11-19 23:30:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3028. [2024-11-19 23:30:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 2947 states have (on average 1.7770614183915847) internal successors, (5237), 2951 states have internal predecessors, (5237), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-11-19 23:30:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 5360 transitions. [2024-11-19 23:30:25,938 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 5360 transitions. Word has length 145 [2024-11-19 23:30:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:30:25,939 INFO L471 AbstractCegarLoop]: Abstraction has 3028 states and 5360 transitions. [2024-11-19 23:30:25,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 5360 transitions. [2024-11-19 23:30:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:30:25,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:30:25,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:30:25,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 23:30:25,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:30:25,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:30:25,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2140463071, now seen corresponding path program 1 times [2024-11-19 23:30:25,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:30:25,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769560165] [2024-11-19 23:30:25,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:30:25,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:30:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:26,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:30:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:26,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:30:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:30:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:26,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:30:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:26,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:30:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:30:26,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:30:26,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769560165] [2024-11-19 23:30:26,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769560165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:30:26,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:30:26,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:30:26,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124500653] [2024-11-19 23:30:26,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:30:26,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:30:26,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:30:26,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:30:26,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:30:26,279 INFO L87 Difference]: Start difference. First operand 3028 states and 5360 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:29,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:30:29,148 INFO L93 Difference]: Finished difference Result 5078 states and 8620 transitions. [2024-11-19 23:30:29,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:30:29,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2024-11-19 23:30:29,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:30:29,166 INFO L225 Difference]: With dead ends: 5078 [2024-11-19 23:30:29,167 INFO L226 Difference]: Without dead ends: 4188 [2024-11-19 23:30:29,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:30:29,171 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5208 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2773 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5224 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 23:30:29,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5224 Valid, 21829 Invalid, 2830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2773 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 23:30:29,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2024-11-19 23:30:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 3606. [2024-11-19 23:30:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3606 states, 3475 states have (on average 1.7398561151079137) internal successors, (6046), 3481 states have internal predecessors, (6046), 95 states have call successors, (95), 30 states have call predecessors, (95), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-11-19 23:30:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 6249 transitions. [2024-11-19 23:30:29,300 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 6249 transitions. Word has length 145 [2024-11-19 23:30:29,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:30:29,301 INFO L471 AbstractCegarLoop]: Abstraction has 3606 states and 6249 transitions. [2024-11-19 23:30:29,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 6249 transitions. [2024-11-19 23:30:29,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:30:29,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:30:29,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:30:29,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 23:30:29,306 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:30:29,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:30:29,307 INFO L85 PathProgramCache]: Analyzing trace with hash 104095327, now seen corresponding path program 1 times [2024-11-19 23:30:29,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:30:29,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730499221] [2024-11-19 23:30:29,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:30:29,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:30:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:29,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:30:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:29,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:30:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:29,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:30:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:29,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:30:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:29,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:30:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:29,593 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-19 23:30:29,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:30:29,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730499221] [2024-11-19 23:30:29,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730499221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:30:29,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:30:29,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:30:29,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304840875] [2024-11-19 23:30:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:30:29,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:30:29,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:30:29,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:30:29,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:30:29,600 INFO L87 Difference]: Start difference. First operand 3606 states and 6249 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:30:32,162 INFO L93 Difference]: Finished difference Result 7178 states and 11897 transitions. [2024-11-19 23:30:32,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:30:32,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2024-11-19 23:30:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:30:32,188 INFO L225 Difference]: With dead ends: 7178 [2024-11-19 23:30:32,189 INFO L226 Difference]: Without dead ends: 5710 [2024-11-19 23:30:32,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:30:32,197 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5207 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2760 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 23:30:32,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 21829 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2760 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 23:30:32,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2024-11-19 23:30:32,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 4763. [2024-11-19 23:30:32,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4763 states, 4532 states have (on average 1.6910856134157104) internal successors, (7664), 4542 states have internal predecessors, (7664), 167 states have call successors, (167), 54 states have call predecessors, (167), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-11-19 23:30:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4763 states to 4763 states and 8033 transitions. [2024-11-19 23:30:32,401 INFO L78 Accepts]: Start accepts. Automaton has 4763 states and 8033 transitions. Word has length 145 [2024-11-19 23:30:32,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:30:32,402 INFO L471 AbstractCegarLoop]: Abstraction has 4763 states and 8033 transitions. [2024-11-19 23:30:32,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 4763 states and 8033 transitions. [2024-11-19 23:30:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:30:32,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:30:32,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:30:32,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 23:30:32,406 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:30:32,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:30:32,406 INFO L85 PathProgramCache]: Analyzing trace with hash 592142433, now seen corresponding path program 1 times [2024-11-19 23:30:32,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:30:32,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812964086] [2024-11-19 23:30:32,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:30:32,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:30:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:32,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:30:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:32,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:30:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:30:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:32,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:30:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:32,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:30:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:32,653 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-19 23:30:32,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:30:32,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812964086] [2024-11-19 23:30:32,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812964086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:30:32,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:30:32,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:30:32,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006429254] [2024-11-19 23:30:32,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:30:32,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:30:32,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:30:32,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:30:32,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:30:32,657 INFO L87 Difference]: Start difference. First operand 4763 states and 8033 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:30:35,498 INFO L93 Difference]: Finished difference Result 11377 states and 18467 transitions. [2024-11-19 23:30:35,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:30:35,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2024-11-19 23:30:35,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:30:35,553 INFO L225 Difference]: With dead ends: 11377 [2024-11-19 23:30:35,553 INFO L226 Difference]: Without dead ends: 8752 [2024-11-19 23:30:35,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:30:35,568 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5206 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5222 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 23:30:35,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5222 Valid, 21829 Invalid, 2804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 23:30:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8752 states. [2024-11-19 23:30:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8752 to 7084. [2024-11-19 23:30:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7084 states, 6653 states have (on average 1.6398617165188636) internal successors, (10910), 6671 states have internal predecessors, (10910), 311 states have call successors, (311), 102 states have call predecessors, (311), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-11-19 23:30:35,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7084 states to 7084 states and 11629 transitions. [2024-11-19 23:30:35,897 INFO L78 Accepts]: Start accepts. Automaton has 7084 states and 11629 transitions. Word has length 145 [2024-11-19 23:30:35,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:30:35,898 INFO L471 AbstractCegarLoop]: Abstraction has 7084 states and 11629 transitions. [2024-11-19 23:30:35,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand 7084 states and 11629 transitions. [2024-11-19 23:30:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:30:35,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:30:35,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:30:35,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 23:30:35,904 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:30:35,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:30:35,905 INFO L85 PathProgramCache]: Analyzing trace with hash -500492769, now seen corresponding path program 1 times [2024-11-19 23:30:35,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:30:35,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889045044] [2024-11-19 23:30:35,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:30:35,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:30:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:36,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:30:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:36,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:30:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:36,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:30:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:36,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:30:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:36,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:30:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:36,147 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-19 23:30:36,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:30:36,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889045044] [2024-11-19 23:30:36,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889045044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:30:36,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:30:36,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:30:36,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485812760] [2024-11-19 23:30:36,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:30:36,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:30:36,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:30:36,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:30:36,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:30:36,150 INFO L87 Difference]: Start difference. First operand 7084 states and 11629 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:38,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:30:38,968 INFO L93 Difference]: Finished difference Result 19776 states and 31669 transitions. [2024-11-19 23:30:38,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:30:38,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2024-11-19 23:30:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:30:39,030 INFO L225 Difference]: With dead ends: 19776 [2024-11-19 23:30:39,031 INFO L226 Difference]: Without dead ends: 14830 [2024-11-19 23:30:39,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:30:39,056 INFO L432 NwaCegarLoop]: 4231 mSDtfsCounter, 5285 mSDsluCounter, 16870 mSDsCounter, 0 mSdLazyCounter, 2341 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5301 SdHoareTripleChecker+Valid, 21101 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 23:30:39,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5301 Valid, 21101 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2341 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 23:30:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14830 states. [2024-11-19 23:30:39,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14830 to 11741. [2024-11-19 23:30:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11741 states, 10910 states have (on average 1.5970669110907425) internal successors, (17424), 10944 states have internal predecessors, (17424), 599 states have call successors, (599), 198 states have call predecessors, (599), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-19 23:30:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 18897 transitions. [2024-11-19 23:30:39,930 INFO L78 Accepts]: Start accepts. Automaton has 11741 states and 18897 transitions. Word has length 145 [2024-11-19 23:30:39,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:30:39,931 INFO L471 AbstractCegarLoop]: Abstraction has 11741 states and 18897 transitions. [2024-11-19 23:30:39,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:39,932 INFO L276 IsEmpty]: Start isEmpty. Operand 11741 states and 18897 transitions. [2024-11-19 23:30:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:30:39,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:30:39,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:30:39,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 23:30:39,943 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:30:39,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:30:39,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1782665055, now seen corresponding path program 1 times [2024-11-19 23:30:39,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:30:39,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630726854] [2024-11-19 23:30:39,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:30:39,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:30:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:40,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:30:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:40,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:30:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:40,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:30:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:40,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:30:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:40,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:30:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:40,239 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-19 23:30:40,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:30:40,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630726854] [2024-11-19 23:30:40,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630726854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:30:40,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:30:40,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:30:40,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246783483] [2024-11-19 23:30:40,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:30:40,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:30:40,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:30:40,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:30:40,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:30:40,246 INFO L87 Difference]: Start difference. First operand 11741 states and 18897 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:30:41,954 INFO L93 Difference]: Finished difference Result 24602 states and 39478 transitions. [2024-11-19 23:30:41,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 23:30:41,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2024-11-19 23:30:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:30:42,014 INFO L225 Difference]: With dead ends: 24602 [2024-11-19 23:30:42,014 INFO L226 Difference]: Without dead ends: 14999 [2024-11-19 23:30:42,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-19 23:30:42,050 INFO L432 NwaCegarLoop]: 4206 mSDtfsCounter, 4993 mSDsluCounter, 12488 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5010 SdHoareTripleChecker+Valid, 16694 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 23:30:42,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5010 Valid, 16694 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 23:30:42,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14999 states. [2024-11-19 23:30:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14999 to 11741. [2024-11-19 23:30:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11741 states, 10910 states have (on average 1.5940421631530706) internal successors, (17391), 10944 states have internal predecessors, (17391), 599 states have call successors, (599), 198 states have call predecessors, (599), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-19 23:30:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 18864 transitions. [2024-11-19 23:30:42,702 INFO L78 Accepts]: Start accepts. Automaton has 11741 states and 18864 transitions. Word has length 145 [2024-11-19 23:30:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:30:42,704 INFO L471 AbstractCegarLoop]: Abstraction has 11741 states and 18864 transitions. [2024-11-19 23:30:42,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 11741 states and 18864 transitions. [2024-11-19 23:30:42,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:30:42,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:30:42,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:30:42,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 23:30:42,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:30:42,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:30:42,716 INFO L85 PathProgramCache]: Analyzing trace with hash 669826527, now seen corresponding path program 1 times [2024-11-19 23:30:42,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:30:42,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137579196] [2024-11-19 23:30:42,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:30:42,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:30:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:42,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:30:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:30:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:42,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:30:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:42,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:30:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:42,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:30:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:42,949 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-19 23:30:42,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:30:42,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137579196] [2024-11-19 23:30:42,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137579196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:30:42,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:30:42,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:30:42,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23011109] [2024-11-19 23:30:42,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:30:42,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:30:42,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:30:42,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:30:42,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:30:42,951 INFO L87 Difference]: Start difference. First operand 11741 states and 18864 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:30:46,213 INFO L93 Difference]: Finished difference Result 36541 states and 58035 transitions. [2024-11-19 23:30:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:30:46,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2024-11-19 23:30:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:30:46,323 INFO L225 Difference]: With dead ends: 36541 [2024-11-19 23:30:46,323 INFO L226 Difference]: Without dead ends: 26938 [2024-11-19 23:30:46,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:30:46,367 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5197 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5213 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 23:30:46,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5213 Valid, 21829 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 23:30:46,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26938 states. [2024-11-19 23:30:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26938 to 21119. [2024-11-19 23:30:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21119 states, 19488 states have (on average 1.5633723316912973) internal successors, (30467), 19554 states have internal predecessors, (30467), 1175 states have call successors, (1175), 390 states have call predecessors, (1175), 454 states have return successors, (1968), 1238 states have call predecessors, (1968), 1175 states have call successors, (1968) [2024-11-19 23:30:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21119 states to 21119 states and 33610 transitions. [2024-11-19 23:30:47,566 INFO L78 Accepts]: Start accepts. Automaton has 21119 states and 33610 transitions. Word has length 145 [2024-11-19 23:30:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:30:47,567 INFO L471 AbstractCegarLoop]: Abstraction has 21119 states and 33610 transitions. [2024-11-19 23:30:47,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 21119 states and 33610 transitions. [2024-11-19 23:30:47,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:30:47,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:30:47,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:30:47,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 23:30:47,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:30:47,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:30:47,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1052176159, now seen corresponding path program 1 times [2024-11-19 23:30:47,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:30:47,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071615510] [2024-11-19 23:30:47,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:30:47,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:30:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:47,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:30:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:47,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:30:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:47,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:30:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:47,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:30:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:47,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:30:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:47,802 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-19 23:30:47,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:30:47,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071615510] [2024-11-19 23:30:47,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071615510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:30:47,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:30:47,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:30:47,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913476754] [2024-11-19 23:30:47,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:30:47,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:30:47,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:30:47,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:30:47,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:30:47,804 INFO L87 Difference]: Start difference. First operand 21119 states and 33610 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:30:52,317 INFO L93 Difference]: Finished difference Result 70141 states and 111643 transitions. [2024-11-19 23:30:52,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:30:52,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2024-11-19 23:30:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:30:52,546 INFO L225 Difference]: With dead ends: 70141 [2024-11-19 23:30:52,546 INFO L226 Difference]: Without dead ends: 51160 [2024-11-19 23:30:52,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:30:52,609 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5202 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2678 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5218 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 23:30:52,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5218 Valid, 21829 Invalid, 2735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2678 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 23:30:52,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51160 states. [2024-11-19 23:30:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51160 to 39936. [2024-11-19 23:30:54,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39936 states, 36705 states have (on average 1.544993870044953) internal successors, (56709), 36835 states have internal predecessors, (56709), 2327 states have call successors, (2327), 774 states have call predecessors, (2327), 902 states have return successors, (4642), 2454 states have call predecessors, (4642), 2327 states have call successors, (4642) [2024-11-19 23:30:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39936 states to 39936 states and 63678 transitions. [2024-11-19 23:30:54,564 INFO L78 Accepts]: Start accepts. Automaton has 39936 states and 63678 transitions. Word has length 145 [2024-11-19 23:30:54,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:30:54,565 INFO L471 AbstractCegarLoop]: Abstraction has 39936 states and 63678 transitions. [2024-11-19 23:30:54,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:30:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 39936 states and 63678 transitions. [2024-11-19 23:30:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:30:54,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:30:54,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:30:54,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 23:30:54,590 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:30:54,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:30:54,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1384819297, now seen corresponding path program 1 times [2024-11-19 23:30:54,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:30:54,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969855605] [2024-11-19 23:30:54,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:30:54,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:30:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:54,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:30:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:54,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:30:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:54,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:30:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:54,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:30:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:54,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:30:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:30:54,806 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-19 23:30:54,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:30:54,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969855605] [2024-11-19 23:30:54,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969855605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:30:54,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:30:54,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:30:54,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109717909] [2024-11-19 23:30:54,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:30:54,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:30:54,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:30:54,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:30:54,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:30:54,812 INFO L87 Difference]: Start difference. First operand 39936 states and 63678 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:31:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:31:01,948 INFO L93 Difference]: Finished difference Result 152954 states and 244639 transitions. [2024-11-19 23:31:01,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 23:31:01,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2024-11-19 23:31:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:31:02,668 INFO L225 Difference]: With dead ends: 152954 [2024-11-19 23:31:02,668 INFO L226 Difference]: Without dead ends: 115156 [2024-11-19 23:31:02,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-19 23:31:02,763 INFO L432 NwaCegarLoop]: 4416 mSDtfsCounter, 5279 mSDsluCounter, 17399 mSDsCounter, 0 mSdLazyCounter, 3197 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5294 SdHoareTripleChecker+Valid, 21815 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 23:31:02,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5294 Valid, 21815 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3197 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 23:31:02,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115156 states. [2024-11-19 23:31:07,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115156 to 76802. [2024-11-19 23:31:07,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76802 states, 70499 states have (on average 1.537057263223592) internal successors, (108361), 70757 states have internal predecessors, (108361), 4503 states have call successors, (4503), 1542 states have call predecessors, (4503), 1798 states have return successors, (11320), 4758 states have call predecessors, (11320), 4503 states have call successors, (11320) [2024-11-19 23:31:07,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76802 states to 76802 states and 124184 transitions. [2024-11-19 23:31:07,518 INFO L78 Accepts]: Start accepts. Automaton has 76802 states and 124184 transitions. Word has length 145 [2024-11-19 23:31:07,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:31:07,520 INFO L471 AbstractCegarLoop]: Abstraction has 76802 states and 124184 transitions. [2024-11-19 23:31:07,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 23:31:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 76802 states and 124184 transitions. [2024-11-19 23:31:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 23:31:07,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:31:07,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:31:07,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 23:31:07,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:31:07,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:31:07,580 INFO L85 PathProgramCache]: Analyzing trace with hash 617066973, now seen corresponding path program 1 times [2024-11-19 23:31:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:31:07,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481515994] [2024-11-19 23:31:07,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:31:07,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:31:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:31:07,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:31:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:31:07,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:31:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:31:07,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:31:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:31:07,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:31:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:31:07,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:31:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:31:07,852 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-19 23:31:07,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:31:07,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481515994] [2024-11-19 23:31:07,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481515994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:31:07,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:31:07,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:31:07,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426259588] [2024-11-19 23:31:07,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:31:07,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:31:07,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:31:07,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:31:07,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:31:07,855 INFO L87 Difference]: Start difference. First operand 76802 states and 124184 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)