./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_label43+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_label43+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 f02c38ef7caa0913e815c21ae4fcfcf6b07193a4f02fe1bf68067d0ca7ac604d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:17:10,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:17:10,441 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:17:10,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:17:10,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:17:10,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:17:10,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:17:10,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:17:10,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:17:10,477 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:17:10,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:17:10,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:17:10,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:17:10,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:17:10,479 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:17:10,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:17:10,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:17:10,479 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:17:10,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:17:10,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:17:10,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:17:10,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:17:10,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:17:10,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:17:10,482 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:17:10,482 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:17:10,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:17:10,483 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:17:10,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:17:10,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:17:10,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:17:10,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:17:10,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:17:10,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:17:10,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:17:10,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:17:10,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:17:10,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:17:10,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:17:10,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:17:10,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:17:10,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:17:10,487 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 -> f02c38ef7caa0913e815c21ae4fcfcf6b07193a4f02fe1bf68067d0ca7ac604d [2024-10-11 04:17:10,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:17:10,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:17:10,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:17:10,728 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:17:10,729 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:17:10,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.11.cil-2.c [2024-10-11 04:17:12,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:17:12,885 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:17:12,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.11.cil-2.c [2024-10-11 04:17:12,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2e2268e27/26e6385d4b1940b89fba6928757faf54/FLAGd2a3fa4b6 [2024-10-11 04:17:12,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2e2268e27/26e6385d4b1940b89fba6928757faf54 [2024-10-11 04:17:12,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:17:12,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:17:12,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:17:12,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:17:12,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:17:12,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:17:12" (1/1) ... [2024-10-11 04:17:12,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534ed540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:17:12, skipping insertion in model container [2024-10-11 04:17:12,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:17:12" (1/1) ... [2024-10-11 04:17:13,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:17:14,712 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_label43+token_ring.11.cil-2.c[381679,381692] [2024-10-11 04:17:14,735 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_label43+token_ring.11.cil-2.c[383339,383352] [2024-10-11 04:17:14,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:17:15,003 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:17:15,688 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_label43+token_ring.11.cil-2.c[381679,381692] [2024-10-11 04:17:15,693 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_label43+token_ring.11.cil-2.c[383339,383352] [2024-10-11 04:17:15,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:17:15,780 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:17:15,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:17:15 WrapperNode [2024-10-11 04:17:15,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:17:15,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:17:15,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:17:15,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:17:15,798 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:17:15" (1/1) ... [2024-10-11 04:17:15,935 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:17:15" (1/1) ... [2024-10-11 04:17:16,294 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13173 [2024-10-11 04:17:16,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:17:16,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:17:16,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:17:16,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:17:16,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:17:15" (1/1) ... [2024-10-11 04:17:16,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:17:15" (1/1) ... [2024-10-11 04:17:16,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:17:15" (1/1) ... [2024-10-11 04:17:16,477 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:17:16,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:17:15" (1/1) ... [2024-10-11 04:17:16,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:17:15" (1/1) ... [2024-10-11 04:17:16,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:17:15" (1/1) ... [2024-10-11 04:17:16,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:17:15" (1/1) ... [2024-10-11 04:17:16,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:17:15" (1/1) ... [2024-10-11 04:17:16,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:17:15" (1/1) ... [2024-10-11 04:17:16,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:17:16,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:17:16,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:17:16,931 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:17:16,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:17:15" (1/1) ... [2024-10-11 04:17:16,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:17:16,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:17:16,966 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:17:17,087 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:17:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:17:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:17:17,127 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:17:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:17:17,129 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:17:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:17:17,129 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:17:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:17:17,130 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:17:17,130 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:17:17,130 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:17:17,130 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:17:17,130 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:17:17,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:17:17,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:17:17,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:17:17,267 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:17:17,270 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:17:24,524 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2024-10-11 04:17:24,524 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:17:24,640 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:17:24,640 INFO L314 CfgBuilder]: Removed 15 assume(true) statements. [2024-10-11 04:17:24,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:17:24 BoogieIcfgContainer [2024-10-11 04:17:24,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:17:24,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:17:24,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:17:24,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:17:24,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:17:12" (1/3) ... [2024-10-11 04:17:24,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23aab77f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:17:24, skipping insertion in model container [2024-10-11 04:17:24,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:17:15" (2/3) ... [2024-10-11 04:17:24,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23aab77f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:17:24, skipping insertion in model container [2024-10-11 04:17:24,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:17:24" (3/3) ... [2024-10-11 04:17:24,651 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.11.cil-2.c [2024-10-11 04:17:24,674 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:17:24,677 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:17:24,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:17:24,773 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;@483841c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:17:24,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:17:24,792 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:17:24,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:17:24,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:24,815 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:17:24,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:24,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:24,825 INFO L85 PathProgramCache]: Analyzing trace with hash -259596153, now seen corresponding path program 1 times [2024-10-11 04:17:24,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:24,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477813785] [2024-10-11 04:17:24,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:24,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:17:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:17:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:17:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:17:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,414 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:17:25,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477813785] [2024-10-11 04:17:25,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477813785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:25,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:25,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:17:25,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722142164] [2024-10-11 04:17:25,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:25,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:17:25,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:25,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:17:25,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:17:25,460 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:17:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:27,458 INFO L93 Difference]: Finished difference Result 5006 states and 9354 transitions. [2024-10-11 04:17:27,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:17:27,461 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:17:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:27,497 INFO L225 Difference]: With dead ends: 5006 [2024-10-11 04:17:27,497 INFO L226 Difference]: Without dead ends: 2564 [2024-10-11 04:17:27,507 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:17:27,512 INFO L432 NwaCegarLoop]: 4238 mSDtfsCounter, 902 mSDsluCounter, 12182 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:27,514 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.4s Time] [2024-10-11 04:17:27,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-10-11 04:17:27,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2444. [2024-10-11 04:17:27,672 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:17:27,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 4482 transitions. [2024-10-11 04:17:27,684 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 4482 transitions. Word has length 151 [2024-10-11 04:17:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:27,685 INFO L471 AbstractCegarLoop]: Abstraction has 2444 states and 4482 transitions. [2024-10-11 04:17:27,685 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:17:27,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 4482 transitions. [2024-10-11 04:17:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:17:27,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:27,689 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:17:27,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:17:27,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:27,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:27,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1876287049, now seen corresponding path program 1 times [2024-10-11 04:17:27,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:27,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178816886] [2024-10-11 04:17:27,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:27,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:27,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:27,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:17:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:28,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:17:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:17:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:28,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:17:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:28,066 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:17:28,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:28,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178816886] [2024-10-11 04:17:28,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178816886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:28,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:28,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:17:28,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993212339] [2024-10-11 04:17:28,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:28,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:17:28,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:28,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:17:28,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:17:28,073 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:17:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:31,125 INFO L93 Difference]: Finished difference Result 3313 states and 5934 transitions. [2024-10-11 04:17:31,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:17:31,125 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:17:31,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:31,142 INFO L225 Difference]: With dead ends: 3313 [2024-10-11 04:17:31,143 INFO L226 Difference]: Without dead ends: 3007 [2024-10-11 04:17:31,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:17:31,148 INFO L432 NwaCegarLoop]: 4252 mSDtfsCounter, 5325 mSDsluCounter, 12699 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5343 SdHoareTripleChecker+Valid, 16951 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:31,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5343 Valid, 16951 Invalid, 2279 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [104 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 04:17:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-10-11 04:17:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2768. [2024-10-11 04:17:31,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:17:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 5014 transitions. [2024-10-11 04:17:31,250 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 5014 transitions. Word has length 151 [2024-10-11 04:17:31,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:31,250 INFO L471 AbstractCegarLoop]: Abstraction has 2768 states and 5014 transitions. [2024-10-11 04:17:31,250 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:17:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 5014 transitions. [2024-10-11 04:17:31,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:17:31,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:31,253 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:17:31,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:17:31,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:31,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:31,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1755061197, now seen corresponding path program 1 times [2024-10-11 04:17:31,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:31,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118322249] [2024-10-11 04:17:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:31,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:31,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:31,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:17:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:31,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:17:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:31,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:17:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:31,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:17:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:31,676 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:17:31,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:31,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118322249] [2024-10-11 04:17:31,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118322249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:31,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:31,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:31,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732370678] [2024-10-11 04:17:31,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:31,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:31,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:31,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:31,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:31,683 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:17:35,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:35,447 INFO L93 Difference]: Finished difference Result 4098 states and 7236 transitions. [2024-10-11 04:17:35,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:17:35,449 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:17:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:35,481 INFO L225 Difference]: With dead ends: 4098 [2024-10-11 04:17:35,485 INFO L226 Difference]: Without dead ends: 3468 [2024-10-11 04:17:35,493 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:17:35,494 INFO L432 NwaCegarLoop]: 4390 mSDtfsCounter, 5356 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3461 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:35,498 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.9s Time] [2024-10-11 04:17:35,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2024-10-11 04:17:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3067. [2024-10-11 04:17:35,619 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:17:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 5495 transitions. [2024-10-11 04:17:35,631 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 5495 transitions. Word has length 151 [2024-10-11 04:17:35,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:35,632 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 5495 transitions. [2024-10-11 04:17:35,633 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:17:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 5495 transitions. [2024-10-11 04:17:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:17:35,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:35,635 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:17:35,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:17:35,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:35,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:35,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1864745973, now seen corresponding path program 1 times [2024-10-11 04:17:35,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:35,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936623361] [2024-10-11 04:17:35,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:35,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:35,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:35,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:17:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:35,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:17:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:35,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:17:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:35,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:17:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:35,995 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:17:35,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:35,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936623361] [2024-10-11 04:17:35,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936623361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:35,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:35,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:35,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601180740] [2024-10-11 04:17:35,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:35,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:35,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:35,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:36,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:36,000 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:17:40,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:40,266 INFO L93 Difference]: Finished difference Result 5248 states and 9131 transitions. [2024-10-11 04:17:40,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:17:40,266 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:17:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:40,286 INFO L225 Difference]: With dead ends: 5248 [2024-10-11 04:17:40,286 INFO L226 Difference]: Without dead ends: 4319 [2024-10-11 04:17:40,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:17:40,292 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5354 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3457 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:40,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5372 Valid, 21644 Invalid, 3518 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 3457 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 04:17:40,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2024-10-11 04:17:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 3666. [2024-10-11 04:17:40,472 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:17:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6462 transitions. [2024-10-11 04:17:40,493 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6462 transitions. Word has length 151 [2024-10-11 04:17:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:40,493 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6462 transitions. [2024-10-11 04:17:40,493 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:17:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6462 transitions. [2024-10-11 04:17:40,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:17:40,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:40,498 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:17:40,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:17:40,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:40,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1482169357, now seen corresponding path program 1 times [2024-10-11 04:17:40,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:40,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859491977] [2024-10-11 04:17:40,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:40,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:40,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:40,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:17:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:40,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:17:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:17:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:40,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:17:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:40,849 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:17:40,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:40,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859491977] [2024-10-11 04:17:40,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859491977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:40,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:40,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:40,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796141352] [2024-10-11 04:17:40,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:40,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:40,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:40,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:40,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:40,853 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:17:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:43,246 INFO L93 Difference]: Finished difference Result 5837 states and 10091 transitions. [2024-10-11 04:17:43,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:43,246 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:17:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:43,266 INFO L225 Difference]: With dead ends: 5837 [2024-10-11 04:17:43,267 INFO L226 Difference]: Without dead ends: 4309 [2024-10-11 04:17:43,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:17:43,274 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 4957 mSDsluCounter, 16550 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:43,274 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.8s Time] [2024-10-11 04:17:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2024-10-11 04:17:43,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 3666. [2024-10-11 04:17:43,395 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:17:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6457 transitions. [2024-10-11 04:17:43,405 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6457 transitions. Word has length 151 [2024-10-11 04:17:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:43,406 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6457 transitions. [2024-10-11 04:17:43,406 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:17:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6457 transitions. [2024-10-11 04:17:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:17:43,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:43,409 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:17:43,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:17:43,409 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:43,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:43,409 INFO L85 PathProgramCache]: Analyzing trace with hash 897397707, now seen corresponding path program 1 times [2024-10-11 04:17:43,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:43,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337959603] [2024-10-11 04:17:43,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:43,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:43,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:43,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:17:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:43,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:17:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:43,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:17:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:43,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:17:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:43,681 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:17:43,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:43,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337959603] [2024-10-11 04:17:43,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337959603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:43,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:43,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:43,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90577852] [2024-10-11 04:17:43,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:43,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:43,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:43,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:43,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:43,684 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:17:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:45,343 INFO L93 Difference]: Finished difference Result 5831 states and 10065 transitions. [2024-10-11 04:17:45,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:45,344 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:17:45,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:45,366 INFO L225 Difference]: With dead ends: 5831 [2024-10-11 04:17:45,366 INFO L226 Difference]: Without dead ends: 4303 [2024-10-11 04:17:45,374 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:17:45,377 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 5096 mSDsluCounter, 12441 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:45,377 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.2s Time] [2024-10-11 04:17:45,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states. [2024-10-11 04:17:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 3666. [2024-10-11 04:17:45,510 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:17:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6452 transitions. [2024-10-11 04:17:45,526 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6452 transitions. Word has length 151 [2024-10-11 04:17:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:45,527 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6452 transitions. [2024-10-11 04:17:45,528 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:17:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6452 transitions. [2024-10-11 04:17:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:17:45,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:45,530 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:17:45,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:17:45,531 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:45,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash 462892109, now seen corresponding path program 1 times [2024-10-11 04:17:45,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:45,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32120149] [2024-10-11 04:17:45,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:45,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:45,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:45,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:17:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:45,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:17:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:45,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:17:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:17:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:45,944 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:17:45,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:45,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32120149] [2024-10-11 04:17:45,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32120149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:45,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:45,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:45,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529885390] [2024-10-11 04:17:45,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:45,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:45,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:45,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:45,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:45,947 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:17:47,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:47,682 INFO L93 Difference]: Finished difference Result 5824 states and 10037 transitions. [2024-10-11 04:17:47,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:47,683 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:17:47,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:47,697 INFO L225 Difference]: With dead ends: 5824 [2024-10-11 04:17:47,697 INFO L226 Difference]: Without dead ends: 4296 [2024-10-11 04:17:47,705 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:17:47,705 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 5100 mSDsluCounter, 12441 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:47,706 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.3s Time] [2024-10-11 04:17:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2024-10-11 04:17:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3666. [2024-10-11 04:17:47,854 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:17:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6447 transitions. [2024-10-11 04:17:47,861 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6447 transitions. Word has length 151 [2024-10-11 04:17:47,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:47,861 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6447 transitions. [2024-10-11 04:17:47,861 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:17:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6447 transitions. [2024-10-11 04:17:47,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:17:47,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:47,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:47,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:17:47,864 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:47,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:47,865 INFO L85 PathProgramCache]: Analyzing trace with hash 33233803, now seen corresponding path program 1 times [2024-10-11 04:17:47,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:47,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575883046] [2024-10-11 04:17:47,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:47,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:47,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:48,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:17:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:48,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:17:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:48,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:17:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:48,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:17:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:48,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:17:48,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:48,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575883046] [2024-10-11 04:17:48,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575883046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:48,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:48,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:48,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550747546] [2024-10-11 04:17:48,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:48,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:48,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:48,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:48,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:48,153 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:17:49,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:49,856 INFO L93 Difference]: Finished difference Result 5812 states and 9999 transitions. [2024-10-11 04:17:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:49,857 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:17:49,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:49,874 INFO L225 Difference]: With dead ends: 5812 [2024-10-11 04:17:49,875 INFO L226 Difference]: Without dead ends: 4284 [2024-10-11 04:17:49,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:17:49,882 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 5096 mSDsluCounter, 12441 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:49,882 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.0s Time] [2024-10-11 04:17:49,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2024-10-11 04:17:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 3666. [2024-10-11 04:17:50,017 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:17:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6442 transitions. [2024-10-11 04:17:50,026 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6442 transitions. Word has length 151 [2024-10-11 04:17:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:50,027 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6442 transitions. [2024-10-11 04:17:50,027 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:17:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6442 transitions. [2024-10-11 04:17:50,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:17:50,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:50,029 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:17:50,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:17:50,030 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:50,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:50,031 INFO L85 PathProgramCache]: Analyzing trace with hash 980271689, now seen corresponding path program 1 times [2024-10-11 04:17:50,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:50,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755027132] [2024-10-11 04:17:50,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:50,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:50,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:50,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:17:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:50,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:17:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:50,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:17:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:50,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:17:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:50,274 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:17:50,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:50,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755027132] [2024-10-11 04:17:50,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755027132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:50,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:50,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:50,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686986008] [2024-10-11 04:17:50,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:50,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:50,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:50,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:50,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:50,277 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:17:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:54,008 INFO L93 Difference]: Finished difference Result 7418 states and 12588 transitions. [2024-10-11 04:17:54,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:17:54,008 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:17:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:54,058 INFO L225 Difference]: With dead ends: 7418 [2024-10-11 04:17:54,062 INFO L226 Difference]: Without dead ends: 5890 [2024-10-11 04:17:54,074 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:17:54,079 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5325 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3327 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:54,079 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.7s Time] [2024-10-11 04:17:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5890 states. [2024-10-11 04:17:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5890 to 4887. [2024-10-11 04:17:54,699 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:17:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 8397 transitions. [2024-10-11 04:17:54,729 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 8397 transitions. Word has length 151 [2024-10-11 04:17:54,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:54,729 INFO L471 AbstractCegarLoop]: Abstraction has 4887 states and 8397 transitions. [2024-10-11 04:17:54,729 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:17:54,730 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 8397 transitions. [2024-10-11 04:17:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:17:54,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:54,737 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:17:54,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:17:54,737 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:54,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:54,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1842105291, now seen corresponding path program 1 times [2024-10-11 04:17:54,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:54,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533398501] [2024-10-11 04:17:54,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:54,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:54,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:55,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:17:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:55,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:17:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:55,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:17:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:55,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:17:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:55,113 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:17:55,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:55,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533398501] [2024-10-11 04:17:55,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533398501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:55,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:55,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:55,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671791041] [2024-10-11 04:17:55,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:55,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:55,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:55,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:55,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:55,116 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:17:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:58,778 INFO L93 Difference]: Finished difference Result 11823 states and 19739 transitions. [2024-10-11 04:17:58,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:17:58,779 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:17:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:58,849 INFO L225 Difference]: With dead ends: 11823 [2024-10-11 04:17:58,849 INFO L226 Difference]: Without dead ends: 9074 [2024-10-11 04:17:58,875 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:17:58,876 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5324 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3314 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:58,877 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.6s Time] [2024-10-11 04:17:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9074 states. [2024-10-11 04:17:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9074 to 7326. [2024-10-11 04:17:59,318 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:17:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 12315 transitions. [2024-10-11 04:17:59,331 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 12315 transitions. Word has length 151 [2024-10-11 04:17:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:59,331 INFO L471 AbstractCegarLoop]: Abstraction has 7326 states and 12315 transitions. [2024-10-11 04:17:59,331 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:17:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 12315 transitions. [2024-10-11 04:17:59,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:17:59,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:59,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:17:59,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:17:59,335 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:59,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:59,336 INFO L85 PathProgramCache]: Analyzing trace with hash -208303607, now seen corresponding path program 1 times [2024-10-11 04:17:59,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:59,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184553750] [2024-10-11 04:17:59,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:59,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:59,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:59,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:17:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:59,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:17:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:59,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:17:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:59,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:17:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:59,511 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:17:59,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:59,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184553750] [2024-10-11 04:17:59,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184553750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:59,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:59,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:59,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105841467] [2024-10-11 04:17:59,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:59,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:59,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:59,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:59,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:59,513 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:18:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:03,676 INFO L93 Difference]: Finished difference Result 20624 states and 34083 transitions. [2024-10-11 04:18:03,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:18:03,677 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:18:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:03,726 INFO L225 Difference]: With dead ends: 20624 [2024-10-11 04:18:03,727 INFO L226 Difference]: Without dead ends: 15436 [2024-10-11 04:18:03,748 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:18:03,749 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5323 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3301 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5341 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:03,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5341 Valid, 21644 Invalid, 3362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3301 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:18:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15436 states. [2024-10-11 04:18:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15436 to 12219. [2024-10-11 04:18:04,596 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:18:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12219 states to 12219 states and 20227 transitions. [2024-10-11 04:18:04,637 INFO L78 Accepts]: Start accepts. Automaton has 12219 states and 20227 transitions. Word has length 151 [2024-10-11 04:18:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:04,638 INFO L471 AbstractCegarLoop]: Abstraction has 12219 states and 20227 transitions. [2024-10-11 04:18:04,638 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:18:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 12219 states and 20227 transitions. [2024-10-11 04:18:04,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:18:04,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:04,646 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:18:04,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:18:04,647 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:04,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:04,647 INFO L85 PathProgramCache]: Analyzing trace with hash 279743499, now seen corresponding path program 1 times [2024-10-11 04:18:04,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:04,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630310161] [2024-10-11 04:18:04,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:04,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:04,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:04,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:18:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:04,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:18:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:04,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:18:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:05,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:18:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:05,004 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:18:05,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:05,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630310161] [2024-10-11 04:18:05,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630310161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:05,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:05,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:18:05,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651953804] [2024-10-11 04:18:05,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:05,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:18:05,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:05,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:18:05,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:18:05,007 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:18:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:07,447 INFO L93 Difference]: Finished difference Result 25682 states and 42532 transitions. [2024-10-11 04:18:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:18:07,448 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:18:07,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:07,549 INFO L225 Difference]: With dead ends: 25682 [2024-10-11 04:18:07,553 INFO L226 Difference]: Without dead ends: 15601 [2024-10-11 04:18:07,616 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:18:07,617 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.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:07,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4975 Valid, 20742 Invalid, 1725 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:18:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15601 states. [2024-10-11 04:18:08,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15601 to 12219. [2024-10-11 04:18:08,858 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:18:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12219 states to 12219 states and 20194 transitions. [2024-10-11 04:18:08,933 INFO L78 Accepts]: Start accepts. Automaton has 12219 states and 20194 transitions. Word has length 151 [2024-10-11 04:18:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:08,939 INFO L471 AbstractCegarLoop]: Abstraction has 12219 states and 20194 transitions. [2024-10-11 04:18:08,939 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:18:08,939 INFO L276 IsEmpty]: Start isEmpty. Operand 12219 states and 20194 transitions. [2024-10-11 04:18:08,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:18:08,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:08,960 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:18:08,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:18:08,961 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:08,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:08,961 INFO L85 PathProgramCache]: Analyzing trace with hash -812891703, now seen corresponding path program 1 times [2024-10-11 04:18:08,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:08,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096911263] [2024-10-11 04:18:08,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:08,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:09,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:09,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:18:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:09,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:18:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:09,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:18:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:09,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:18:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:09,488 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:18:09,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:09,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096911263] [2024-10-11 04:18:09,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096911263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:09,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:09,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:18:09,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626189152] [2024-10-11 04:18:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:09,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:18:09,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:09,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:18:09,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:18:09,494 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:18:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:14,525 INFO L93 Difference]: Finished difference Result 42673 states and 69999 transitions. [2024-10-11 04:18:14,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:18:14,526 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:18:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:14,690 INFO L225 Difference]: With dead ends: 42673 [2024-10-11 04:18:14,691 INFO L226 Difference]: Without dead ends: 32592 [2024-10-11 04:18:14,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:18:14,718 INFO L432 NwaCegarLoop]: 4386 mSDtfsCounter, 5714 mSDsluCounter, 17251 mSDsCounter, 0 mSdLazyCounter, 3253 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5744 SdHoareTripleChecker+Valid, 21637 SdHoareTripleChecker+Invalid, 3317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:14,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5744 Valid, 21637 Invalid, 3317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3253 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:18:14,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32592 states. [2024-10-11 04:18:16,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32592 to 22005. [2024-10-11 04:18:16,287 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:18:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22005 states to 22005 states and 36132 transitions. [2024-10-11 04:18:16,360 INFO L78 Accepts]: Start accepts. Automaton has 22005 states and 36132 transitions. Word has length 151 [2024-10-11 04:18:16,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:16,360 INFO L471 AbstractCegarLoop]: Abstraction has 22005 states and 36132 transitions. [2024-10-11 04:18:16,361 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:18:16,361 INFO L276 IsEmpty]: Start isEmpty. Operand 22005 states and 36132 transitions. [2024-10-11 04:18:16,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:18:16,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:16,374 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:18:16,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:18:16,375 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:16,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:16,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2095063989, now seen corresponding path program 1 times [2024-10-11 04:18:16,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:16,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660472767] [2024-10-11 04:18:16,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:16,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:16,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:16,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:18:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:16,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:18:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:16,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:18:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:16,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:18:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:16,622 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:18:16,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:16,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660472767] [2024-10-11 04:18:16,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660472767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:16,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:16,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:18:16,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418906285] [2024-10-11 04:18:16,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:16,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:18:16,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:16,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:18:16,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:18:16,624 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:18:24,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:24,238 INFO L93 Difference]: Finished difference Result 81465 states and 133999 transitions. [2024-10-11 04:18:24,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:18:24,239 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:18:24,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:24,445 INFO L225 Difference]: With dead ends: 81465 [2024-10-11 04:18:24,445 INFO L226 Difference]: Without dead ends: 61598 [2024-10-11 04:18:24,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:18:24,502 INFO L432 NwaCegarLoop]: 4385 mSDtfsCounter, 5411 mSDsluCounter, 17248 mSDsCounter, 0 mSdLazyCounter, 3855 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:24,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5428 Valid, 21633 Invalid, 3918 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3855 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 04:18:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61598 states. [2024-10-11 04:18:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61598 to 41254. [2024-10-11 04:18:27,524 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:18:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41254 states to 41254 states and 67976 transitions. [2024-10-11 04:18:27,698 INFO L78 Accepts]: Start accepts. Automaton has 41254 states and 67976 transitions. Word has length 151 [2024-10-11 04:18:27,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:27,698 INFO L471 AbstractCegarLoop]: Abstraction has 41254 states and 67976 transitions. [2024-10-11 04:18:27,699 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:18:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 41254 states and 67976 transitions. [2024-10-11 04:18:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:18:27,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:27,742 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:18:27,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:18:27,743 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:27,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:27,743 INFO L85 PathProgramCache]: Analyzing trace with hash 357427593, now seen corresponding path program 1 times [2024-10-11 04:18:27,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:27,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847189875] [2024-10-11 04:18:27,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:27,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:27,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:27,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:18:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:28,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:18:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:28,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:18:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:18:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:28,046 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:18:28,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:28,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847189875] [2024-10-11 04:18:28,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847189875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:28,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:28,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:18:28,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495155867] [2024-10-11 04:18:28,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:28,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:18:28,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:28,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:18:28,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:18:28,051 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)