./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_label40+token_ring.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_label40+token_ring.10.cil-2.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 b2d817c779a7c88ce14310f494c47ad6ae04ac82c2c2c295ca0b97645ed08cbd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 02:10:54,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 02:10:54,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 02:10:54,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 02:10:54,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 02:10:54,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 02:10:54,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 02:10:54,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 02:10:54,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 02:10:54,493 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 02:10:54,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 02:10:54,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 02:10:54,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 02:10:54,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 02:10:54,495 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 02:10:54,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 02:10:54,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 02:10:54,496 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 02:10:54,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 02:10:54,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 02:10:54,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 02:10:54,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 02:10:54,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 02:10:54,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 02:10:54,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 02:10:54,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 02:10:54,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 02:10:54,503 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 02:10:54,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 02:10:54,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 02:10:54,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 02:10:54,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 02:10:54,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:10:54,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 02:10:54,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 02:10:54,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 02:10:54,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 02:10:54,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 02:10:54,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 02:10:54,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 02:10:54,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 02:10:54,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 02:10:54,508 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 -> b2d817c779a7c88ce14310f494c47ad6ae04ac82c2c2c295ca0b97645ed08cbd [2024-10-24 02:10:54,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 02:10:54,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 02:10:54,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 02:10:54,806 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 02:10:54,806 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 02:10:54,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.10.cil-2.c [2024-10-24 02:10:56,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 02:10:56,930 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 02:10:56,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.10.cil-2.c [2024-10-24 02:10:57,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138cfdab4/4134b566bad0431c8f2108a1b2d332d8/FLAG86f7c9d12 [2024-10-24 02:10:57,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138cfdab4/4134b566bad0431c8f2108a1b2d332d8 [2024-10-24 02:10:57,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 02:10:57,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 02:10:57,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 02:10:57,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 02:10:57,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 02:10:57,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:10:57" (1/1) ... [2024-10-24 02:10:57,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af52e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:57, skipping insertion in model container [2024-10-24 02:10:57,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:10:57" (1/1) ... [2024-10-24 02:10:57,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 02:10:58,751 WARN L248 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_label40+token_ring.10.cil-2.c[377069,377082] [2024-10-24 02:10:58,783 WARN L248 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_label40+token_ring.10.cil-2.c[383339,383352] [2024-10-24 02:10:59,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:10:59,041 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 02:10:59,839 WARN L248 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_label40+token_ring.10.cil-2.c[377069,377082] [2024-10-24 02:10:59,847 WARN L248 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_label40+token_ring.10.cil-2.c[383339,383352] [2024-10-24 02:10:59,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:10:59,929 INFO L204 MainTranslator]: Completed translation [2024-10-24 02:10:59,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:59 WrapperNode [2024-10-24 02:10:59,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 02:10:59,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 02:10:59,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 02:10:59,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 02:10:59,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:59" (1/1) ... [2024-10-24 02:11:00,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:59" (1/1) ... [2024-10-24 02:11:00,401 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13113 [2024-10-24 02:11:00,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 02:11:00,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 02:11:00,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 02:11:00,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 02:11:00,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:59" (1/1) ... [2024-10-24 02:11:00,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:59" (1/1) ... [2024-10-24 02:11:00,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:59" (1/1) ... [2024-10-24 02:11:00,647 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-10-24 02:11:00,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:59" (1/1) ... [2024-10-24 02:11:00,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:59" (1/1) ... [2024-10-24 02:11:00,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:59" (1/1) ... [2024-10-24 02:11:00,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:59" (1/1) ... [2024-10-24 02:11:00,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:59" (1/1) ... [2024-10-24 02:11:00,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:59" (1/1) ... [2024-10-24 02:11:00,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 02:11:00,987 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 02:11:00,987 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 02:11:00,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 02:11:00,988 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:59" (1/1) ... [2024-10-24 02:11:00,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:11:01,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:11:01,020 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-10-24 02:11:01,023 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-10-24 02:11:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 02:11:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-24 02:11:01,059 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-24 02:11:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 02:11:01,059 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 02:11:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-24 02:11:01,059 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-24 02:11:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-24 02:11:01,060 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-24 02:11:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-24 02:11:01,060 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-24 02:11:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-24 02:11:01,060 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-24 02:11:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 02:11:01,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 02:11:01,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 02:11:01,176 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 02:11:01,178 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 02:11:09,198 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2024-10-24 02:11:09,199 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 02:11:09,325 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 02:11:09,326 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-24 02:11:09,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:11:09 BoogieIcfgContainer [2024-10-24 02:11:09,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 02:11:09,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 02:11:09,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 02:11:09,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 02:11:09,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:10:57" (1/3) ... [2024-10-24 02:11:09,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0d346f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:11:09, skipping insertion in model container [2024-10-24 02:11:09,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:59" (2/3) ... [2024-10-24 02:11:09,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0d346f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:11:09, skipping insertion in model container [2024-10-24 02:11:09,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:11:09" (3/3) ... [2024-10-24 02:11:09,337 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.10.cil-2.c [2024-10-24 02:11:09,354 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 02:11:09,354 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 02:11:09,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 02:11:09,473 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;@6d77ef0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 02:11:09,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 02:11:09,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 2425 states, 2392 states have (on average 1.8775083612040133) internal successors, (4491), 2395 states have internal predecessors, (4491), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 02:11:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 02:11:09,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:11:09,507 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] [2024-10-24 02:11:09,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:11:09,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:11:09,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1401539103, now seen corresponding path program 1 times [2024-10-24 02:11:09,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:11:09,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250175449] [2024-10-24 02:11:09,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:11:09,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:11:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:09,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:11:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:10,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 02:11:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:10,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:11:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:10,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 02:11:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:10,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 02:11:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:11:10,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:11:10,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250175449] [2024-10-24 02:11:10,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250175449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:11:10,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:11:10,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:11:10,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46253172] [2024-10-24 02:11:10,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:11:10,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:11:10,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:11:10,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:11:10,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:11:10,226 INFO L87 Difference]: Start difference. First operand has 2425 states, 2392 states have (on average 1.8775083612040133) internal successors, (4491), 2395 states have internal predecessors, (4491), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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-10-24 02:11:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:11:12,147 INFO L93 Difference]: Finished difference Result 4952 states and 9258 transitions. [2024-10-24 02:11:12,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 02:11:12,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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 141 [2024-10-24 02:11:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:11:12,186 INFO L225 Difference]: With dead ends: 4952 [2024-10-24 02:11:12,186 INFO L226 Difference]: Without dead ends: 2531 [2024-10-24 02:11:12,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 02:11:12,204 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 837 mSDsluCounter, 12160 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 16379 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:11:12,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 16379 Invalid, 963 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 02:11:12,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2024-10-24 02:11:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2421. [2024-10-24 02:11:12,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2389 states have (on average 1.8396818752616158) internal successors, (4395), 2391 states have internal predecessors, (4395), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 02:11:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 4443 transitions. [2024-10-24 02:11:12,383 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 4443 transitions. Word has length 141 [2024-10-24 02:11:12,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:11:12,384 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 4443 transitions. [2024-10-24 02:11:12,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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-10-24 02:11:12,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 4443 transitions. [2024-10-24 02:11:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 02:11:12,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:11:12,394 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] [2024-10-24 02:11:12,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 02:11:12,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:11:12,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:11:12,395 INFO L85 PathProgramCache]: Analyzing trace with hash 726378977, now seen corresponding path program 1 times [2024-10-24 02:11:12,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:11:12,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485640427] [2024-10-24 02:11:12,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:11:12,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:11:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:12,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:11:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:12,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 02:11:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:12,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:11:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:12,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 02:11:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:12,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 02:11:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:11:12,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:11:12,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485640427] [2024-10-24 02:11:12,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485640427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:11:12,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:11:12,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:11:12,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804414673] [2024-10-24 02:11:12,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:11:12,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:11:12,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:11:12,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:11:12,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:11:12,909 INFO L87 Difference]: Start difference. First operand 2421 states and 4443 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:11:16,908 INFO L93 Difference]: Finished difference Result 3245 states and 5826 transitions. [2024-10-24 02:11:16,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:11:16,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-24 02:11:16,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:11:16,928 INFO L225 Difference]: With dead ends: 3245 [2024-10-24 02:11:16,928 INFO L226 Difference]: Without dead ends: 2961 [2024-10-24 02:11:16,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:11:16,934 INFO L432 NwaCegarLoop]: 4363 mSDtfsCounter, 5163 mSDsluCounter, 17153 mSDsCounter, 0 mSdLazyCounter, 3302 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5180 SdHoareTripleChecker+Valid, 21516 SdHoareTripleChecker+Invalid, 3364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-24 02:11:16,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5180 Valid, 21516 Invalid, 3364 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 3302 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-24 02:11:16,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2024-10-24 02:11:17,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2724. [2024-10-24 02:11:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2724 states, 2663 states have (on average 1.819752159218926) internal successors, (4846), 2667 states have internal predecessors, (4846), 45 states have call successors, (45), 12 states have call predecessors, (45), 14 states have return successors, (52), 46 states have call predecessors, (52), 45 states have call successors, (52) [2024-10-24 02:11:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 4943 transitions. [2024-10-24 02:11:17,044 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 4943 transitions. Word has length 141 [2024-10-24 02:11:17,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:11:17,045 INFO L471 AbstractCegarLoop]: Abstraction has 2724 states and 4943 transitions. [2024-10-24 02:11:17,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 4943 transitions. [2024-10-24 02:11:17,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 02:11:17,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:11:17,050 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] [2024-10-24 02:11:17,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 02:11:17,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:11:17,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:11:17,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1214426083, now seen corresponding path program 1 times [2024-10-24 02:11:17,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:11:17,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813513093] [2024-10-24 02:11:17,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:11:17,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:11:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:17,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:11:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:17,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 02:11:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:17,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:11:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:17,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 02:11:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:17,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 02:11:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:11:17,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:11:17,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813513093] [2024-10-24 02:11:17,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813513093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:11:17,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:11:17,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:11:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268127749] [2024-10-24 02:11:17,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:11:17,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:11:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:11:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:11:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:11:17,404 INFO L87 Difference]: Start difference. First operand 2724 states and 4943 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:11:21,226 INFO L93 Difference]: Finished difference Result 4288 states and 7546 transitions. [2024-10-24 02:11:21,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:11:21,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-24 02:11:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:11:21,250 INFO L225 Difference]: With dead ends: 4288 [2024-10-24 02:11:21,251 INFO L226 Difference]: Without dead ends: 3703 [2024-10-24 02:11:21,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:11:21,258 INFO L432 NwaCegarLoop]: 4311 mSDtfsCounter, 5204 mSDsluCounter, 17089 mSDsCounter, 0 mSdLazyCounter, 2989 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5221 SdHoareTripleChecker+Valid, 21400 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-24 02:11:21,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5221 Valid, 21400 Invalid, 3059 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [70 Valid, 2989 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-24 02:11:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3703 states. [2024-10-24 02:11:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3703 to 3278. [2024-10-24 02:11:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.7873617693522907) internal successors, (5657), 3171 states have internal predecessors, (5657), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-24 02:11:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5840 transitions. [2024-10-24 02:11:21,432 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5840 transitions. Word has length 141 [2024-10-24 02:11:21,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:11:21,433 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5840 transitions. [2024-10-24 02:11:21,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:21,434 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5840 transitions. [2024-10-24 02:11:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 02:11:21,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:11:21,437 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] [2024-10-24 02:11:21,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 02:11:21,438 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:11:21,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:11:21,438 INFO L85 PathProgramCache]: Analyzing trace with hash 121790881, now seen corresponding path program 1 times [2024-10-24 02:11:21,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:11:21,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6610013] [2024-10-24 02:11:21,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:11:21,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:11:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:21,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:11:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:21,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 02:11:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:21,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:11:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 02:11:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:21,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 02:11:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:11:21,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:11:21,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6610013] [2024-10-24 02:11:21,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6610013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:11:21,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:11:21,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:11:21,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161741836] [2024-10-24 02:11:21,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:11:21,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:11:21,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:11:21,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:11:21,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:11:21,790 INFO L87 Difference]: Start difference. First operand 3278 states and 5840 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:11:23,714 INFO L93 Difference]: Finished difference Result 4857 states and 8484 transitions. [2024-10-24 02:11:23,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:11:23,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-24 02:11:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:11:23,733 INFO L225 Difference]: With dead ends: 4857 [2024-10-24 02:11:23,734 INFO L226 Difference]: Without dead ends: 3716 [2024-10-24 02:11:23,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:11:23,744 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 5000 mSDsluCounter, 12398 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5018 SdHoareTripleChecker+Valid, 16573 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:11:23,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5018 Valid, 16573 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 02:11:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states. [2024-10-24 02:11:23,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 3278. [2024-10-24 02:11:23,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.785781990521327) internal successors, (5652), 3171 states have internal predecessors, (5652), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-24 02:11:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5835 transitions. [2024-10-24 02:11:23,878 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5835 transitions. Word has length 141 [2024-10-24 02:11:23,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:11:23,879 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5835 transitions. [2024-10-24 02:11:23,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5835 transitions. [2024-10-24 02:11:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 02:11:23,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:11:23,883 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] [2024-10-24 02:11:23,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 02:11:23,883 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:11:23,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:11:23,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1160381405, now seen corresponding path program 1 times [2024-10-24 02:11:23,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:11:23,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643504281] [2024-10-24 02:11:23,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:11:23,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:11:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:23,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:11:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:24,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 02:11:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:24,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:11:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:24,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 02:11:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:24,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 02:11:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:11:24,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:11:24,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643504281] [2024-10-24 02:11:24,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643504281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:11:24,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:11:24,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:11:24,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583084816] [2024-10-24 02:11:24,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:11:24,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:11:24,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:11:24,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:11:24,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:11:24,144 INFO L87 Difference]: Start difference. First operand 3278 states and 5835 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:11:25,675 INFO L93 Difference]: Finished difference Result 4853 states and 8463 transitions. [2024-10-24 02:11:25,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:11:25,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-24 02:11:25,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:11:25,694 INFO L225 Difference]: With dead ends: 4853 [2024-10-24 02:11:25,694 INFO L226 Difference]: Without dead ends: 3712 [2024-10-24 02:11:25,701 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-10-24 02:11:25,703 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4998 mSDsluCounter, 12398 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5016 SdHoareTripleChecker+Valid, 16573 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 02:11:25,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5016 Valid, 16573 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 02:11:25,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2024-10-24 02:11:25,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 3278. [2024-10-24 02:11:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.7842022116903633) internal successors, (5647), 3171 states have internal predecessors, (5647), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-24 02:11:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5830 transitions. [2024-10-24 02:11:25,827 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5830 transitions. Word has length 141 [2024-10-24 02:11:25,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:11:25,827 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5830 transitions. [2024-10-24 02:11:25,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5830 transitions. [2024-10-24 02:11:25,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 02:11:25,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:11:25,830 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] [2024-10-24 02:11:25,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 02:11:25,831 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:11:25,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:11:25,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1292110177, now seen corresponding path program 1 times [2024-10-24 02:11:25,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:11:25,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253785770] [2024-10-24 02:11:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:11:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:11:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:25,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:11:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:25,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 02:11:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:26,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:11:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:26,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 02:11:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:26,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 02:11:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:11:26,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:11:26,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253785770] [2024-10-24 02:11:26,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253785770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:11:26,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:11:26,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:11:26,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72956368] [2024-10-24 02:11:26,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:11:26,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:11:26,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:11:26,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:11:26,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:11:26,079 INFO L87 Difference]: Start difference. First operand 3278 states and 5830 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:11:27,730 INFO L93 Difference]: Finished difference Result 4848 states and 8440 transitions. [2024-10-24 02:11:27,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:11:27,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-24 02:11:27,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:11:27,749 INFO L225 Difference]: With dead ends: 4848 [2024-10-24 02:11:27,749 INFO L226 Difference]: Without dead ends: 3707 [2024-10-24 02:11:27,756 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-10-24 02:11:27,757 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4867 mSDsluCounter, 16496 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4885 SdHoareTripleChecker+Valid, 20671 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 02:11:27,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4885 Valid, 20671 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 02:11:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2024-10-24 02:11:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3278. [2024-10-24 02:11:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.7826224328593996) internal successors, (5642), 3171 states have internal predecessors, (5642), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-24 02:11:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5825 transitions. [2024-10-24 02:11:27,930 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5825 transitions. Word has length 141 [2024-10-24 02:11:27,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:11:27,931 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5825 transitions. [2024-10-24 02:11:27,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5825 transitions. [2024-10-24 02:11:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 02:11:27,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:11:27,935 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] [2024-10-24 02:11:27,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 02:11:27,935 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:11:27,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:11:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash -429892509, now seen corresponding path program 1 times [2024-10-24 02:11:27,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:11:27,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077714294] [2024-10-24 02:11:27,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:11:27,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:11:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:28,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:11:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:28,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 02:11:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:28,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:11:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 02:11:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:28,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 02:11:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:11:28,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:11:28,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077714294] [2024-10-24 02:11:28,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077714294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:11:28,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:11:28,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:11:28,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360444942] [2024-10-24 02:11:28,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:11:28,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:11:28,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:11:28,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:11:28,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:11:28,200 INFO L87 Difference]: Start difference. First operand 3278 states and 5825 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:11:31,482 INFO L93 Difference]: Finished difference Result 6307 states and 10801 transitions. [2024-10-24 02:11:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:11:31,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-24 02:11:31,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:11:31,505 INFO L225 Difference]: With dead ends: 6307 [2024-10-24 02:11:31,506 INFO L226 Difference]: Without dead ends: 5168 [2024-10-24 02:11:31,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:11:31,514 INFO L432 NwaCegarLoop]: 4358 mSDtfsCounter, 5154 mSDsluCounter, 17153 mSDsCounter, 0 mSdLazyCounter, 3198 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5171 SdHoareTripleChecker+Valid, 21511 SdHoareTripleChecker+Invalid, 3262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 02:11:31,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5171 Valid, 21511 Invalid, 3262 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 3198 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 02:11:31,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2024-10-24 02:11:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 4397. [2024-10-24 02:11:31,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4397 states, 4180 states have (on average 1.7375598086124402) internal successors, (7263), 4190 states have internal predecessors, (7263), 159 states have call successors, (159), 48 states have call predecessors, (159), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-24 02:11:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 7624 transitions. [2024-10-24 02:11:31,716 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 7624 transitions. Word has length 141 [2024-10-24 02:11:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:11:31,717 INFO L471 AbstractCegarLoop]: Abstraction has 4397 states and 7624 transitions. [2024-10-24 02:11:31,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 7624 transitions. [2024-10-24 02:11:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 02:11:31,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:11:31,723 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] [2024-10-24 02:11:31,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 02:11:31,723 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:11:31,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:11:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash -762535647, now seen corresponding path program 1 times [2024-10-24 02:11:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:11:31,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42967516] [2024-10-24 02:11:31,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:11:31,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:11:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:31,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:11:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:31,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 02:11:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:31,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:11:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:31,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 02:11:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:31,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 02:11:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:11:31,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:11:31,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42967516] [2024-10-24 02:11:31,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42967516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:11:31,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:11:31,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:11:31,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106448099] [2024-10-24 02:11:31,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:11:31,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:11:31,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:11:31,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:11:31,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:11:31,966 INFO L87 Difference]: Start difference. First operand 4397 states and 7624 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:11:33,636 INFO L93 Difference]: Finished difference Result 7464 states and 12699 transitions. [2024-10-24 02:11:33,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:11:33,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-24 02:11:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:11:33,656 INFO L225 Difference]: With dead ends: 7464 [2024-10-24 02:11:33,656 INFO L226 Difference]: Without dead ends: 5204 [2024-10-24 02:11:33,666 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-10-24 02:11:33,667 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4871 mSDsluCounter, 16496 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4889 SdHoareTripleChecker+Valid, 20671 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 02:11:33,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4889 Valid, 20671 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 02:11:33,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2024-10-24 02:11:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 4397. [2024-10-24 02:11:33,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4397 states, 4180 states have (on average 1.7354066985645933) internal successors, (7254), 4190 states have internal predecessors, (7254), 159 states have call successors, (159), 48 states have call predecessors, (159), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-24 02:11:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 7615 transitions. [2024-10-24 02:11:33,851 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 7615 transitions. Word has length 141 [2024-10-24 02:11:33,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:11:33,852 INFO L471 AbstractCegarLoop]: Abstraction has 4397 states and 7615 transitions. [2024-10-24 02:11:33,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 7615 transitions. [2024-10-24 02:11:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 02:11:33,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:11:33,858 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] [2024-10-24 02:11:33,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 02:11:33,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:11:33,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:11:33,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1166396579, now seen corresponding path program 1 times [2024-10-24 02:11:33,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:11:33,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963549829] [2024-10-24 02:11:33,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:11:33,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:11:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:33,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:11:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:34,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 02:11:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:34,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:11:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:34,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 02:11:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:34,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 02:11:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:11:34,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:11:34,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963549829] [2024-10-24 02:11:34,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963549829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:11:34,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:11:34,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:11:34,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945528323] [2024-10-24 02:11:34,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:11:34,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:11:34,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:11:34,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:11:34,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:11:34,108 INFO L87 Difference]: Start difference. First operand 4397 states and 7615 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:37,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:11:37,137 INFO L93 Difference]: Finished difference Result 10354 states and 17366 transitions. [2024-10-24 02:11:37,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:11:37,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-24 02:11:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:11:37,165 INFO L225 Difference]: With dead ends: 10354 [2024-10-24 02:11:37,166 INFO L226 Difference]: Without dead ends: 8096 [2024-10-24 02:11:37,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:11:37,178 INFO L432 NwaCegarLoop]: 4358 mSDtfsCounter, 5186 mSDsluCounter, 17153 mSDsCounter, 0 mSdLazyCounter, 3078 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5203 SdHoareTripleChecker+Valid, 21511 SdHoareTripleChecker+Invalid, 3142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 02:11:37,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5203 Valid, 21511 Invalid, 3142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3078 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 02:11:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2024-10-24 02:11:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 6657. [2024-10-24 02:11:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6657 states, 6232 states have (on average 1.6882220795892169) internal successors, (10521), 6250 states have internal predecessors, (10521), 311 states have call successors, (311), 96 states have call predecessors, (311), 112 states have return successors, (424), 326 states have call predecessors, (424), 311 states have call successors, (424) [2024-10-24 02:11:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 11256 transitions. [2024-10-24 02:11:37,501 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 11256 transitions. Word has length 141 [2024-10-24 02:11:37,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:11:37,501 INFO L471 AbstractCegarLoop]: Abstraction has 6657 states and 11256 transitions. [2024-10-24 02:11:37,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:37,502 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 11256 transitions. [2024-10-24 02:11:37,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 02:11:37,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:11:37,506 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] [2024-10-24 02:11:37,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 02:11:37,507 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:11:37,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:11:37,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1401425755, now seen corresponding path program 1 times [2024-10-24 02:11:37,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:11:37,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948130375] [2024-10-24 02:11:37,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:11:37,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:11:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:37,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:11:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:37,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 02:11:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:37,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:11:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:37,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 02:11:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:37,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 02:11:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:11:37,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:11:37,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948130375] [2024-10-24 02:11:37,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948130375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:11:37,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:11:37,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:11:37,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90036336] [2024-10-24 02:11:37,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:11:37,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:11:37,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:11:37,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:11:37,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:11:37,754 INFO L87 Difference]: Start difference. First operand 6657 states and 11256 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:40,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:11:40,772 INFO L93 Difference]: Finished difference Result 18478 states and 30647 transitions. [2024-10-24 02:11:40,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:11:40,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-24 02:11:40,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:11:40,824 INFO L225 Difference]: With dead ends: 18478 [2024-10-24 02:11:40,824 INFO L226 Difference]: Without dead ends: 13960 [2024-10-24 02:11:40,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:11:40,846 INFO L432 NwaCegarLoop]: 4312 mSDtfsCounter, 5212 mSDsluCounter, 17089 mSDsCounter, 0 mSdLazyCounter, 2832 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5229 SdHoareTripleChecker+Valid, 21401 SdHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 02:11:40,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5229 Valid, 21401 Invalid, 2902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2832 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 02:11:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13960 states. [2024-10-24 02:11:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13960 to 11193. [2024-10-24 02:11:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11193 states, 10352 states have (on average 1.6498261205564142) internal successors, (17079), 10386 states have internal predecessors, (17079), 615 states have call successors, (615), 192 states have call predecessors, (615), 224 states have return successors, (922), 646 states have call predecessors, (922), 615 states have call successors, (922) [2024-10-24 02:11:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11193 states to 11193 states and 18616 transitions. [2024-10-24 02:11:41,470 INFO L78 Accepts]: Start accepts. Automaton has 11193 states and 18616 transitions. Word has length 141 [2024-10-24 02:11:41,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:11:41,470 INFO L471 AbstractCegarLoop]: Abstraction has 11193 states and 18616 transitions. [2024-10-24 02:11:41,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 11193 states and 18616 transitions. [2024-10-24 02:11:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 02:11:41,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:11:41,484 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] [2024-10-24 02:11:41,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 02:11:41,484 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:11:41,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:11:41,484 INFO L85 PathProgramCache]: Analyzing trace with hash -930069405, now seen corresponding path program 1 times [2024-10-24 02:11:41,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:11:41,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776678000] [2024-10-24 02:11:41,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:11:41,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:11:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:41,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:11:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:41,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 02:11:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:41,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:11:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:41,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 02:11:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:41,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 02:11:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:11:41,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:11:41,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776678000] [2024-10-24 02:11:41,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776678000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:11:41,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:11:41,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:11:41,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443531260] [2024-10-24 02:11:41,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:11:41,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:11:41,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:11:41,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:11:41,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:11:41,716 INFO L87 Difference]: Start difference. First operand 11193 states and 18616 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:11:46,396 INFO L93 Difference]: Finished difference Result 38822 states and 64027 transitions. [2024-10-24 02:11:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:11:46,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-24 02:11:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:11:46,530 INFO L225 Difference]: With dead ends: 38822 [2024-10-24 02:11:46,530 INFO L226 Difference]: Without dead ends: 29768 [2024-10-24 02:11:46,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:11:46,570 INFO L432 NwaCegarLoop]: 4357 mSDtfsCounter, 5552 mSDsluCounter, 17148 mSDsCounter, 0 mSdLazyCounter, 3047 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5580 SdHoareTripleChecker+Valid, 21505 SdHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 02:11:46,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5580 Valid, 21505 Invalid, 3114 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 3047 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 02:11:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29768 states. [2024-10-24 02:11:47,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29768 to 20233. [2024-10-24 02:11:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20233 states, 18592 states have (on average 1.6249462134251291) internal successors, (30211), 18658 states have internal predecessors, (30211), 1191 states have call successors, (1191), 384 states have call predecessors, (1191), 448 states have return successors, (2048), 1254 states have call predecessors, (2048), 1191 states have call successors, (2048) [2024-10-24 02:11:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20233 states to 20233 states and 33450 transitions. [2024-10-24 02:11:47,994 INFO L78 Accepts]: Start accepts. Automaton has 20233 states and 33450 transitions. Word has length 141 [2024-10-24 02:11:47,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:11:47,995 INFO L471 AbstractCegarLoop]: Abstraction has 20233 states and 33450 transitions. [2024-10-24 02:11:47,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 20233 states and 33450 transitions. [2024-10-24 02:11:48,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 02:11:48,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:11:48,012 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] [2024-10-24 02:11:48,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 02:11:48,013 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:11:48,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:11:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1717534949, now seen corresponding path program 1 times [2024-10-24 02:11:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:11:48,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742864153] [2024-10-24 02:11:48,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:11:48,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:11:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:48,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:11:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 02:11:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:48,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:11:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 02:11:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:48,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 02:11:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:11:48,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:11:48,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742864153] [2024-10-24 02:11:48,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742864153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:11:48,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:11:48,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:11:48,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559244097] [2024-10-24 02:11:48,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:11:48,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:11:48,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:11:48,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:11:48,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:11:48,248 INFO L87 Difference]: Start difference. First operand 20233 states and 33450 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:53,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:11:53,726 INFO L93 Difference]: Finished difference Result 74518 states and 123319 transitions. [2024-10-24 02:11:53,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:11:53,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 141 [2024-10-24 02:11:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:11:53,984 INFO L225 Difference]: With dead ends: 74518 [2024-10-24 02:11:53,985 INFO L226 Difference]: Without dead ends: 56424 [2024-10-24 02:11:54,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:11:54,062 INFO L432 NwaCegarLoop]: 4354 mSDtfsCounter, 5271 mSDsluCounter, 17145 mSDsCounter, 0 mSdLazyCounter, 3588 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5287 SdHoareTripleChecker+Valid, 21499 SdHoareTripleChecker+Invalid, 3654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 02:11:54,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5287 Valid, 21499 Invalid, 3654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3588 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 02:11:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56424 states. [2024-10-24 02:11:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56424 to 37993. [2024-10-24 02:11:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37993 states, 34784 states have (on average 1.610711821527139) internal successors, (56027), 34914 states have internal predecessors, (56027), 2311 states have call successors, (2311), 768 states have call predecessors, (2311), 896 states have return successors, (4754), 2438 states have call predecessors, (4754), 2311 states have call successors, (4754) [2024-10-24 02:11:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37993 states to 37993 states and 63092 transitions. [2024-10-24 02:11:56,672 INFO L78 Accepts]: Start accepts. Automaton has 37993 states and 63092 transitions. Word has length 141 [2024-10-24 02:11:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:11:56,673 INFO L471 AbstractCegarLoop]: Abstraction has 37993 states and 63092 transitions. [2024-10-24 02:11:56,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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-10-24 02:11:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 37993 states and 63092 transitions. [2024-10-24 02:11:56,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 02:11:56,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:11:56,703 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] [2024-10-24 02:11:56,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 02:11:56,704 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:11:56,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:11:56,704 INFO L85 PathProgramCache]: Analyzing trace with hash -413815773, now seen corresponding path program 1 times [2024-10-24 02:11:56,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:11:56,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123554760] [2024-10-24 02:11:56,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:11:56,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:11:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:56,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:11:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:56,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 02:11:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:56,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 02:11:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:56,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 02:11:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:56,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 02:11:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:11:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:11:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123554760] [2024-10-24 02:11:56,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123554760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:11:56,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:11:56,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:11:56,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858209426] [2024-10-24 02:11:56,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:11:56,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:11:56,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:11:56,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:11:56,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:11:56,973 INFO L87 Difference]: Start difference. First operand 37993 states and 63092 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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)