./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/pc_sfifo_1.cil-2+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a145625a0fe2baedf73b7a84d58038ade27f8470c6f09a0f78d8ec75fe662acb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:09:03,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:09:03,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:09:03,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:09:03,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:09:03,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:09:03,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:09:03,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:09:03,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:09:03,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:09:03,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:09:03,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:09:03,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:09:03,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:09:03,445 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:09:03,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:09:03,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:09:03,450 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:09:03,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:09:03,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:09:03,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:09:03,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:09:03,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:09:03,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:09:03,454 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:09:03,454 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:09:03,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:09:03,455 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:09:03,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:09:03,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:09:03,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:09:03,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:09:03,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:09:03,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:09:03,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:09:03,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:09:03,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:09:03,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:09:03,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:09:03,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:09:03,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:09:03,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:09:03,458 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a145625a0fe2baedf73b7a84d58038ade27f8470c6f09a0f78d8ec75fe662acb [2024-10-14 05:09:03,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:09:03,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:09:03,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:09:03,683 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:09:03,684 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:09:03,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2024-10-14 05:09:04,893 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:09:05,052 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:09:05,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2024-10-14 05:09:05,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f1850cd4/e105a67e4c614a37b18ae542e2413a6c/FLAG689531e7f [2024-10-14 05:09:05,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f1850cd4/e105a67e4c614a37b18ae542e2413a6c [2024-10-14 05:09:05,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:09:05,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:09:05,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:09:05,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:09:05,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:09:05,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:09:05" (1/1) ... [2024-10-14 05:09:05,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517e6c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:05, skipping insertion in model container [2024-10-14 05:09:05,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:09:05" (1/1) ... [2024-10-14 05:09:05,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:09:05,229 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/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[913,926] [2024-10-14 05:09:05,273 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/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[5977,5990] [2024-10-14 05:09:05,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:09:05,316 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:09:05,325 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/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[913,926] [2024-10-14 05:09:05,337 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/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[5977,5990] [2024-10-14 05:09:05,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:09:05,371 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:09:05,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:05 WrapperNode [2024-10-14 05:09:05,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:09:05,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:09:05,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:09:05,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:09:05,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:05" (1/1) ... [2024-10-14 05:09:05,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:05" (1/1) ... [2024-10-14 05:09:05,431 INFO L138 Inliner]: procedures = 52, calls = 55, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 489 [2024-10-14 05:09:05,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:09:05,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:09:05,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:09:05,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:09:05,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:05" (1/1) ... [2024-10-14 05:09:05,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:05" (1/1) ... [2024-10-14 05:09:05,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:05" (1/1) ... [2024-10-14 05:09:05,464 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-14 05:09:05,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:05" (1/1) ... [2024-10-14 05:09:05,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:05" (1/1) ... [2024-10-14 05:09:05,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:05" (1/1) ... [2024-10-14 05:09:05,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:05" (1/1) ... [2024-10-14 05:09:05,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:05" (1/1) ... [2024-10-14 05:09:05,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:05" (1/1) ... [2024-10-14 05:09:05,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:09:05,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:09:05,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:09:05,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:09:05,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:05" (1/1) ... [2024-10-14 05:09:05,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:09:05,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:05,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:09:05,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:09:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:09:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:09:05,551 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:09:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-14 05:09:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-14 05:09:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:09:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:09:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:09:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:09:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:09:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:09:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:09:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:09:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:09:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:09:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:09:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:09:05,555 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:09:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:09:05,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:09:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:09:05,555 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:09:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-14 05:09:05,555 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-14 05:09:05,646 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:09:05,649 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:09:06,079 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-10-14 05:09:06,080 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:09:06,122 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:09:06,123 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-14 05:09:06,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:09:06 BoogieIcfgContainer [2024-10-14 05:09:06,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:09:06,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:09:06,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:09:06,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:09:06,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:09:05" (1/3) ... [2024-10-14 05:09:06,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbb16cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:09:06, skipping insertion in model container [2024-10-14 05:09:06,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:09:05" (2/3) ... [2024-10-14 05:09:06,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbb16cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:09:06, skipping insertion in model container [2024-10-14 05:09:06,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:09:06" (3/3) ... [2024-10-14 05:09:06,129 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2024-10-14 05:09:06,141 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:09:06,142 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:09:06,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:09:06,197 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;@198a9b82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:09:06,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:09:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 152 states have (on average 1.6644736842105263) internal successors, (253), 159 states have internal predecessors, (253), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 05:09:06,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 05:09:06,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:06,208 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] [2024-10-14 05:09:06,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:06,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash -338499711, now seen corresponding path program 1 times [2024-10-14 05:09:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:06,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155429697] [2024-10-14 05:09:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:06,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:06,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:09:06,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:06,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155429697] [2024-10-14 05:09:06,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155429697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:06,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:06,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:06,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239132356] [2024-10-14 05:09:06,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:06,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:06,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:06,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:06,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:06,527 INFO L87 Difference]: Start difference. First operand has 189 states, 152 states have (on average 1.6644736842105263) internal successors, (253), 159 states have internal predecessors, (253), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:09:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:06,869 INFO L93 Difference]: Finished difference Result 428 states and 686 transitions. [2024-10-14 05:09:06,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:06,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-14 05:09:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:06,884 INFO L225 Difference]: With dead ends: 428 [2024-10-14 05:09:06,887 INFO L226 Difference]: Without dead ends: 246 [2024-10-14 05:09:06,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:06,896 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 329 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:06,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 387 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 05:09:06,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-14 05:09:06,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2024-10-14 05:09:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 199 states have (on average 1.4974874371859297) internal successors, (298), 204 states have internal predecessors, (298), 28 states have call successors, (28), 12 states have call predecessors, (28), 11 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2024-10-14 05:09:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2024-10-14 05:09:06,961 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 37 [2024-10-14 05:09:06,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:06,962 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2024-10-14 05:09:06,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:09:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2024-10-14 05:09:06,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 05:09:06,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:06,966 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] [2024-10-14 05:09:06,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:09:06,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:06,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:06,968 INFO L85 PathProgramCache]: Analyzing trace with hash -740006344, now seen corresponding path program 1 times [2024-10-14 05:09:06,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:06,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614290964] [2024-10-14 05:09:06,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:06,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:07,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:07,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 05:09:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:07,072 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-14 05:09:07,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:07,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614290964] [2024-10-14 05:09:07,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614290964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:07,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:07,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:07,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560846150] [2024-10-14 05:09:07,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:07,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:07,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:07,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:07,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:07,077 INFO L87 Difference]: Start difference. First operand 240 states and 356 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:09:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:07,310 INFO L93 Difference]: Finished difference Result 474 states and 700 transitions. [2024-10-14 05:09:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:07,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-14 05:09:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:07,314 INFO L225 Difference]: With dead ends: 474 [2024-10-14 05:09:07,314 INFO L226 Difference]: Without dead ends: 363 [2024-10-14 05:09:07,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:07,319 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 342 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:07,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 377 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:09:07,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-14 05:09:07,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 340. [2024-10-14 05:09:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 286 states have (on average 1.4545454545454546) internal successors, (416), 292 states have internal predecessors, (416), 36 states have call successors, (36), 16 states have call predecessors, (36), 16 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2024-10-14 05:09:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 496 transitions. [2024-10-14 05:09:07,350 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 496 transitions. Word has length 38 [2024-10-14 05:09:07,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:07,350 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 496 transitions. [2024-10-14 05:09:07,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:09:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 496 transitions. [2024-10-14 05:09:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 05:09:07,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:07,354 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] [2024-10-14 05:09:07,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:09:07,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:07,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash 615283994, now seen corresponding path program 1 times [2024-10-14 05:09:07,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:07,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022536139] [2024-10-14 05:09:07,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:07,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:07,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 05:09:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:07,444 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-14 05:09:07,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:07,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022536139] [2024-10-14 05:09:07,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022536139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:07,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:07,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:07,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234007930] [2024-10-14 05:09:07,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:07,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:07,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:07,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:07,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:07,447 INFO L87 Difference]: Start difference. First operand 340 states and 496 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:09:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:07,698 INFO L93 Difference]: Finished difference Result 760 states and 1077 transitions. [2024-10-14 05:09:07,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:07,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-14 05:09:07,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:07,702 INFO L225 Difference]: With dead ends: 760 [2024-10-14 05:09:07,702 INFO L226 Difference]: Without dead ends: 549 [2024-10-14 05:09:07,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:07,704 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 157 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:07,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 508 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:09:07,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-10-14 05:09:07,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 445. [2024-10-14 05:09:07,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 379 states have (on average 1.437994722955145) internal successors, (545), 387 states have internal predecessors, (545), 42 states have call successors, (42), 22 states have call predecessors, (42), 22 states have return successors, (50), 36 states have call predecessors, (50), 38 states have call successors, (50) [2024-10-14 05:09:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 637 transitions. [2024-10-14 05:09:07,748 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 637 transitions. Word has length 39 [2024-10-14 05:09:07,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:07,748 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 637 transitions. [2024-10-14 05:09:07,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 05:09:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 637 transitions. [2024-10-14 05:09:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 05:09:07,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:07,754 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:07,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:09:07,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:07,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:07,755 INFO L85 PathProgramCache]: Analyzing trace with hash 723271528, now seen corresponding path program 1 times [2024-10-14 05:09:07,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:07,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041773675] [2024-10-14 05:09:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:07,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:07,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:07,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 05:09:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:07,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 05:09:07,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:07,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041773675] [2024-10-14 05:09:07,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041773675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:07,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:07,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:07,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499007895] [2024-10-14 05:09:07,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:07,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:07,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:07,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:07,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:07,854 INFO L87 Difference]: Start difference. First operand 445 states and 637 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:09:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:08,074 INFO L93 Difference]: Finished difference Result 961 states and 1354 transitions. [2024-10-14 05:09:08,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:08,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-14 05:09:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:08,079 INFO L225 Difference]: With dead ends: 961 [2024-10-14 05:09:08,079 INFO L226 Difference]: Without dead ends: 645 [2024-10-14 05:09:08,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:08,082 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 142 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:08,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 555 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:09:08,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-14 05:09:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 611. [2024-10-14 05:09:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 521 states have (on average 1.383877159309021) internal successors, (721), 531 states have internal predecessors, (721), 56 states have call successors, (56), 30 states have call predecessors, (56), 32 states have return successors, (74), 50 states have call predecessors, (74), 52 states have call successors, (74) [2024-10-14 05:09:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 851 transitions. [2024-10-14 05:09:08,122 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 851 transitions. Word has length 54 [2024-10-14 05:09:08,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:08,122 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 851 transitions. [2024-10-14 05:09:08,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:09:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 851 transitions. [2024-10-14 05:09:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:09:08,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:08,124 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:08,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:09:08,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:08,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:08,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1733403351, now seen corresponding path program 1 times [2024-10-14 05:09:08,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:08,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461831556] [2024-10-14 05:09:08,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:08,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:08,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:08,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:08,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:09:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 05:09:08,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:08,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461831556] [2024-10-14 05:09:08,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461831556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:08,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:08,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:08,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000816409] [2024-10-14 05:09:08,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:08,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:08,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:08,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:08,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:08,173 INFO L87 Difference]: Start difference. First operand 611 states and 851 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:09:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:08,366 INFO L93 Difference]: Finished difference Result 1190 states and 1630 transitions. [2024-10-14 05:09:08,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:08,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-14 05:09:08,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:08,370 INFO L225 Difference]: With dead ends: 1190 [2024-10-14 05:09:08,370 INFO L226 Difference]: Without dead ends: 788 [2024-10-14 05:09:08,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:08,372 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 328 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:08,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 389 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:09:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-10-14 05:09:08,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 739. [2024-10-14 05:09:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 633 states have (on average 1.3522906793048972) internal successors, (856), 645 states have internal predecessors, (856), 64 states have call successors, (64), 36 states have call predecessors, (64), 40 states have return successors, (88), 58 states have call predecessors, (88), 60 states have call successors, (88) [2024-10-14 05:09:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1008 transitions. [2024-10-14 05:09:08,414 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1008 transitions. Word has length 59 [2024-10-14 05:09:08,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:08,415 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1008 transitions. [2024-10-14 05:09:08,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:09:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1008 transitions. [2024-10-14 05:09:08,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:09:08,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:08,417 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:08,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:09:08,417 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:08,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:08,418 INFO L85 PathProgramCache]: Analyzing trace with hash -423574483, now seen corresponding path program 1 times [2024-10-14 05:09:08,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:08,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771535559] [2024-10-14 05:09:08,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:08,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:08,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:08,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:08,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:09:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 05:09:08,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:08,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771535559] [2024-10-14 05:09:08,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771535559] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:08,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268153442] [2024-10-14 05:09:08,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:08,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:08,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:08,531 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:08,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 05:09:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:08,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 05:09:08,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 05:09:08,657 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:08,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268153442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:08,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:08,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-14 05:09:08,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696896474] [2024-10-14 05:09:08,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:08,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:08,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:08,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:08,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:09:08,659 INFO L87 Difference]: Start difference. First operand 739 states and 1008 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:09:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:08,744 INFO L93 Difference]: Finished difference Result 1220 states and 1669 transitions. [2024-10-14 05:09:08,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:08,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-14 05:09:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:08,747 INFO L225 Difference]: With dead ends: 1220 [2024-10-14 05:09:08,748 INFO L226 Difference]: Without dead ends: 737 [2024-10-14 05:09:08,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:09:08,749 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 66 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:08,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 519 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-14 05:09:08,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 699. [2024-10-14 05:09:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 599 states have (on average 1.330550918196995) internal successors, (797), 611 states have internal predecessors, (797), 60 states have call successors, (60), 34 states have call predecessors, (60), 38 states have return successors, (82), 54 states have call predecessors, (82), 56 states have call successors, (82) [2024-10-14 05:09:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 939 transitions. [2024-10-14 05:09:08,779 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 939 transitions. Word has length 60 [2024-10-14 05:09:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:08,779 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 939 transitions. [2024-10-14 05:09:08,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:09:08,780 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 939 transitions. [2024-10-14 05:09:08,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:09:08,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:08,781 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:08,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 05:09:08,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 05:09:08,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:08,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:08,986 INFO L85 PathProgramCache]: Analyzing trace with hash 646849196, now seen corresponding path program 1 times [2024-10-14 05:09:08,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:08,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373700398] [2024-10-14 05:09:08,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:08,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:09,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:09,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:09,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:09:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 05:09:09,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:09,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373700398] [2024-10-14 05:09:09,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373700398] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:09,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824521194] [2024-10-14 05:09:09,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:09,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:09,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:09,063 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:09,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 05:09:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:09,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:09:09,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:09,168 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 05:09:09,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:09,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824521194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:09,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:09,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 05:09:09,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819977292] [2024-10-14 05:09:09,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:09,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:09,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:09,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:09,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:09,171 INFO L87 Difference]: Start difference. First operand 699 states and 939 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:09:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:09,233 INFO L93 Difference]: Finished difference Result 1145 states and 1542 transitions. [2024-10-14 05:09:09,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:09:09,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-14 05:09:09,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:09,237 INFO L225 Difference]: With dead ends: 1145 [2024-10-14 05:09:09,237 INFO L226 Difference]: Without dead ends: 704 [2024-10-14 05:09:09,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:09,238 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 0 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:09,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 742 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:09,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-10-14 05:09:09,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2024-10-14 05:09:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 604 states have (on average 1.314569536423841) internal successors, (794), 616 states have internal predecessors, (794), 60 states have call successors, (60), 34 states have call predecessors, (60), 38 states have return successors, (82), 54 states have call predecessors, (82), 56 states have call successors, (82) [2024-10-14 05:09:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 936 transitions. [2024-10-14 05:09:09,272 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 936 transitions. Word has length 60 [2024-10-14 05:09:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:09,274 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 936 transitions. [2024-10-14 05:09:09,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:09:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 936 transitions. [2024-10-14 05:09:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:09:09,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:09,276 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:09,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 05:09:09,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-14 05:09:09,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:09,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash -197156306, now seen corresponding path program 1 times [2024-10-14 05:09:09,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:09,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012950189] [2024-10-14 05:09:09,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:09,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:09,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:09,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:09:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 05:09:09,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:09,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012950189] [2024-10-14 05:09:09,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012950189] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:09,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249649090] [2024-10-14 05:09:09,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:09,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:09,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:09,560 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:09,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 05:09:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:09,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 05:09:09,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 05:09:09,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:09,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249649090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:09,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:09,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 05:09:09,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013534614] [2024-10-14 05:09:09,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:09,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:09,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:09,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:09,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:09,649 INFO L87 Difference]: Start difference. First operand 704 states and 936 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:09:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:09,725 INFO L93 Difference]: Finished difference Result 1070 states and 1424 transitions. [2024-10-14 05:09:09,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:09:09,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-14 05:09:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:09,728 INFO L225 Difference]: With dead ends: 1070 [2024-10-14 05:09:09,729 INFO L226 Difference]: Without dead ends: 601 [2024-10-14 05:09:09,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:09,731 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 0 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:09,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 742 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-10-14 05:09:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 594. [2024-10-14 05:09:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 512 states have (on average 1.31640625) internal successors, (674), 522 states have internal predecessors, (674), 50 states have call successors, (50), 28 states have call predecessors, (50), 30 states have return successors, (63), 44 states have call predecessors, (63), 46 states have call successors, (63) [2024-10-14 05:09:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 787 transitions. [2024-10-14 05:09:09,755 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 787 transitions. Word has length 60 [2024-10-14 05:09:09,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:09,756 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 787 transitions. [2024-10-14 05:09:09,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 05:09:09,757 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 787 transitions. [2024-10-14 05:09:09,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 05:09:09,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:09,758 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:09,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 05:09:09,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:09,963 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:09,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:09,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1600483310, now seen corresponding path program 1 times [2024-10-14 05:09:09,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:09,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789310733] [2024-10-14 05:09:09,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:09,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:10,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:10,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:10,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:09:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 05:09:10,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:10,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789310733] [2024-10-14 05:09:10,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789310733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:10,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:10,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:09:10,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064511944] [2024-10-14 05:09:10,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:10,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:09:10,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:10,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:09:10,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:10,055 INFO L87 Difference]: Start difference. First operand 594 states and 787 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:09:10,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:10,284 INFO L93 Difference]: Finished difference Result 675 states and 884 transitions. [2024-10-14 05:09:10,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:09:10,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-14 05:09:10,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:10,287 INFO L225 Difference]: With dead ends: 675 [2024-10-14 05:09:10,288 INFO L226 Difference]: Without dead ends: 672 [2024-10-14 05:09:10,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:09:10,289 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 568 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:10,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 379 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:09:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-10-14 05:09:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 593. [2024-10-14 05:09:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 512 states have (on average 1.3125) internal successors, (672), 521 states have internal predecessors, (672), 49 states have call successors, (49), 28 states have call predecessors, (49), 30 states have return successors, (63), 44 states have call predecessors, (63), 46 states have call successors, (63) [2024-10-14 05:09:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 784 transitions. [2024-10-14 05:09:10,312 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 784 transitions. Word has length 60 [2024-10-14 05:09:10,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:10,312 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 784 transitions. [2024-10-14 05:09:10,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 05:09:10,312 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 784 transitions. [2024-10-14 05:09:10,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 05:09:10,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:10,314 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] [2024-10-14 05:09:10,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 05:09:10,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:10,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:10,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1339637393, now seen corresponding path program 1 times [2024-10-14 05:09:10,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:10,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940886823] [2024-10-14 05:09:10,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:10,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:10,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:10,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:10,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:10,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:10,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:10,426 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-14 05:09:10,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:10,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940886823] [2024-10-14 05:09:10,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940886823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:10,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:10,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:09:10,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556196429] [2024-10-14 05:09:10,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:10,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:09:10,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:10,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:09:10,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:09:10,428 INFO L87 Difference]: Start difference. First operand 593 states and 784 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:11,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:11,043 INFO L93 Difference]: Finished difference Result 882 states and 1234 transitions. [2024-10-14 05:09:11,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:09:11,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-14 05:09:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:11,047 INFO L225 Difference]: With dead ends: 882 [2024-10-14 05:09:11,047 INFO L226 Difference]: Without dead ends: 767 [2024-10-14 05:09:11,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:09:11,048 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 533 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:11,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 576 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:09:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-10-14 05:09:11,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 706. [2024-10-14 05:09:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 607 states have (on average 1.3509060955518946) internal successors, (820), 617 states have internal predecessors, (820), 60 states have call successors, (60), 34 states have call predecessors, (60), 37 states have return successors, (77), 55 states have call predecessors, (77), 57 states have call successors, (77) [2024-10-14 05:09:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 957 transitions. [2024-10-14 05:09:11,093 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 957 transitions. Word has length 62 [2024-10-14 05:09:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:11,094 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 957 transitions. [2024-10-14 05:09:11,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 957 transitions. [2024-10-14 05:09:11,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 05:09:11,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:11,095 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] [2024-10-14 05:09:11,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:09:11,095 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:11,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:11,095 INFO L85 PathProgramCache]: Analyzing trace with hash 792730287, now seen corresponding path program 1 times [2024-10-14 05:09:11,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:11,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225219856] [2024-10-14 05:09:11,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:11,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:11,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:11,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:11,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:11,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:11,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:11,184 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-14 05:09:11,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:11,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225219856] [2024-10-14 05:09:11,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225219856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:11,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:11,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:11,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774792145] [2024-10-14 05:09:11,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:11,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:11,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:11,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:11,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:11,185 INFO L87 Difference]: Start difference. First operand 706 states and 957 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:12,014 INFO L93 Difference]: Finished difference Result 1137 states and 1620 transitions. [2024-10-14 05:09:12,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:09:12,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-14 05:09:12,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:12,018 INFO L225 Difference]: With dead ends: 1137 [2024-10-14 05:09:12,018 INFO L226 Difference]: Without dead ends: 909 [2024-10-14 05:09:12,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:09:12,020 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 526 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:12,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 970 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:09:12,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-10-14 05:09:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 812. [2024-10-14 05:09:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 695 states have (on average 1.3726618705035971) internal successors, (954), 706 states have internal predecessors, (954), 71 states have call successors, (71), 40 states have call predecessors, (71), 44 states have return successors, (90), 67 states have call predecessors, (90), 68 states have call successors, (90) [2024-10-14 05:09:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1115 transitions. [2024-10-14 05:09:12,062 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1115 transitions. Word has length 62 [2024-10-14 05:09:12,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:12,062 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1115 transitions. [2024-10-14 05:09:12,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1115 transitions. [2024-10-14 05:09:12,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 05:09:12,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:12,064 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] [2024-10-14 05:09:12,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 05:09:12,064 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:12,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:12,064 INFO L85 PathProgramCache]: Analyzing trace with hash 311650029, now seen corresponding path program 1 times [2024-10-14 05:09:12,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:12,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816059034] [2024-10-14 05:09:12,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:12,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:12,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:12,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:12,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:12,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:12,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:09:12,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:12,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816059034] [2024-10-14 05:09:12,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816059034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:12,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:12,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:12,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099422208] [2024-10-14 05:09:12,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:12,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:12,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:12,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:12,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:12,149 INFO L87 Difference]: Start difference. First operand 812 states and 1115 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:12,889 INFO L93 Difference]: Finished difference Result 1510 states and 2186 transitions. [2024-10-14 05:09:12,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:09:12,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-14 05:09:12,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:12,894 INFO L225 Difference]: With dead ends: 1510 [2024-10-14 05:09:12,894 INFO L226 Difference]: Without dead ends: 1176 [2024-10-14 05:09:12,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:09:12,896 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 524 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:12,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 968 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:09:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2024-10-14 05:09:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1025. [2024-10-14 05:09:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 872 states have (on average 1.4025229357798166) internal successors, (1223), 885 states have internal predecessors, (1223), 93 states have call successors, (93), 52 states have call predecessors, (93), 58 states have return successors, (120), 91 states have call predecessors, (120), 90 states have call successors, (120) [2024-10-14 05:09:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1436 transitions. [2024-10-14 05:09:12,955 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1436 transitions. Word has length 62 [2024-10-14 05:09:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:12,955 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1436 transitions. [2024-10-14 05:09:12,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1436 transitions. [2024-10-14 05:09:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 05:09:12,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:12,957 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] [2024-10-14 05:09:12,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:09:12,957 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:12,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:12,958 INFO L85 PathProgramCache]: Analyzing trace with hash 296131311, now seen corresponding path program 1 times [2024-10-14 05:09:12,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:12,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731977734] [2024-10-14 05:09:12,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:12,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:12,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:13,044 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-14 05:09:13,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:13,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731977734] [2024-10-14 05:09:13,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731977734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:13,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:13,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:13,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225281259] [2024-10-14 05:09:13,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:13,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:13,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:13,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:13,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:13,046 INFO L87 Difference]: Start difference. First operand 1025 states and 1436 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:13,892 INFO L93 Difference]: Finished difference Result 2359 states and 3473 transitions. [2024-10-14 05:09:13,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:09:13,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-14 05:09:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:13,899 INFO L225 Difference]: With dead ends: 2359 [2024-10-14 05:09:13,899 INFO L226 Difference]: Without dead ends: 1812 [2024-10-14 05:09:13,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:09:13,901 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 604 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:13,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 961 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:09:13,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-10-14 05:09:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1444. [2024-10-14 05:09:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1223 states have (on average 1.436631234668847) internal successors, (1757), 1240 states have internal predecessors, (1757), 133 states have call successors, (133), 76 states have call predecessors, (133), 86 states have return successors, (182), 135 states have call predecessors, (182), 130 states have call successors, (182) [2024-10-14 05:09:13,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2072 transitions. [2024-10-14 05:09:13,997 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2072 transitions. Word has length 62 [2024-10-14 05:09:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:13,997 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 2072 transitions. [2024-10-14 05:09:13,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2072 transitions. [2024-10-14 05:09:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 05:09:13,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:13,999 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] [2024-10-14 05:09:13,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:09:13,999 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:13,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:13,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2059673939, now seen corresponding path program 1 times [2024-10-14 05:09:14,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:14,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058728410] [2024-10-14 05:09:14,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:14,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:14,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:14,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:14,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:14,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:14,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:14,075 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-14 05:09:14,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:14,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058728410] [2024-10-14 05:09:14,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058728410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:14,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:14,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:14,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126717467] [2024-10-14 05:09:14,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:14,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:14,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:14,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:14,077 INFO L87 Difference]: Start difference. First operand 1444 states and 2072 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:14,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:14,953 INFO L93 Difference]: Finished difference Result 3816 states and 5691 transitions. [2024-10-14 05:09:14,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:09:14,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-14 05:09:14,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:14,963 INFO L225 Difference]: With dead ends: 3816 [2024-10-14 05:09:14,963 INFO L226 Difference]: Without dead ends: 2850 [2024-10-14 05:09:14,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:09:14,965 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 526 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:14,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 957 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:09:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2024-10-14 05:09:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2199. [2024-10-14 05:09:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 1846 states have (on average 1.4534127843987) internal successors, (2683), 1871 states have internal predecessors, (2683), 209 states have call successors, (209), 124 states have call predecessors, (209), 142 states have return successors, (320), 219 states have call predecessors, (320), 206 states have call successors, (320) [2024-10-14 05:09:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 3212 transitions. [2024-10-14 05:09:15,103 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 3212 transitions. Word has length 62 [2024-10-14 05:09:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:15,103 INFO L471 AbstractCegarLoop]: Abstraction has 2199 states and 3212 transitions. [2024-10-14 05:09:15,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 3212 transitions. [2024-10-14 05:09:15,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 05:09:15,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:15,105 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] [2024-10-14 05:09:15,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:09:15,105 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:15,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:15,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1882204975, now seen corresponding path program 1 times [2024-10-14 05:09:15,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:15,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631935374] [2024-10-14 05:09:15,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:15,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,178 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-14 05:09:15,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:15,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631935374] [2024-10-14 05:09:15,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631935374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:15,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:15,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:09:15,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394808292] [2024-10-14 05:09:15,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:15,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:09:15,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:15,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:09:15,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:15,180 INFO L87 Difference]: Start difference. First operand 2199 states and 3212 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:15,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:15,618 INFO L93 Difference]: Finished difference Result 4297 states and 6464 transitions. [2024-10-14 05:09:15,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:09:15,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-14 05:09:15,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:15,628 INFO L225 Difference]: With dead ends: 4297 [2024-10-14 05:09:15,628 INFO L226 Difference]: Without dead ends: 2576 [2024-10-14 05:09:15,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:09:15,634 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 508 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:15,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 478 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 05:09:15,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2024-10-14 05:09:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2199. [2024-10-14 05:09:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 1846 states have (on average 1.4442036836403034) internal successors, (2666), 1871 states have internal predecessors, (2666), 209 states have call successors, (209), 124 states have call predecessors, (209), 142 states have return successors, (320), 219 states have call predecessors, (320), 206 states have call successors, (320) [2024-10-14 05:09:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 3195 transitions. [2024-10-14 05:09:15,808 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 3195 transitions. Word has length 62 [2024-10-14 05:09:15,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:15,808 INFO L471 AbstractCegarLoop]: Abstraction has 2199 states and 3195 transitions. [2024-10-14 05:09:15,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 3195 transitions. [2024-10-14 05:09:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 05:09:15,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:15,810 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] [2024-10-14 05:09:15,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:09:15,810 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:15,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:15,811 INFO L85 PathProgramCache]: Analyzing trace with hash -484489619, now seen corresponding path program 1 times [2024-10-14 05:09:15,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:15,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874667863] [2024-10-14 05:09:15,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:15,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:15,877 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-14 05:09:15,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:15,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874667863] [2024-10-14 05:09:15,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874667863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:15,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:15,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:09:15,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349992664] [2024-10-14 05:09:15,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:15,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:09:15,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:15,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:09:15,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:09:15,879 INFO L87 Difference]: Start difference. First operand 2199 states and 3195 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:16,580 INFO L93 Difference]: Finished difference Result 5329 states and 7914 transitions. [2024-10-14 05:09:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:09:16,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-10-14 05:09:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:16,592 INFO L225 Difference]: With dead ends: 5329 [2024-10-14 05:09:16,592 INFO L226 Difference]: Without dead ends: 3609 [2024-10-14 05:09:16,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:09:16,597 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 652 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:16,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 696 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:09:16,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3609 states. [2024-10-14 05:09:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3609 to 3062. [2024-10-14 05:09:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 2551 states have (on average 1.439827518620149) internal successors, (3673), 2593 states have internal predecessors, (3673), 305 states have call successors, (305), 178 states have call predecessors, (305), 204 states have return successors, (444), 306 states have call predecessors, (444), 302 states have call successors, (444) [2024-10-14 05:09:16,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 4422 transitions. [2024-10-14 05:09:16,823 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 4422 transitions. Word has length 62 [2024-10-14 05:09:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:16,823 INFO L471 AbstractCegarLoop]: Abstraction has 3062 states and 4422 transitions. [2024-10-14 05:09:16,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 05:09:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 4422 transitions. [2024-10-14 05:09:16,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 05:09:16,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:16,826 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:16,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:09:16,827 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:16,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:16,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1925314984, now seen corresponding path program 1 times [2024-10-14 05:09:16,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:16,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199405418] [2024-10-14 05:09:16,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:16,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:16,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:16,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:16,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:09:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 05:09:16,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:16,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199405418] [2024-10-14 05:09:16,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199405418] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:16,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062732288] [2024-10-14 05:09:16,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:16,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:16,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:16,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:16,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 05:09:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:16,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 05:09:16,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:09:17,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:09:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 05:09:17,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062732288] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:09:17,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 05:09:17,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-14 05:09:17,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985567550] [2024-10-14 05:09:17,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 05:09:17,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:09:17,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:17,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:09:17,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:09:17,207 INFO L87 Difference]: Start difference. First operand 3062 states and 4422 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 05:09:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:17,848 INFO L93 Difference]: Finished difference Result 3737 states and 5272 transitions. [2024-10-14 05:09:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 05:09:17,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-14 05:09:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:17,863 INFO L225 Difference]: With dead ends: 3737 [2024-10-14 05:09:17,863 INFO L226 Difference]: Without dead ends: 3734 [2024-10-14 05:09:17,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 05:09:17,865 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 508 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:17,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 989 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 05:09:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2024-10-14 05:09:18,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3355. [2024-10-14 05:09:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 2808 states have (on average 1.4234330484330484) internal successors, (3997), 2856 states have internal predecessors, (3997), 324 states have call successors, (324), 191 states have call predecessors, (324), 221 states have return successors, (474), 323 states have call predecessors, (474), 321 states have call successors, (474) [2024-10-14 05:09:18,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 4795 transitions. [2024-10-14 05:09:18,092 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 4795 transitions. Word has length 61 [2024-10-14 05:09:18,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:18,092 INFO L471 AbstractCegarLoop]: Abstraction has 3355 states and 4795 transitions. [2024-10-14 05:09:18,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-14 05:09:18,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 4795 transitions. [2024-10-14 05:09:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 05:09:18,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:18,096 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:18,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 05:09:18,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 05:09:18,297 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:18,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash -876360830, now seen corresponding path program 2 times [2024-10-14 05:09:18,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:18,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059391646] [2024-10-14 05:09:18,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:18,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:18,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:18,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:18,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:18,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 05:09:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 05:09:18,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:18,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059391646] [2024-10-14 05:09:18,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059391646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:18,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:09:18,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:09:18,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408176481] [2024-10-14 05:09:18,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:18,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:09:18,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:18,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:09:18,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:09:18,329 INFO L87 Difference]: Start difference. First operand 3355 states and 4795 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 05:09:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:18,683 INFO L93 Difference]: Finished difference Result 3951 states and 5552 transitions. [2024-10-14 05:09:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:09:18,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-14 05:09:18,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:18,699 INFO L225 Difference]: With dead ends: 3951 [2024-10-14 05:09:18,700 INFO L226 Difference]: Without dead ends: 3362 [2024-10-14 05:09:18,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:09:18,706 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 336 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:18,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 399 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:09:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2024-10-14 05:09:18,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3291. [2024-10-14 05:09:18,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3291 states, 2751 states have (on average 1.4238458742275537) internal successors, (3917), 2799 states have internal predecessors, (3917), 321 states have call successors, (321), 188 states have call predecessors, (321), 217 states have return successors, (469), 319 states have call predecessors, (469), 318 states have call successors, (469) [2024-10-14 05:09:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 4707 transitions. [2024-10-14 05:09:18,947 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 4707 transitions. Word has length 78 [2024-10-14 05:09:18,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:18,947 INFO L471 AbstractCegarLoop]: Abstraction has 3291 states and 4707 transitions. [2024-10-14 05:09:18,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 05:09:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 4707 transitions. [2024-10-14 05:09:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 05:09:18,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:18,953 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:18,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:09:18,953 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:18,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2102498243, now seen corresponding path program 1 times [2024-10-14 05:09:18,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:18,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581115893] [2024-10-14 05:09:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:18,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:18,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 05:09:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:18,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 05:09:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 05:09:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 05:09:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 05:09:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 05:09:19,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:19,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581115893] [2024-10-14 05:09:19,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581115893] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:19,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013482148] [2024-10-14 05:09:19,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:19,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:19,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:19,012 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:19,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 05:09:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:19,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 05:09:19,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013482148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:19,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-14 05:09:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450025381] [2024-10-14 05:09:19,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:19,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:19,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:19,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:19,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:09:19,102 INFO L87 Difference]: Start difference. First operand 3291 states and 4707 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 05:09:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:19,393 INFO L93 Difference]: Finished difference Result 3572 states and 5056 transitions. [2024-10-14 05:09:19,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:19,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-14 05:09:19,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:19,407 INFO L225 Difference]: With dead ends: 3572 [2024-10-14 05:09:19,407 INFO L226 Difference]: Without dead ends: 2593 [2024-10-14 05:09:19,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:09:19,410 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 54 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:19,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 507 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:19,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2024-10-14 05:09:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2593. [2024-10-14 05:09:19,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2593 states, 2138 states have (on average 1.4752104770813845) internal successors, (3154), 2173 states have internal predecessors, (3154), 274 states have call successors, (274), 157 states have call predecessors, (274), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2024-10-14 05:09:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3825 transitions. [2024-10-14 05:09:19,603 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3825 transitions. Word has length 92 [2024-10-14 05:09:19,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:19,604 INFO L471 AbstractCegarLoop]: Abstraction has 2593 states and 3825 transitions. [2024-10-14 05:09:19,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 05:09:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3825 transitions. [2024-10-14 05:09:19,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 05:09:19,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:19,611 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:19,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 05:09:19,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:19,812 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:19,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash -33527341, now seen corresponding path program 1 times [2024-10-14 05:09:19,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:19,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188467689] [2024-10-14 05:09:19,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:19,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 05:09:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 05:09:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 05:09:19,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:19,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188467689] [2024-10-14 05:09:19,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188467689] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:19,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189953853] [2024-10-14 05:09:19,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:19,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:19,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:19,885 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:19,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 05:09:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:19,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:19,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 05:09:20,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:20,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189953853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:20,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:20,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 05:09:20,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565204049] [2024-10-14 05:09:20,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:20,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:20,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:20,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:20,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:20,008 INFO L87 Difference]: Start difference. First operand 2593 states and 3825 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:09:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:20,341 INFO L93 Difference]: Finished difference Result 7678 states and 11405 transitions. [2024-10-14 05:09:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:20,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2024-10-14 05:09:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:20,354 INFO L225 Difference]: With dead ends: 7678 [2024-10-14 05:09:20,355 INFO L226 Difference]: Without dead ends: 5095 [2024-10-14 05:09:20,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:20,359 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 146 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:20,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 319 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5095 states. [2024-10-14 05:09:20,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5095 to 5065. [2024-10-14 05:09:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5065 states, 4176 states have (on average 1.4671934865900382) internal successors, (6127), 4244 states have internal predecessors, (6127), 528 states have call successors, (528), 313 states have call predecessors, (528), 360 states have return successors, (761), 523 states have call predecessors, (761), 526 states have call successors, (761) [2024-10-14 05:09:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5065 states to 5065 states and 7416 transitions. [2024-10-14 05:09:20,689 INFO L78 Accepts]: Start accepts. Automaton has 5065 states and 7416 transitions. Word has length 100 [2024-10-14 05:09:20,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:20,689 INFO L471 AbstractCegarLoop]: Abstraction has 5065 states and 7416 transitions. [2024-10-14 05:09:20,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 05:09:20,689 INFO L276 IsEmpty]: Start isEmpty. Operand 5065 states and 7416 transitions. [2024-10-14 05:09:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 05:09:20,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:20,695 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:20,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 05:09:20,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:20,896 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:20,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:20,897 INFO L85 PathProgramCache]: Analyzing trace with hash 795662515, now seen corresponding path program 1 times [2024-10-14 05:09:20,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:20,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731459382] [2024-10-14 05:09:20,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:20,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:20,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:20,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:20,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:20,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:20,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:20,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 05:09:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:20,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:20,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 05:09:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 05:09:20,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:20,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731459382] [2024-10-14 05:09:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731459382] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:20,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978340724] [2024-10-14 05:09:20,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:20,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:20,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:20,968 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:20,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 05:09:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:21,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:21,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:21,056 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 05:09:21,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:21,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978340724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:21,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:21,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:09:21,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286377783] [2024-10-14 05:09:21,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:21,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:21,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:21,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:21,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:21,058 INFO L87 Difference]: Start difference. First operand 5065 states and 7416 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 05:09:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:21,761 INFO L93 Difference]: Finished difference Result 14819 states and 21966 transitions. [2024-10-14 05:09:21,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:21,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 100 [2024-10-14 05:09:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:21,797 INFO L225 Difference]: With dead ends: 14819 [2024-10-14 05:09:21,797 INFO L226 Difference]: Without dead ends: 9765 [2024-10-14 05:09:21,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:21,812 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 144 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:21,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 475 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9765 states. [2024-10-14 05:09:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9765 to 9765. [2024-10-14 05:09:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9765 states, 8027 states have (on average 1.4508533698766664) internal successors, (11646), 8144 states have internal predecessors, (11646), 1017 states have call successors, (1017), 625 states have call predecessors, (1017), 720 states have return successors, (1660), 1027 states have call predecessors, (1660), 1015 states have call successors, (1660) [2024-10-14 05:09:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9765 states to 9765 states and 14323 transitions. [2024-10-14 05:09:22,501 INFO L78 Accepts]: Start accepts. Automaton has 9765 states and 14323 transitions. Word has length 100 [2024-10-14 05:09:22,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:22,501 INFO L471 AbstractCegarLoop]: Abstraction has 9765 states and 14323 transitions. [2024-10-14 05:09:22,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 05:09:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 9765 states and 14323 transitions. [2024-10-14 05:09:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 05:09:22,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:22,518 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:22,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 05:09:22,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:22,720 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:22,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:22,720 INFO L85 PathProgramCache]: Analyzing trace with hash 730759685, now seen corresponding path program 1 times [2024-10-14 05:09:22,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:22,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073127406] [2024-10-14 05:09:22,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:22,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 05:09:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 05:09:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 05:09:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-14 05:09:22,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:22,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073127406] [2024-10-14 05:09:22,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073127406] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:22,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398366733] [2024-10-14 05:09:22,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:22,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:22,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:22,798 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:22,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 05:09:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:22,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:22,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 05:09:22,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:22,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398366733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:22,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:22,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 05:09:22,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233629686] [2024-10-14 05:09:22,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:22,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:22,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:22,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:22,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:22,957 INFO L87 Difference]: Start difference. First operand 9765 states and 14323 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 05:09:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:24,501 INFO L93 Difference]: Finished difference Result 28697 states and 42336 transitions. [2024-10-14 05:09:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:24,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 128 [2024-10-14 05:09:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:24,575 INFO L225 Difference]: With dead ends: 28697 [2024-10-14 05:09:24,575 INFO L226 Difference]: Without dead ends: 18947 [2024-10-14 05:09:24,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:24,607 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 107 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:24,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 340 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:24,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18947 states. [2024-10-14 05:09:25,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18947 to 18839. [2024-10-14 05:09:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18839 states, 15577 states have (on average 1.4443089169930026) internal successors, (22498), 15808 states have internal predecessors, (22498), 1871 states have call successors, (1871), 1199 states have call predecessors, (1871), 1390 states have return successors, (3038), 1863 states have call predecessors, (3038), 1869 states have call successors, (3038) [2024-10-14 05:09:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18839 states to 18839 states and 27407 transitions. [2024-10-14 05:09:25,955 INFO L78 Accepts]: Start accepts. Automaton has 18839 states and 27407 transitions. Word has length 128 [2024-10-14 05:09:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:25,956 INFO L471 AbstractCegarLoop]: Abstraction has 18839 states and 27407 transitions. [2024-10-14 05:09:25,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 05:09:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 18839 states and 27407 transitions. [2024-10-14 05:09:25,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 05:09:25,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:25,996 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:26,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 05:09:26,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-14 05:09:26,197 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:26,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:26,197 INFO L85 PathProgramCache]: Analyzing trace with hash -381603350, now seen corresponding path program 1 times [2024-10-14 05:09:26,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:26,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93608903] [2024-10-14 05:09:26,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:26,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 05:09:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 05:09:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 05:09:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 05:09:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 05:09:26,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:26,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93608903] [2024-10-14 05:09:26,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93608903] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:26,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454747041] [2024-10-14 05:09:26,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:26,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:26,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:26,286 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:26,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 05:09:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:26,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:26,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:26,434 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 05:09:26,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:26,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454747041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:26,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:26,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:09:26,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400832277] [2024-10-14 05:09:26,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:26,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:26,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:26,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:26,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:26,437 INFO L87 Difference]: Start difference. First operand 18839 states and 27407 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 05:09:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:27,792 INFO L93 Difference]: Finished difference Result 29845 states and 43775 transitions. [2024-10-14 05:09:27,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:27,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 144 [2024-10-14 05:09:27,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:27,848 INFO L225 Difference]: With dead ends: 29845 [2024-10-14 05:09:27,848 INFO L226 Difference]: Without dead ends: 16519 [2024-10-14 05:09:27,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:27,879 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 124 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:27,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 193 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16519 states. [2024-10-14 05:09:29,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16519 to 12075. [2024-10-14 05:09:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12075 states, 10021 states have (on average 1.397864484582377) internal successors, (14008), 10142 states have internal predecessors, (14008), 1163 states have call successors, (1163), 795 states have call predecessors, (1163), 890 states have return successors, (1648), 1153 states have call predecessors, (1648), 1161 states have call successors, (1648) [2024-10-14 05:09:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12075 states to 12075 states and 16819 transitions. [2024-10-14 05:09:29,427 INFO L78 Accepts]: Start accepts. Automaton has 12075 states and 16819 transitions. Word has length 144 [2024-10-14 05:09:29,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:29,428 INFO L471 AbstractCegarLoop]: Abstraction has 12075 states and 16819 transitions. [2024-10-14 05:09:29,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 05:09:29,428 INFO L276 IsEmpty]: Start isEmpty. Operand 12075 states and 16819 transitions. [2024-10-14 05:09:29,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 05:09:29,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:29,446 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:29,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 05:09:29,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:29,647 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:29,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:29,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1891676725, now seen corresponding path program 1 times [2024-10-14 05:09:29,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:29,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775064796] [2024-10-14 05:09:29,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:29,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 05:09:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 05:09:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 05:09:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 05:09:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-14 05:09:29,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:29,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775064796] [2024-10-14 05:09:29,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775064796] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:29,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582259055] [2024-10-14 05:09:29,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:29,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:29,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:29,732 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:29,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 05:09:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:29,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 05:09:29,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-14 05:09:29,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:29,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582259055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:29,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:29,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:09:29,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042263660] [2024-10-14 05:09:29,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:29,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:29,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:29,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:29,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:29,847 INFO L87 Difference]: Start difference. First operand 12075 states and 16819 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 05:09:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:30,766 INFO L93 Difference]: Finished difference Result 21324 states and 29695 transitions. [2024-10-14 05:09:30,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:30,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 144 [2024-10-14 05:09:30,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:30,814 INFO L225 Difference]: With dead ends: 21324 [2024-10-14 05:09:30,814 INFO L226 Difference]: Without dead ends: 12899 [2024-10-14 05:09:30,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:30,837 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 121 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:30,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 354 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12899 states. [2024-10-14 05:09:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12899 to 12833. [2024-10-14 05:09:31,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12833 states, 10691 states have (on average 1.372743429052474) internal successors, (14676), 10812 states have internal predecessors, (14676), 1185 states have call successors, (1185), 861 states have call predecessors, (1185), 956 states have return successors, (1736), 1175 states have call predecessors, (1736), 1183 states have call successors, (1736) [2024-10-14 05:09:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12833 states to 12833 states and 17597 transitions. [2024-10-14 05:09:31,872 INFO L78 Accepts]: Start accepts. Automaton has 12833 states and 17597 transitions. Word has length 144 [2024-10-14 05:09:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:31,872 INFO L471 AbstractCegarLoop]: Abstraction has 12833 states and 17597 transitions. [2024-10-14 05:09:31,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 05:09:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 12833 states and 17597 transitions. [2024-10-14 05:09:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 05:09:31,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:31,886 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:31,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-14 05:09:32,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-14 05:09:32,087 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:32,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:32,087 INFO L85 PathProgramCache]: Analyzing trace with hash 658090459, now seen corresponding path program 1 times [2024-10-14 05:09:32,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:32,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591060858] [2024-10-14 05:09:32,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:32,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 05:09:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 05:09:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 05:09:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 05:09:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,161 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-14 05:09:32,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:32,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591060858] [2024-10-14 05:09:32,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591060858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:32,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113192333] [2024-10-14 05:09:32,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:32,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:32,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:32,164 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:32,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 05:09:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:32,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:32,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 05:09:32,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:32,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113192333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:32,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:32,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:09:32,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252223770] [2024-10-14 05:09:32,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:32,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:32,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:32,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:32,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:32,267 INFO L87 Difference]: Start difference. First operand 12833 states and 17597 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 05:09:33,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:33,870 INFO L93 Difference]: Finished difference Result 37679 states and 52207 transitions. [2024-10-14 05:09:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:33,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 145 [2024-10-14 05:09:33,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:33,955 INFO L225 Difference]: With dead ends: 37679 [2024-10-14 05:09:33,955 INFO L226 Difference]: Without dead ends: 24863 [2024-10-14 05:09:33,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:33,988 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 154 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:33,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 482 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24863 states. [2024-10-14 05:09:36,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24863 to 24815. [2024-10-14 05:09:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24815 states, 20715 states have (on average 1.3614289162442674) internal successors, (28202), 20956 states have internal predecessors, (28202), 2247 states have call successors, (2247), 1661 states have call predecessors, (2247), 1852 states have return successors, (3798), 2229 states have call predecessors, (3798), 2245 states have call successors, (3798) [2024-10-14 05:09:36,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24815 states to 24815 states and 34247 transitions. [2024-10-14 05:09:36,865 INFO L78 Accepts]: Start accepts. Automaton has 24815 states and 34247 transitions. Word has length 145 [2024-10-14 05:09:36,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:36,865 INFO L471 AbstractCegarLoop]: Abstraction has 24815 states and 34247 transitions. [2024-10-14 05:09:36,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 05:09:36,866 INFO L276 IsEmpty]: Start isEmpty. Operand 24815 states and 34247 transitions. [2024-10-14 05:09:36,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 05:09:36,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:36,904 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:36,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-14 05:09:37,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-14 05:09:37,105 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:37,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:37,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1237218634, now seen corresponding path program 1 times [2024-10-14 05:09:37,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:37,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343897148] [2024-10-14 05:09:37,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:37,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 05:09:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 05:09:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 05:09:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 05:09:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-14 05:09:37,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:37,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343897148] [2024-10-14 05:09:37,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343897148] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:37,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114120671] [2024-10-14 05:09:37,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:37,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:37,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:37,200 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:37,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 05:09:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:37,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:37,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-14 05:09:37,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:37,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114120671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:37,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:37,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:09:37,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185235566] [2024-10-14 05:09:37,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:37,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:37,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:37,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:37,377 INFO L87 Difference]: Start difference. First operand 24815 states and 34247 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 05:09:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:39,315 INFO L93 Difference]: Finished difference Result 50777 states and 71564 transitions. [2024-10-14 05:09:39,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:39,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 145 [2024-10-14 05:09:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:39,401 INFO L225 Difference]: With dead ends: 50777 [2024-10-14 05:09:39,401 INFO L226 Difference]: Without dead ends: 25989 [2024-10-14 05:09:39,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:39,452 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 120 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:39,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25989 states. [2024-10-14 05:09:41,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25989 to 25945. [2024-10-14 05:09:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25945 states, 21785 states have (on average 1.326141840716089) internal successors, (28890), 22026 states have internal predecessors, (28890), 2247 states have call successors, (2247), 1721 states have call predecessors, (2247), 1912 states have return successors, (3754), 2229 states have call predecessors, (3754), 2245 states have call successors, (3754) [2024-10-14 05:09:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25945 states to 25945 states and 34891 transitions. [2024-10-14 05:09:41,423 INFO L78 Accepts]: Start accepts. Automaton has 25945 states and 34891 transitions. Word has length 145 [2024-10-14 05:09:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:41,424 INFO L471 AbstractCegarLoop]: Abstraction has 25945 states and 34891 transitions. [2024-10-14 05:09:41,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-14 05:09:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 25945 states and 34891 transitions. [2024-10-14 05:09:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 05:09:41,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:41,454 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:41,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-14 05:09:41,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-14 05:09:41,655 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:41,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1992959625, now seen corresponding path program 1 times [2024-10-14 05:09:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:41,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993751094] [2024-10-14 05:09:41,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:41,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 05:09:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 05:09:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 05:09:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 05:09:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,733 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 05:09:41,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:41,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993751094] [2024-10-14 05:09:41,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993751094] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:41,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023110055] [2024-10-14 05:09:41,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:41,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:41,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:41,735 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:41,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 05:09:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:41,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:09:41,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 05:09:41,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:41,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023110055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:41,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:41,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:09:41,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787713476] [2024-10-14 05:09:41,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:41,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:41,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:41,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:41,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:41,837 INFO L87 Difference]: Start difference. First operand 25945 states and 34891 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 05:09:44,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:44,995 INFO L93 Difference]: Finished difference Result 74085 states and 100923 transitions. [2024-10-14 05:09:44,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:44,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 145 [2024-10-14 05:09:44,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:45,139 INFO L225 Difference]: With dead ends: 74085 [2024-10-14 05:09:45,139 INFO L226 Difference]: Without dead ends: 48167 [2024-10-14 05:09:45,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:45,195 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 143 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:45,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 473 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48167 states. [2024-10-14 05:09:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48167 to 48163. [2024-10-14 05:09:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48163 states, 40295 states have (on average 1.3133639409356) internal successors, (52922), 40776 states have internal predecessors, (52922), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2024-10-14 05:09:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48163 states to 48163 states and 65389 transitions. [2024-10-14 05:09:49,629 INFO L78 Accepts]: Start accepts. Automaton has 48163 states and 65389 transitions. Word has length 145 [2024-10-14 05:09:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:49,629 INFO L471 AbstractCegarLoop]: Abstraction has 48163 states and 65389 transitions. [2024-10-14 05:09:49,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 05:09:49,629 INFO L276 IsEmpty]: Start isEmpty. Operand 48163 states and 65389 transitions. [2024-10-14 05:09:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-14 05:09:49,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:49,678 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:49,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-14 05:09:49,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-14 05:09:49,883 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:49,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:49,883 INFO L85 PathProgramCache]: Analyzing trace with hash 731528452, now seen corresponding path program 1 times [2024-10-14 05:09:49,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:49,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484048043] [2024-10-14 05:09:49,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:49,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:49,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:49,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:49,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:49,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:49,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 05:09:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:49,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:09:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:49,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:49,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 05:09:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:49,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:49,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 05:09:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-14 05:09:49,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:49,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484048043] [2024-10-14 05:09:49,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484048043] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:49,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820439940] [2024-10-14 05:09:49,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:49,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:49,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:49,964 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:49,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 05:09:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:50,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 05:09:50,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-14 05:09:50,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:50,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820439940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:50,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:50,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:09:50,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345755139] [2024-10-14 05:09:50,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:50,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:50,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:50,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:50,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:50,090 INFO L87 Difference]: Start difference. First operand 48163 states and 65389 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 05:09:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:09:54,140 INFO L93 Difference]: Finished difference Result 85299 states and 116023 transitions. [2024-10-14 05:09:54,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:09:54,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 146 [2024-10-14 05:09:54,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:09:54,329 INFO L225 Difference]: With dead ends: 85299 [2024-10-14 05:09:54,329 INFO L226 Difference]: Without dead ends: 48839 [2024-10-14 05:09:54,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:54,395 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 140 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:09:54,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 342 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:09:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48839 states. [2024-10-14 05:09:58,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48839 to 48163. [2024-10-14 05:09:58,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48163 states, 40295 states have (on average 1.3044298300037225) internal successors, (52562), 40776 states have internal predecessors, (52562), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2024-10-14 05:09:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48163 states to 48163 states and 65029 transitions. [2024-10-14 05:09:58,481 INFO L78 Accepts]: Start accepts. Automaton has 48163 states and 65029 transitions. Word has length 146 [2024-10-14 05:09:58,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:09:58,482 INFO L471 AbstractCegarLoop]: Abstraction has 48163 states and 65029 transitions. [2024-10-14 05:09:58,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 05:09:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 48163 states and 65029 transitions. [2024-10-14 05:09:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-14 05:09:58,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:09:58,527 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:09:58,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-14 05:09:58,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:58,727 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:09:58,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:09:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash 144865972, now seen corresponding path program 1 times [2024-10-14 05:09:58,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:09:58,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454111361] [2024-10-14 05:09:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:58,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:09:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:09:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:09:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:09:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:09:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 05:09:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 05:09:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:09:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 05:09:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 05:09:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 05:09:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-14 05:09:58,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:09:58,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454111361] [2024-10-14 05:09:58,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454111361] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:09:58,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871267435] [2024-10-14 05:09:58,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:09:58,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:09:58,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:09:58,801 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:09:58,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-14 05:09:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:09:58,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 05:09:58,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:09:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 05:09:58,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:09:58,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871267435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:09:58,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:09:58,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-14 05:09:58,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636397068] [2024-10-14 05:09:58,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:09:58,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:09:58,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:09:58,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:09:58,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:09:58,918 INFO L87 Difference]: Start difference. First operand 48163 states and 65029 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 05:10:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:10:02,930 INFO L93 Difference]: Finished difference Result 86655 states and 117383 transitions. [2024-10-14 05:10:02,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:10:02,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 146 [2024-10-14 05:10:02,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:10:03,206 INFO L225 Difference]: With dead ends: 86655 [2024-10-14 05:10:03,206 INFO L226 Difference]: Without dead ends: 49423 [2024-10-14 05:10:03,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:10:03,277 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 140 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:10:03,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 355 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:10:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49423 states.