./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_label49+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.11.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5d96188e8fe998bfd3065ae27ea6234f9d513096a1254a43c8a37ba002e37de6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:27:39,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:27:39,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:27:39,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:27:39,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:27:39,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:27:39,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:27:39,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:27:39,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:27:39,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:27:39,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:27:39,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:27:39,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:27:39,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:27:39,417 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:27:39,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:27:39,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:27:39,417 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:27:39,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:27:39,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:27:39,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:27:39,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:27:39,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:27:39,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:27:39,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:27:39,422 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:27:39,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:27:39,422 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:27:39,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:27:39,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:27:39,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:27:39,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:27:39,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:27:39,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:27:39,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:27:39,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:27:39,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:27:39,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:27:39,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:27:39,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:27:39,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:27:39,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:27:39,426 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-clean/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-clean/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 -> 5d96188e8fe998bfd3065ae27ea6234f9d513096a1254a43c8a37ba002e37de6 [2024-10-11 04:27:39,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:27:39,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:27:39,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:27:39,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:27:39,676 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:27:39,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.11.cil-2.c [2024-10-11 04:27:41,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:27:41,871 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:27:41,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.11.cil-2.c [2024-10-11 04:27:41,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ed1c251b0/699148ba6cf043e2b71cb98b937839a1/FLAGb819ec729 [2024-10-11 04:27:41,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ed1c251b0/699148ba6cf043e2b71cb98b937839a1 [2024-10-11 04:27:41,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:27:41,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:27:41,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:27:41,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:27:41,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:27:41,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:27:41" (1/1) ... [2024-10-11 04:27:41,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cfe894f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:41, skipping insertion in model container [2024-10-11 04:27:41,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:27:41" (1/1) ... [2024-10-11 04:27:42,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:27:43,539 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_label49+token_ring.11.cil-2.c[380593,380606] [2024-10-11 04:27:43,562 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_label49+token_ring.11.cil-2.c[383339,383352] [2024-10-11 04:27:43,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:27:43,792 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:27:44,440 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_label49+token_ring.11.cil-2.c[380593,380606] [2024-10-11 04:27:44,446 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_label49+token_ring.11.cil-2.c[383339,383352] [2024-10-11 04:27:44,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:27:44,529 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:27:44,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:44 WrapperNode [2024-10-11 04:27:44,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:27:44,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:27:44,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:27:44,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:27:44,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:44" (1/1) ... [2024-10-11 04:27:44,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:44" (1/1) ... [2024-10-11 04:27:45,114 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13173 [2024-10-11 04:27:45,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:27:45,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:27:45,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:27:45,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:27:45,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:44" (1/1) ... [2024-10-11 04:27:45,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:44" (1/1) ... [2024-10-11 04:27:45,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:44" (1/1) ... [2024-10-11 04:27:45,327 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-11 04:27:45,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:44" (1/1) ... [2024-10-11 04:27:45,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:44" (1/1) ... [2024-10-11 04:27:45,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:44" (1/1) ... [2024-10-11 04:27:45,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:44" (1/1) ... [2024-10-11 04:27:45,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:44" (1/1) ... [2024-10-11 04:27:45,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:44" (1/1) ... [2024-10-11 04:27:45,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:27:45,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:27:45,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:27:45,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:27:45,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:44" (1/1) ... [2024-10-11 04:27:45,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:27:45,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:27:45,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:27:45,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:27:45,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:27:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:27:45,966 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:27:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:27:45,966 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:27:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:27:45,966 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:27:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:27:45,967 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:27:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:27:45,967 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:27:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:27:45,967 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:27:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:27:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:27:45,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:27:46,125 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:27:46,127 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:27:53,416 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2024-10-11 04:27:53,417 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:27:53,540 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:27:53,541 INFO L314 CfgBuilder]: Removed 15 assume(true) statements. [2024-10-11 04:27:53,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:27:53 BoogieIcfgContainer [2024-10-11 04:27:53,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:27:53,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:27:53,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:27:53,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:27:53,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:27:41" (1/3) ... [2024-10-11 04:27:53,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7627c9ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:27:53, skipping insertion in model container [2024-10-11 04:27:53,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:27:44" (2/3) ... [2024-10-11 04:27:53,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7627c9ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:27:53, skipping insertion in model container [2024-10-11 04:27:53,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:27:53" (3/3) ... [2024-10-11 04:27:53,552 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.11.cil-2.c [2024-10-11 04:27:53,568 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:27:53,568 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:27:53,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:27:53,717 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;@708a2973, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:27:53,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:27:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 2448 states, 2414 states have (on average 1.876553438276719) internal successors, (4530), 2417 states have internal predecessors, (4530), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 04:27:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:27:53,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:27:53,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:27:53,758 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:27:53,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:27:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash -982886586, now seen corresponding path program 1 times [2024-10-11 04:27:53,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:27:53,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141190042] [2024-10-11 04:27:53,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:53,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:27:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:54,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:27:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:54,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:27:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:54,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:27:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:54,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:27:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:54,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:27:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:54,469 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-11 04:27:54,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:27:54,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141190042] [2024-10-11 04:27:54,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141190042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:27:54,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:27:54,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:27:54,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197406620] [2024-10-11 04:27:54,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:27:54,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:27:54,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:27:54,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:27:54,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:27:54,514 INFO L87 Difference]: Start difference. First operand has 2448 states, 2414 states have (on average 1.876553438276719) internal successors, (4530), 2417 states have internal predecessors, (4530), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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-11 04:27:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:27:56,570 INFO L93 Difference]: Finished difference Result 5006 states and 9354 transitions. [2024-10-11 04:27:56,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:27:56,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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 151 [2024-10-11 04:27:56,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:27:56,599 INFO L225 Difference]: With dead ends: 5006 [2024-10-11 04:27:56,599 INFO L226 Difference]: Without dead ends: 2564 [2024-10-11 04:27:56,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:27:56,612 INFO L432 NwaCegarLoop]: 4238 mSDtfsCounter, 902 mSDsluCounter, 12182 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 16420 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:27:56,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 16420 Invalid, 1046 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:27:56,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-10-11 04:27:56,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2444. [2024-10-11 04:27:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 2411 states have (on average 1.838241393612609) internal successors, (4432), 2413 states have internal predecessors, (4432), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 04:27:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 4482 transitions. [2024-10-11 04:27:56,752 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 4482 transitions. Word has length 151 [2024-10-11 04:27:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:27:56,752 INFO L471 AbstractCegarLoop]: Abstraction has 2444 states and 4482 transitions. [2024-10-11 04:27:56,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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-11 04:27:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 4482 transitions. [2024-10-11 04:27:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:27:56,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:27:56,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:27:56,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:27:56,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:27:56,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:27:56,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1152996616, now seen corresponding path program 1 times [2024-10-11 04:27:56,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:27:56,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566477015] [2024-10-11 04:27:56,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:27:56,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:27:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:56,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:27:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:57,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:27:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:57,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:27:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:57,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:27:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:57,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:27:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:27:57,151 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-11 04:27:57,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:27:57,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566477015] [2024-10-11 04:27:57,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566477015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:27:57,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:27:57,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:27:57,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370155392] [2024-10-11 04:27:57,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:27:57,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:27:57,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:27:57,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:27:57,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:27:57,159 INFO L87 Difference]: Start difference. First operand 2444 states and 4482 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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-11 04:28:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:00,149 INFO L93 Difference]: Finished difference Result 3313 states and 5934 transitions. [2024-10-11 04:28:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:28:00,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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 151 [2024-10-11 04:28:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:00,164 INFO L225 Difference]: With dead ends: 3313 [2024-10-11 04:28:00,165 INFO L226 Difference]: Without dead ends: 3007 [2024-10-11 04:28:00,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:28:00,168 INFO L432 NwaCegarLoop]: 4252 mSDtfsCounter, 5325 mSDsluCounter, 12699 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5343 SdHoareTripleChecker+Valid, 16951 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:00,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5343 Valid, 16951 Invalid, 2279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 04:28:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-10-11 04:28:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2768. [2024-10-11 04:28:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2768 states, 2708 states have (on average 1.8172082717872968) internal successors, (4921), 2711 states have internal predecessors, (4921), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-10-11 04:28:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 5014 transitions. [2024-10-11 04:28:00,252 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 5014 transitions. Word has length 151 [2024-10-11 04:28:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:00,252 INFO L471 AbstractCegarLoop]: Abstraction has 2768 states and 5014 transitions. [2024-10-11 04:28:00,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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-11 04:28:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 5014 transitions. [2024-10-11 04:28:00,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:28:00,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:00,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:00,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:28:00,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:00,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1031770764, now seen corresponding path program 1 times [2024-10-11 04:28:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689497264] [2024-10-11 04:28:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:00,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:00,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:00,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:00,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:00,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:00,549 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-11 04:28:00,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:00,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689497264] [2024-10-11 04:28:00,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689497264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:00,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:00,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:00,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177197451] [2024-10-11 04:28:00,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:00,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:00,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:00,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:00,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:00,553 INFO L87 Difference]: Start difference. First operand 2768 states and 5014 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:04,307 INFO L93 Difference]: Finished difference Result 4098 states and 7236 transitions. [2024-10-11 04:28:04,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:28:04,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:28:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:04,336 INFO L225 Difference]: With dead ends: 4098 [2024-10-11 04:28:04,337 INFO L226 Difference]: Without dead ends: 3468 [2024-10-11 04:28:04,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:28:04,343 INFO L432 NwaCegarLoop]: 4390 mSDtfsCounter, 5356 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3461 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5374 SdHoareTripleChecker+Valid, 21646 SdHoareTripleChecker+Invalid, 3520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:04,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5374 Valid, 21646 Invalid, 3520 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 3461 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 04:28:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2024-10-11 04:28:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3067. [2024-10-11 04:28:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 2980 states have (on average 1.7986577181208054) internal successors, (5360), 2984 states have internal predecessors, (5360), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-11 04:28:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 5495 transitions. [2024-10-11 04:28:04,431 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 5495 transitions. Word has length 151 [2024-10-11 04:28:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:04,432 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 5495 transitions. [2024-10-11 04:28:04,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:04,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 5495 transitions. [2024-10-11 04:28:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:28:04,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:04,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:04,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:28:04,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:04,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:04,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1706930890, now seen corresponding path program 1 times [2024-10-11 04:28:04,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:04,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290548986] [2024-10-11 04:28:04,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:04,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:04,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:04,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:04,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:04,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:04,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:28:04,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:04,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290548986] [2024-10-11 04:28:04,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290548986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:04,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:04,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:04,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985970122] [2024-10-11 04:28:04,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:04,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:04,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:04,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:04,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:04,669 INFO L87 Difference]: Start difference. First operand 3067 states and 5495 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:08,486 INFO L93 Difference]: Finished difference Result 5248 states and 9131 transitions. [2024-10-11 04:28:08,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:28:08,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:28:08,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:08,505 INFO L225 Difference]: With dead ends: 5248 [2024-10-11 04:28:08,506 INFO L226 Difference]: Without dead ends: 4319 [2024-10-11 04:28:08,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:28:08,512 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5354 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3457 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5372 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:08,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5372 Valid, 21644 Invalid, 3518 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 3457 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 04:28:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2024-10-11 04:28:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 3666. [2024-10-11 04:28:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7699290780141843) internal successors, (6239), 3531 states have internal predecessors, (6239), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:28:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6462 transitions. [2024-10-11 04:28:08,696 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6462 transitions. Word has length 151 [2024-10-11 04:28:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:08,697 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6462 transitions. [2024-10-11 04:28:08,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6462 transitions. [2024-10-11 04:28:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:28:08,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:08,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:08,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:28:08,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:08,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:08,702 INFO L85 PathProgramCache]: Analyzing trace with hash 758878924, now seen corresponding path program 1 times [2024-10-11 04:28:08,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:08,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902157951] [2024-10-11 04:28:08,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:08,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:08,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:08,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:08,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:08,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:08,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:08,980 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-11 04:28:08,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:08,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902157951] [2024-10-11 04:28:08,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902157951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:08,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:08,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:08,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736613270] [2024-10-11 04:28:08,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:08,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:08,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:08,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:08,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:08,984 INFO L87 Difference]: Start difference. First operand 3666 states and 6462 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:11,242 INFO L93 Difference]: Finished difference Result 5837 states and 10091 transitions. [2024-10-11 04:28:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:28:11,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:28:11,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:11,263 INFO L225 Difference]: With dead ends: 5837 [2024-10-11 04:28:11,264 INFO L226 Difference]: Without dead ends: 4309 [2024-10-11 04:28:11,271 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-11 04:28:11,271 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 4957 mSDsluCounter, 16550 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4976 SdHoareTripleChecker+Valid, 20742 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:11,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4976 Valid, 20742 Invalid, 1832 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:28:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2024-10-11 04:28:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 3666. [2024-10-11 04:28:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7685106382978724) internal successors, (6234), 3531 states have internal predecessors, (6234), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:28:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6457 transitions. [2024-10-11 04:28:11,468 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6457 transitions. Word has length 151 [2024-10-11 04:28:11,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:11,469 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6457 transitions. [2024-10-11 04:28:11,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6457 transitions. [2024-10-11 04:28:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:28:11,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:11,473 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:11,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:28:11,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:11,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:11,474 INFO L85 PathProgramCache]: Analyzing trace with hash 174107274, now seen corresponding path program 1 times [2024-10-11 04:28:11,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:11,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901550101] [2024-10-11 04:28:11,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:11,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:11,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:11,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:11,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:11,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:11,761 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-11 04:28:11,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:11,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901550101] [2024-10-11 04:28:11,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901550101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:11,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:11,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:11,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4202371] [2024-10-11 04:28:11,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:11,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:11,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:11,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:11,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:11,766 INFO L87 Difference]: Start difference. First operand 3666 states and 6457 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:13,826 INFO L93 Difference]: Finished difference Result 5831 states and 10065 transitions. [2024-10-11 04:28:13,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:28:13,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:28:13,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:13,848 INFO L225 Difference]: With dead ends: 5831 [2024-10-11 04:28:13,848 INFO L226 Difference]: Without dead ends: 4303 [2024-10-11 04:28:13,856 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-11 04:28:13,857 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 5096 mSDsluCounter, 12441 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5115 SdHoareTripleChecker+Valid, 16633 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:13,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5115 Valid, 16633 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:28:13,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states. [2024-10-11 04:28:14,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 3666. [2024-10-11 04:28:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7670921985815602) internal successors, (6229), 3531 states have internal predecessors, (6229), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:28:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6452 transitions. [2024-10-11 04:28:14,031 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6452 transitions. Word has length 151 [2024-10-11 04:28:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:14,031 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6452 transitions. [2024-10-11 04:28:14,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6452 transitions. [2024-10-11 04:28:14,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:28:14,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:14,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:14,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:28:14,035 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:14,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:14,035 INFO L85 PathProgramCache]: Analyzing trace with hash -260398324, now seen corresponding path program 1 times [2024-10-11 04:28:14,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:14,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699258788] [2024-10-11 04:28:14,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:14,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:14,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:14,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:14,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:14,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:14,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:14,310 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-11 04:28:14,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:14,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699258788] [2024-10-11 04:28:14,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699258788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:14,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:14,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:14,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224336583] [2024-10-11 04:28:14,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:14,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:14,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:14,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:14,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:14,313 INFO L87 Difference]: Start difference. First operand 3666 states and 6452 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:16,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:16,244 INFO L93 Difference]: Finished difference Result 5824 states and 10037 transitions. [2024-10-11 04:28:16,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:28:16,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:28:16,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:16,261 INFO L225 Difference]: With dead ends: 5824 [2024-10-11 04:28:16,265 INFO L226 Difference]: Without dead ends: 4296 [2024-10-11 04:28:16,273 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-11 04:28:16,274 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 5100 mSDsluCounter, 12441 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5119 SdHoareTripleChecker+Valid, 16633 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:16,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5119 Valid, 16633 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:28:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2024-10-11 04:28:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3666. [2024-10-11 04:28:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7656737588652482) internal successors, (6224), 3531 states have internal predecessors, (6224), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:28:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6447 transitions. [2024-10-11 04:28:16,532 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6447 transitions. Word has length 151 [2024-10-11 04:28:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:16,535 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6447 transitions. [2024-10-11 04:28:16,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6447 transitions. [2024-10-11 04:28:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:28:16,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:16,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:16,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:28:16,538 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:16,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:16,539 INFO L85 PathProgramCache]: Analyzing trace with hash -690056630, now seen corresponding path program 1 times [2024-10-11 04:28:16,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:16,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944063622] [2024-10-11 04:28:16,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:16,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:16,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:16,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:16,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:16,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:16,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:16,784 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-11 04:28:16,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:16,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944063622] [2024-10-11 04:28:16,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944063622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:16,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:16,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:16,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480625458] [2024-10-11 04:28:16,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:16,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:16,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:16,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:16,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:16,786 INFO L87 Difference]: Start difference. First operand 3666 states and 6447 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:18,417 INFO L93 Difference]: Finished difference Result 5812 states and 9999 transitions. [2024-10-11 04:28:18,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:28:18,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:28:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:18,428 INFO L225 Difference]: With dead ends: 5812 [2024-10-11 04:28:18,428 INFO L226 Difference]: Without dead ends: 4284 [2024-10-11 04:28:18,432 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-11 04:28:18,432 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 5096 mSDsluCounter, 12441 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5115 SdHoareTripleChecker+Valid, 16633 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:18,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5115 Valid, 16633 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:28:18,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2024-10-11 04:28:18,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 3666. [2024-10-11 04:28:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.764255319148936) internal successors, (6219), 3531 states have internal predecessors, (6219), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:28:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6442 transitions. [2024-10-11 04:28:18,566 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6442 transitions. Word has length 151 [2024-10-11 04:28:18,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:18,568 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6442 transitions. [2024-10-11 04:28:18,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:18,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6442 transitions. [2024-10-11 04:28:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:28:18,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:18,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:18,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:28:18,572 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:18,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:18,573 INFO L85 PathProgramCache]: Analyzing trace with hash 256981256, now seen corresponding path program 1 times [2024-10-11 04:28:18,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:18,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232124283] [2024-10-11 04:28:18,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:18,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:18,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:18,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:18,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:18,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:18,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:28:18,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:18,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232124283] [2024-10-11 04:28:18,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232124283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:18,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:18,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:18,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378520833] [2024-10-11 04:28:18,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:18,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:18,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:18,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:18,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:18,809 INFO L87 Difference]: Start difference. First operand 3666 states and 6442 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:22,179 INFO L93 Difference]: Finished difference Result 7418 states and 12588 transitions. [2024-10-11 04:28:22,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:28:22,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:28:22,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:22,196 INFO L225 Difference]: With dead ends: 7418 [2024-10-11 04:28:22,197 INFO L226 Difference]: Without dead ends: 5890 [2024-10-11 04:28:22,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:28:22,203 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5325 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3327 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5343 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:22,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5343 Valid, 21644 Invalid, 3388 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 3327 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:28:22,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5890 states. [2024-10-11 04:28:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5890 to 4887. [2024-10-11 04:28:22,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4638 states have (on average 1.7231565329883571) internal successors, (7992), 4648 states have internal predecessors, (7992), 185 states have call successors, (185), 54 states have call predecessors, (185), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-10-11 04:28:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 8397 transitions. [2024-10-11 04:28:22,579 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 8397 transitions. Word has length 151 [2024-10-11 04:28:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:22,579 INFO L471 AbstractCegarLoop]: Abstraction has 4887 states and 8397 transitions. [2024-10-11 04:28:22,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 8397 transitions. [2024-10-11 04:28:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:28:22,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:22,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:22,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:28:22,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:22,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:22,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1118814858, now seen corresponding path program 1 times [2024-10-11 04:28:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:22,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122045063] [2024-10-11 04:28:22,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:22,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:22,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:22,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:22,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:22,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:22,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:22,887 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-11 04:28:22,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:22,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122045063] [2024-10-11 04:28:22,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122045063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:22,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:22,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:22,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882800818] [2024-10-11 04:28:22,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:22,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:22,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:22,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:22,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:22,890 INFO L87 Difference]: Start difference. First operand 4887 states and 8397 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:26,875 INFO L93 Difference]: Finished difference Result 11823 states and 19739 transitions. [2024-10-11 04:28:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:28:26,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:28:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:26,912 INFO L225 Difference]: With dead ends: 11823 [2024-10-11 04:28:26,913 INFO L226 Difference]: Without dead ends: 9074 [2024-10-11 04:28:26,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:28:26,923 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5324 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3314 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5342 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:26,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5342 Valid, 21644 Invalid, 3375 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 3314 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 04:28:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9074 states. [2024-10-11 04:28:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9074 to 7326. [2024-10-11 04:28:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7326 states, 6861 states have (on average 1.6802215420492639) internal successors, (11528), 6879 states have internal predecessors, (11528), 345 states have call successors, (345), 102 states have call predecessors, (345), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-10-11 04:28:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 12315 transitions. [2024-10-11 04:28:27,206 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 12315 transitions. Word has length 151 [2024-10-11 04:28:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:27,207 INFO L471 AbstractCegarLoop]: Abstraction has 7326 states and 12315 transitions. [2024-10-11 04:28:27,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:27,207 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 12315 transitions. [2024-10-11 04:28:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:28:27,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:27,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:27,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:28:27,212 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:27,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:27,213 INFO L85 PathProgramCache]: Analyzing trace with hash -931594040, now seen corresponding path program 1 times [2024-10-11 04:28:27,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:27,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159359439] [2024-10-11 04:28:27,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:27,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:27,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:27,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:27,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:27,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:27,498 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-11 04:28:27,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:27,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159359439] [2024-10-11 04:28:27,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159359439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:27,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:27,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:27,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40065082] [2024-10-11 04:28:27,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:27,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:27,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:27,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:27,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:27,501 INFO L87 Difference]: Start difference. First operand 7326 states and 12315 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:32,032 INFO L93 Difference]: Finished difference Result 20624 states and 34083 transitions. [2024-10-11 04:28:32,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:28:32,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:28:32,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:32,174 INFO L225 Difference]: With dead ends: 20624 [2024-10-11 04:28:32,174 INFO L226 Difference]: Without dead ends: 15436 [2024-10-11 04:28:32,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:28:32,229 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5323 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3301 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5341 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:32,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5341 Valid, 21644 Invalid, 3362 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 3301 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:28:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15436 states. [2024-10-11 04:28:33,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15436 to 12219. [2024-10-11 04:28:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12219 states, 11322 states have (on average 1.6447624094682918) internal successors, (18622), 11356 states have internal predecessors, (18622), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-11 04:28:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12219 states to 12219 states and 20227 transitions. [2024-10-11 04:28:33,124 INFO L78 Accepts]: Start accepts. Automaton has 12219 states and 20227 transitions. Word has length 151 [2024-10-11 04:28:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:33,124 INFO L471 AbstractCegarLoop]: Abstraction has 12219 states and 20227 transitions. [2024-10-11 04:28:33,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 12219 states and 20227 transitions. [2024-10-11 04:28:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:28:33,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:33,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:33,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:28:33,131 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:33,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:33,132 INFO L85 PathProgramCache]: Analyzing trace with hash -443546934, now seen corresponding path program 1 times [2024-10-11 04:28:33,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:33,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008274352] [2024-10-11 04:28:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:33,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:33,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:33,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:33,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:33,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:33,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:33,300 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-11 04:28:33,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:33,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008274352] [2024-10-11 04:28:33,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008274352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:33,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:33,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:33,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612274552] [2024-10-11 04:28:33,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:33,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:33,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:33,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:33,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:33,302 INFO L87 Difference]: Start difference. First operand 12219 states and 20227 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:35,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:35,379 INFO L93 Difference]: Finished difference Result 25682 states and 42532 transitions. [2024-10-11 04:28:35,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:28:35,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:28:35,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:35,422 INFO L225 Difference]: With dead ends: 25682 [2024-10-11 04:28:35,423 INFO L226 Difference]: Without dead ends: 15601 [2024-10-11 04:28:35,452 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-11 04:28:35,452 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 4956 mSDsluCounter, 16550 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4975 SdHoareTripleChecker+Valid, 20742 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:35,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4975 Valid, 20742 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:28:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15601 states. [2024-10-11 04:28:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15601 to 12219. [2024-10-11 04:28:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12219 states, 11322 states have (on average 1.641847730083024) internal successors, (18589), 11356 states have internal predecessors, (18589), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-11 04:28:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12219 states to 12219 states and 20194 transitions. [2024-10-11 04:28:36,328 INFO L78 Accepts]: Start accepts. Automaton has 12219 states and 20194 transitions. Word has length 151 [2024-10-11 04:28:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:36,329 INFO L471 AbstractCegarLoop]: Abstraction has 12219 states and 20194 transitions. [2024-10-11 04:28:36,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 12219 states and 20194 transitions. [2024-10-11 04:28:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:28:36,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:36,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:36,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:28:36,335 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:36,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:36,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1536182136, now seen corresponding path program 1 times [2024-10-11 04:28:36,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:36,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195432812] [2024-10-11 04:28:36,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:36,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:36,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:36,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:36,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:36,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:36,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:36,644 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-11 04:28:36,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:36,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195432812] [2024-10-11 04:28:36,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195432812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:36,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:36,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:36,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219046302] [2024-10-11 04:28:36,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:36,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:36,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:36,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:36,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:36,647 INFO L87 Difference]: Start difference. First operand 12219 states and 20194 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:41,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:41,098 INFO L93 Difference]: Finished difference Result 42673 states and 69999 transitions. [2024-10-11 04:28:41,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:28:41,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:28:41,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:41,189 INFO L225 Difference]: With dead ends: 42673 [2024-10-11 04:28:41,190 INFO L226 Difference]: Without dead ends: 32592 [2024-10-11 04:28:41,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:28:41,216 INFO L432 NwaCegarLoop]: 4386 mSDtfsCounter, 5714 mSDsluCounter, 17251 mSDsCounter, 0 mSdLazyCounter, 3253 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5744 SdHoareTripleChecker+Valid, 21637 SdHoareTripleChecker+Invalid, 3317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:41,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5744 Valid, 21637 Invalid, 3317 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 3253 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 04:28:41,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32592 states. [2024-10-11 04:28:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32592 to 22005. [2024-10-11 04:28:42,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22005 states, 20276 states have (on average 1.617330834484119) internal successors, (32793), 20342 states have internal predecessors, (32793), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 454 states have return successors, (2066), 1336 states have call predecessors, (2066), 1273 states have call successors, (2066) [2024-10-11 04:28:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22005 states to 22005 states and 36132 transitions. [2024-10-11 04:28:42,540 INFO L78 Accepts]: Start accepts. Automaton has 22005 states and 36132 transitions. Word has length 151 [2024-10-11 04:28:42,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:42,541 INFO L471 AbstractCegarLoop]: Abstraction has 22005 states and 36132 transitions. [2024-10-11 04:28:42,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 22005 states and 36132 transitions. [2024-10-11 04:28:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:28:42,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:42,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:42,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:28:42,571 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:42,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:42,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1476612874, now seen corresponding path program 1 times [2024-10-11 04:28:42,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:42,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189046763] [2024-10-11 04:28:42,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:42,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:42,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:42,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:42,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:43,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:43,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:43,021 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-11 04:28:43,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189046763] [2024-10-11 04:28:43,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189046763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:43,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:43,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:43,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140314481] [2024-10-11 04:28:43,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:43,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:43,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:43,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:43,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:43,023 INFO L87 Difference]: Start difference. First operand 22005 states and 36132 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:49,686 INFO L93 Difference]: Finished difference Result 81465 states and 133999 transitions. [2024-10-11 04:28:49,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:28:49,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:28:49,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:49,929 INFO L225 Difference]: With dead ends: 81465 [2024-10-11 04:28:49,929 INFO L226 Difference]: Without dead ends: 61598 [2024-10-11 04:28:49,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:28:50,000 INFO L432 NwaCegarLoop]: 4385 mSDtfsCounter, 5411 mSDsluCounter, 17248 mSDsCounter, 0 mSdLazyCounter, 3855 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5428 SdHoareTripleChecker+Valid, 21633 SdHoareTripleChecker+Invalid, 3918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:50,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5428 Valid, 21633 Invalid, 3918 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3855 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 04:28:50,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61598 states. [2024-10-11 04:28:52,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61598 to 41254. [2024-10-11 04:28:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41254 states, 37893 states have (on average 1.603119309635025) internal successors, (60747), 38023 states have internal predecessors, (60747), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 902 states have return successors, (4772), 2584 states have call predecessors, (4772), 2457 states have call successors, (4772) [2024-10-11 04:28:52,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41254 states to 41254 states and 67976 transitions. [2024-10-11 04:28:52,622 INFO L78 Accepts]: Start accepts. Automaton has 41254 states and 67976 transitions. Word has length 151 [2024-10-11 04:28:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:52,623 INFO L471 AbstractCegarLoop]: Abstraction has 41254 states and 67976 transitions. [2024-10-11 04:28:52,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:28:52,623 INFO L276 IsEmpty]: Start isEmpty. Operand 41254 states and 67976 transitions. [2024-10-11 04:28:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:28:52,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:52,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:52,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:28:52,641 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:52,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash -365862840, now seen corresponding path program 1 times [2024-10-11 04:28:52,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:52,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84058197] [2024-10-11 04:28:52,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:52,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:52,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:52,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:28:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:52,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:28:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:52,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:28:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:52,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:28:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:52,862 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-11 04:28:52,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:52,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84058197] [2024-10-11 04:28:52,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84058197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:52,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:52,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:52,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651711691] [2024-10-11 04:28:52,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:52,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:52,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:52,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:52,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:52,864 INFO L87 Difference]: Start difference. First operand 41254 states and 67976 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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)