./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:12:43,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:12:43,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:12:44,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:12:44,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:12:44,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:12:44,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:12:44,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:12:44,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:12:44,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:12:44,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:12:44,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:12:44,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:12:44,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:12:44,044 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:12:44,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:12:44,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:12:44,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:12:44,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:12:44,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:12:44,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:12:44,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:12:44,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:12:44,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:12:44,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:12:44,051 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:12:44,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:12:44,051 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:12:44,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:12:44,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:12:44,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:12:44,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:12:44,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:12:44,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:12:44,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:12:44,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:12:44,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:12:44,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:12:44,054 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:12:44,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:12:44,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:12:44,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:12:44,058 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 [2024-10-11 03:12:44,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:12:44,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:12:44,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:12:44,349 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:12:44,350 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:12:44,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2024-10-11 03:12:45,870 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:12:46,064 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:12:46,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2024-10-11 03:12:46,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a844f918b/c90afe7a0074407991d66ee4157ba14e/FLAGb704172b9 [2024-10-11 03:12:46,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a844f918b/c90afe7a0074407991d66ee4157ba14e [2024-10-11 03:12:46,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:12:46,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:12:46,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:12:46,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:12:46,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:12:46,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:12:46" (1/1) ... [2024-10-11 03:12:46,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2232264a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:46, skipping insertion in model container [2024-10-11 03:12:46,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:12:46" (1/1) ... [2024-10-11 03:12:46,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:12:46,294 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/systemc/pc_sfifo_3.cil.c[640,653] [2024-10-11 03:12:46,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:12:46,357 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:12:46,369 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/systemc/pc_sfifo_3.cil.c[640,653] [2024-10-11 03:12:46,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:12:46,421 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:12:46,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:46 WrapperNode [2024-10-11 03:12:46,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:12:46,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:12:46,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:12:46,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:12:46,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:46" (1/1) ... [2024-10-11 03:12:46,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:46" (1/1) ... [2024-10-11 03:12:46,462 INFO L138 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 227 [2024-10-11 03:12:46,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:12:46,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:12:46,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:12:46,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:12:46,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:46" (1/1) ... [2024-10-11 03:12:46,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:46" (1/1) ... [2024-10-11 03:12:46,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:46" (1/1) ... [2024-10-11 03:12:46,495 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:12:46,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:46" (1/1) ... [2024-10-11 03:12:46,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:46" (1/1) ... [2024-10-11 03:12:46,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:46" (1/1) ... [2024-10-11 03:12:46,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:46" (1/1) ... [2024-10-11 03:12:46,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:46" (1/1) ... [2024-10-11 03:12:46,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:46" (1/1) ... [2024-10-11 03:12:46,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:12:46,520 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:12:46,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:12:46,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:12:46,521 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:46" (1/1) ... [2024-10-11 03:12:46,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:12:46,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:12:46,555 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:12:46,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:12:46,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:12:46,608 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 03:12:46,609 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 03:12:46,609 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 03:12:46,609 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 03:12:46,610 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 03:12:46,610 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 03:12:46,610 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 03:12:46,611 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 03:12:46,611 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 03:12:46,612 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 03:12:46,612 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 03:12:46,612 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 03:12:46,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:12:46,612 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 03:12:46,612 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 03:12:46,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:12:46,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:12:46,612 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 03:12:46,612 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 03:12:46,698 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:12:46,702 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:12:47,057 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2024-10-11 03:12:47,058 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-10-11 03:12:47,138 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-11 03:12:47,139 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:12:47,181 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:12:47,182 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 03:12:47,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:12:47 BoogieIcfgContainer [2024-10-11 03:12:47,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:12:47,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:12:47,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:12:47,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:12:47,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:12:46" (1/3) ... [2024-10-11 03:12:47,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5c69ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:12:47, skipping insertion in model container [2024-10-11 03:12:47,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:12:46" (2/3) ... [2024-10-11 03:12:47,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5c69ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:12:47, skipping insertion in model container [2024-10-11 03:12:47,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:12:47" (3/3) ... [2024-10-11 03:12:47,192 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2024-10-11 03:12:47,209 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:12:47,210 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:12:47,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:12:47,283 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;@63a7e877, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:12:47,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:12:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 78 states have (on average 1.6282051282051282) internal successors, (127), 82 states have internal predecessors, (127), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 03:12:47,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 03:12:47,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:47,298 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] [2024-10-11 03:12:47,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:47,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:47,303 INFO L85 PathProgramCache]: Analyzing trace with hash -999542766, now seen corresponding path program 1 times [2024-10-11 03:12:47,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:47,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562044757] [2024-10-11 03:12:47,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:47,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:47,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:47,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:47,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:12:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:47,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:47,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:47,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:12:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:47,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:12:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:47,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:47,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562044757] [2024-10-11 03:12:47,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562044757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:47,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:47,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:12:47,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018659438] [2024-10-11 03:12:47,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:47,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:12:47,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:47,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:12:47,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:12:47,938 INFO L87 Difference]: Start difference. First operand has 104 states, 78 states have (on average 1.6282051282051282) internal successors, (127), 82 states have internal predecessors, (127), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 03:12:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:48,860 INFO L93 Difference]: Finished difference Result 340 states and 532 transitions. [2024-10-11 03:12:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:12:48,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2024-10-11 03:12:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:48,872 INFO L225 Difference]: With dead ends: 340 [2024-10-11 03:12:48,872 INFO L226 Difference]: Without dead ends: 239 [2024-10-11 03:12:48,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:12:48,882 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 350 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:48,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 369 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:12:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-11 03:12:48,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 202. [2024-10-11 03:12:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 156 states have (on average 1.4871794871794872) internal successors, (232), 160 states have internal predecessors, (232), 29 states have call successors, (29), 15 states have call predecessors, (29), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2024-10-11 03:12:48,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 293 transitions. [2024-10-11 03:12:48,957 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 293 transitions. Word has length 56 [2024-10-11 03:12:48,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:48,959 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 293 transitions. [2024-10-11 03:12:48,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 03:12:48,959 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 293 transitions. [2024-10-11 03:12:48,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 03:12:48,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:48,964 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] [2024-10-11 03:12:48,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:12:48,965 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:48,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1351431762, now seen corresponding path program 1 times [2024-10-11 03:12:48,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:48,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206107889] [2024-10-11 03:12:48,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:48,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:49,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:49,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:49,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:12:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:49,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:49,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:49,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:12:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:49,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:12:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:49,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:49,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206107889] [2024-10-11 03:12:49,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206107889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:49,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:49,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:12:49,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190470572] [2024-10-11 03:12:49,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:49,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:12:49,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:49,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:12:49,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:12:49,256 INFO L87 Difference]: Start difference. First operand 202 states and 293 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 03:12:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:50,235 INFO L93 Difference]: Finished difference Result 563 states and 823 transitions. [2024-10-11 03:12:50,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:12:50,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2024-10-11 03:12:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:50,243 INFO L225 Difference]: With dead ends: 563 [2024-10-11 03:12:50,246 INFO L226 Difference]: Without dead ends: 375 [2024-10-11 03:12:50,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:12:50,252 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 420 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:50,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 615 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:12:50,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-11 03:12:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 303. [2024-10-11 03:12:50,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 235 states have (on average 1.476595744680851) internal successors, (347), 241 states have internal predecessors, (347), 42 states have call successors, (42), 22 states have call predecessors, (42), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2024-10-11 03:12:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 442 transitions. [2024-10-11 03:12:50,328 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 442 transitions. Word has length 56 [2024-10-11 03:12:50,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:50,328 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 442 transitions. [2024-10-11 03:12:50,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 03:12:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 442 transitions. [2024-10-11 03:12:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 03:12:50,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:50,332 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] [2024-10-11 03:12:50,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:12:50,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:50,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:50,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2050049196, now seen corresponding path program 1 times [2024-10-11 03:12:50,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:50,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043755972] [2024-10-11 03:12:50,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:50,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:50,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:50,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:50,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:12:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:50,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:50,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:50,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:12:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:50,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:12:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:50,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:50,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043755972] [2024-10-11 03:12:50,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043755972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:50,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:50,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:12:50,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444734190] [2024-10-11 03:12:50,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:50,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:12:50,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:50,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:12:50,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:12:50,532 INFO L87 Difference]: Start difference. First operand 303 states and 442 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-11 03:12:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:51,694 INFO L93 Difference]: Finished difference Result 1171 states and 1716 transitions. [2024-10-11 03:12:51,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 03:12:51,695 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 56 [2024-10-11 03:12:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:51,703 INFO L225 Difference]: With dead ends: 1171 [2024-10-11 03:12:51,705 INFO L226 Difference]: Without dead ends: 870 [2024-10-11 03:12:51,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:12:51,709 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 756 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:51,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 860 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:12:51,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-10-11 03:12:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 774. [2024-10-11 03:12:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 610 states have (on average 1.4229508196721312) internal successors, (868), 624 states have internal predecessors, (868), 92 states have call successors, (92), 63 states have call predecessors, (92), 71 states have return successors, (117), 88 states have call predecessors, (117), 90 states have call successors, (117) [2024-10-11 03:12:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1077 transitions. [2024-10-11 03:12:51,808 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1077 transitions. Word has length 56 [2024-10-11 03:12:51,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:51,809 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1077 transitions. [2024-10-11 03:12:51,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 6 states have internal predecessors, (41), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-11 03:12:51,809 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1077 transitions. [2024-10-11 03:12:51,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 03:12:51,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:51,811 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] [2024-10-11 03:12:51,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:12:51,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:51,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:51,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1834223676, now seen corresponding path program 1 times [2024-10-11 03:12:51,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:51,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503346101] [2024-10-11 03:12:51,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:51,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:51,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:51,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:51,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:12:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:51,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:51,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:12:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:51,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:12:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:52,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:12:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:52,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:52,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503346101] [2024-10-11 03:12:52,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503346101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:52,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:52,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:12:52,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839439380] [2024-10-11 03:12:52,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:52,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:12:52,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:52,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:12:52,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:12:52,005 INFO L87 Difference]: Start difference. First operand 774 states and 1077 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:12:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:52,531 INFO L93 Difference]: Finished difference Result 1614 states and 2258 transitions. [2024-10-11 03:12:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:12:52,532 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2024-10-11 03:12:52,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:52,537 INFO L225 Difference]: With dead ends: 1614 [2024-10-11 03:12:52,538 INFO L226 Difference]: Without dead ends: 848 [2024-10-11 03:12:52,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:12:52,541 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 119 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:52,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 515 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:12:52,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-10-11 03:12:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 790. [2024-10-11 03:12:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 622 states have (on average 1.4083601286173633) internal successors, (876), 636 states have internal predecessors, (876), 92 states have call successors, (92), 63 states have call predecessors, (92), 75 states have return successors, (121), 92 states have call predecessors, (121), 90 states have call successors, (121) [2024-10-11 03:12:52,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1089 transitions. [2024-10-11 03:12:52,619 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1089 transitions. Word has length 57 [2024-10-11 03:12:52,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:52,620 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1089 transitions. [2024-10-11 03:12:52,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:12:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1089 transitions. [2024-10-11 03:12:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 03:12:52,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:52,621 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] [2024-10-11 03:12:52,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:12:52,622 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:52,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:52,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1906610234, now seen corresponding path program 1 times [2024-10-11 03:12:52,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:52,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220698682] [2024-10-11 03:12:52,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:52,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:52,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:52,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:12:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:52,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:52,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:12:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:52,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:12:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:52,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:12:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:52,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:52,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220698682] [2024-10-11 03:12:52,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220698682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:52,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:52,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:12:52,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413449645] [2024-10-11 03:12:52,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:52,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:12:52,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:52,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:12:52,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:12:52,775 INFO L87 Difference]: Start difference. First operand 790 states and 1089 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 03:12:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:53,912 INFO L93 Difference]: Finished difference Result 2983 states and 4212 transitions. [2024-10-11 03:12:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 03:12:53,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 57 [2024-10-11 03:12:53,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:53,920 INFO L225 Difference]: With dead ends: 2983 [2024-10-11 03:12:53,920 INFO L226 Difference]: Without dead ends: 1158 [2024-10-11 03:12:53,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:12:53,927 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 901 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:53,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 772 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:12:53,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-10-11 03:12:54,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1040. [2024-10-11 03:12:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 800 states have (on average 1.35375) internal successors, (1083), 816 states have internal predecessors, (1083), 132 states have call successors, (132), 91 states have call predecessors, (132), 107 states have return successors, (167), 134 states have call predecessors, (167), 130 states have call successors, (167) [2024-10-11 03:12:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1382 transitions. [2024-10-11 03:12:54,020 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1382 transitions. Word has length 57 [2024-10-11 03:12:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:54,020 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1382 transitions. [2024-10-11 03:12:54,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 03:12:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1382 transitions. [2024-10-11 03:12:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 03:12:54,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:54,022 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] [2024-10-11 03:12:54,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:12:54,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:54,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:54,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2045842353, now seen corresponding path program 1 times [2024-10-11 03:12:54,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:54,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213048532] [2024-10-11 03:12:54,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:54,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:12:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:12:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 03:12:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:54,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:54,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213048532] [2024-10-11 03:12:54,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213048532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:54,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:54,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:12:54,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98135322] [2024-10-11 03:12:54,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:54,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:12:54,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:54,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:12:54,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:12:54,169 INFO L87 Difference]: Start difference. First operand 1040 states and 1382 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:12:54,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:54,646 INFO L93 Difference]: Finished difference Result 2208 states and 2966 transitions. [2024-10-11 03:12:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:12:54,647 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-11 03:12:54,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:54,655 INFO L225 Difference]: With dead ends: 2208 [2024-10-11 03:12:54,655 INFO L226 Difference]: Without dead ends: 1176 [2024-10-11 03:12:54,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:12:54,658 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 170 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:54,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 431 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:12:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2024-10-11 03:12:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1088. [2024-10-11 03:12:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 836 states have (on average 1.3385167464114833) internal successors, (1119), 852 states have internal predecessors, (1119), 132 states have call successors, (132), 91 states have call predecessors, (132), 119 states have return successors, (179), 146 states have call predecessors, (179), 130 states have call successors, (179) [2024-10-11 03:12:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1430 transitions. [2024-10-11 03:12:54,760 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1430 transitions. Word has length 58 [2024-10-11 03:12:54,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:54,761 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1430 transitions. [2024-10-11 03:12:54,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:12:54,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1430 transitions. [2024-10-11 03:12:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 03:12:54,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:54,763 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] [2024-10-11 03:12:54,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:12:54,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:54,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:54,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2108576333, now seen corresponding path program 1 times [2024-10-11 03:12:54,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:54,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097867677] [2024-10-11 03:12:54,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:54,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:12:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:12:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 03:12:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:54,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:54,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097867677] [2024-10-11 03:12:54,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097867677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:54,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:54,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:12:54,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238136199] [2024-10-11 03:12:54,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:54,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:12:54,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:54,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:12:54,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:12:54,909 INFO L87 Difference]: Start difference. First operand 1088 states and 1430 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 03:12:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:55,623 INFO L93 Difference]: Finished difference Result 2133 states and 2816 transitions. [2024-10-11 03:12:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:12:55,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-11 03:12:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:55,630 INFO L225 Difference]: With dead ends: 2133 [2024-10-11 03:12:55,630 INFO L226 Difference]: Without dead ends: 1053 [2024-10-11 03:12:55,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:12:55,636 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 432 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:55,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 409 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:12:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-10-11 03:12:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 882. [2024-10-11 03:12:55,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 681 states have (on average 1.327459618208517) internal successors, (904), 695 states have internal predecessors, (904), 105 states have call successors, (105), 73 states have call predecessors, (105), 95 states have return successors, (143), 114 states have call predecessors, (143), 103 states have call successors, (143) [2024-10-11 03:12:55,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1152 transitions. [2024-10-11 03:12:55,710 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1152 transitions. Word has length 58 [2024-10-11 03:12:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:55,712 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1152 transitions. [2024-10-11 03:12:55,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 03:12:55,713 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1152 transitions. [2024-10-11 03:12:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 03:12:55,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:55,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:55,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:12:55,714 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:55,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:55,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1368742513, now seen corresponding path program 1 times [2024-10-11 03:12:55,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:55,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546724561] [2024-10-11 03:12:55,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:55,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:55,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:55,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:55,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:12:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:55,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:55,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:12:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:55,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:55,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 03:12:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:55,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:55,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546724561] [2024-10-11 03:12:55,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546724561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:55,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:55,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:12:55,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837734233] [2024-10-11 03:12:55,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:55,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:12:55,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:55,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:12:55,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:12:55,807 INFO L87 Difference]: Start difference. First operand 882 states and 1152 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 03:12:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:56,367 INFO L93 Difference]: Finished difference Result 2696 states and 3572 transitions. [2024-10-11 03:12:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:12:56,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-11 03:12:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:56,378 INFO L225 Difference]: With dead ends: 2696 [2024-10-11 03:12:56,379 INFO L226 Difference]: Without dead ends: 1823 [2024-10-11 03:12:56,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:12:56,382 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 310 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:56,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 314 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:12:56,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2024-10-11 03:12:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1715. [2024-10-11 03:12:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1307 states have (on average 1.297628156082632) internal successors, (1696), 1334 states have internal predecessors, (1696), 212 states have call successors, (212), 145 states have call predecessors, (212), 195 states have return successors, (335), 237 states have call predecessors, (335), 210 states have call successors, (335) [2024-10-11 03:12:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2243 transitions. [2024-10-11 03:12:56,557 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2243 transitions. Word has length 58 [2024-10-11 03:12:56,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:56,557 INFO L471 AbstractCegarLoop]: Abstraction has 1715 states and 2243 transitions. [2024-10-11 03:12:56,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 03:12:56,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2243 transitions. [2024-10-11 03:12:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 03:12:56,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:12:56,559 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] [2024-10-11 03:12:56,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:12:56,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:12:56,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:12:56,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1945360166, now seen corresponding path program 1 times [2024-10-11 03:12:56,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:12:56,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34918535] [2024-10-11 03:12:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:12:56,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:12:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:56,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:56,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:12:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:56,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:12:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:56,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:12:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:56,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:12:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:56,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:12:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:56,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 03:12:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:12:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:12:56,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:12:56,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34918535] [2024-10-11 03:12:56,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34918535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:12:56,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:12:56,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:12:56,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963599394] [2024-10-11 03:12:56,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:12:56,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:12:56,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:12:56,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:12:56,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:12:56,638 INFO L87 Difference]: Start difference. First operand 1715 states and 2243 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:12:57,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:12:57,013 INFO L93 Difference]: Finished difference Result 3394 states and 4520 transitions. [2024-10-11 03:12:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:12:57,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-11 03:12:57,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:12:57,017 INFO L225 Difference]: With dead ends: 3394 [2024-10-11 03:12:57,017 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 03:12:57,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:12:57,025 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 201 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:12:57,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 201 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:12:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 03:12:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 03:12:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:12:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 03:12:57,028 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2024-10-11 03:12:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:12:57,028 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 03:12:57,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:12:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 03:12:57,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 03:12:57,031 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:12:57,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:12:57,035 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:12:57,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 03:13:29,627 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:13:29,662 WARN L155 FloydHoareUtils]: Requires clause for activate_threads contained old-variable. Original clause: (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0))) Eliminated clause: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) [2024-10-11 03:13:29,683 WARN L155 FloydHoareUtils]: Requires clause for fire_delta_events contained old-variable. Original clause: (and (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)) Eliminated clause: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) [2024-10-11 03:13:29,688 WARN L155 FloydHoareUtils]: Requires clause for update_channels contained old-variable. Original clause: (and (= ~q_ev~0 |old(~q_ev~0)|) (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|)) Eliminated clause: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) [2024-10-11 03:13:29,700 WARN L155 FloydHoareUtils]: Requires clause for reset_delta_events contained old-variable. Original clause: (and (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)) Eliminated clause: (or (= ~c_dr_pc~0 1) (= ~c_dr_pc~0 0)) [2024-10-11 03:13:29,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:13:29 BoogieIcfgContainer [2024-10-11 03:13:29,708 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:13:29,709 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:13:29,709 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:13:29,709 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:13:29,709 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:12:47" (3/4) ... [2024-10-11 03:13:29,712 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 03:13:29,715 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2024-10-11 03:13:29,715 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2024-10-11 03:13:29,716 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2024-10-11 03:13:29,716 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2024-10-11 03:13:29,716 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2024-10-11 03:13:29,716 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2024-10-11 03:13:29,716 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2024-10-11 03:13:29,716 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-10-11 03:13:29,728 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-10-11 03:13:29,729 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-11 03:13:29,729 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 03:13:29,729 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 03:13:29,849 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:13:29,851 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 03:13:29,851 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:13:29,851 INFO L158 Benchmark]: Toolchain (without parser) took 43756.94ms. Allocated memory was 161.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 104.8MB in the beginning and 757.1MB in the end (delta: -652.3MB). Peak memory consumption was 545.4MB. Max. memory is 16.1GB. [2024-10-11 03:13:29,851 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 161.5MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:13:29,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.39ms. Allocated memory is still 161.5MB. Free memory was 104.8MB in the beginning and 89.4MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 03:13:29,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.91ms. Allocated memory is still 161.5MB. Free memory was 88.9MB in the beginning and 87.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:13:29,852 INFO L158 Benchmark]: Boogie Preprocessor took 55.63ms. Allocated memory is still 161.5MB. Free memory was 87.3MB in the beginning and 84.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 03:13:29,853 INFO L158 Benchmark]: RCFGBuilder took 662.76ms. Allocated memory was 161.5MB in the beginning and 228.6MB in the end (delta: 67.1MB). Free memory was 84.7MB in the beginning and 194.6MB in the end (delta: -109.9MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-10-11 03:13:29,853 INFO L158 Benchmark]: TraceAbstraction took 42523.30ms. Allocated memory was 228.6MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 193.6MB in the beginning and 764.5MB in the end (delta: -570.9MB). Peak memory consumption was 820.5MB. Max. memory is 16.1GB. [2024-10-11 03:13:29,853 INFO L158 Benchmark]: Witness Printer took 142.22ms. Allocated memory is still 1.4GB. Free memory was 764.5MB in the beginning and 757.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 03:13:29,855 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 161.5MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.39ms. Allocated memory is still 161.5MB. Free memory was 104.8MB in the beginning and 89.4MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.91ms. Allocated memory is still 161.5MB. Free memory was 88.9MB in the beginning and 87.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.63ms. Allocated memory is still 161.5MB. Free memory was 87.3MB in the beginning and 84.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 662.76ms. Allocated memory was 161.5MB in the beginning and 228.6MB in the end (delta: 67.1MB). Free memory was 84.7MB in the beginning and 194.6MB in the end (delta: -109.9MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 42523.30ms. Allocated memory was 228.6MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 193.6MB in the beginning and 764.5MB in the end (delta: -570.9MB). Peak memory consumption was 820.5MB. Max. memory is 16.1GB. * Witness Printer took 142.22ms. Allocated memory is still 1.4GB. Free memory was 764.5MB in the beginning and 757.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3738 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3659 mSDsluCounter, 4486 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3504 mSDsCounter, 910 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5321 IncrementalHoareTripleChecker+Invalid, 6231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 910 mSolverCounterUnsat, 982 mSDtfsCounter, 5321 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1715occurred in iteration=8, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 748 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 506 ConstructedInterpolants, 0 QuantifiedInterpolants, 1074 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: ((c_dr_pc == 1) || (c_dr_pc == 0)) - InvariantResult [Line: 210]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((c_dr_pc == 1) || (c_dr_pc == 0)) - InvariantResult [Line: 164]: Location Invariant Derived location invariant: (((((c_dr_pc == 1) && (p_dw_pc != 1)) || ((q_req_up == 1) && (c_dr_pc == 1))) || ((q_req_up == 1) && (c_dr_pc == 0))) || ((p_dw_pc != 1) && (c_dr_pc == 0))) - ProcedureContractResult [Line: 379]: Procedure Contract for activate_threads Derived contract for procedure activate_threads. Requires: ((c_dr_pc == 1) || (c_dr_pc == 0)) Ensures: (((((((\old(p_dw_st) == p_dw_st) || (c_dr_pc == 1)) || (p_dw_pc == 1)) || (q_read_ev != 2)) && ((((\old(p_dw_st) == p_dw_st) && (c_dr_st == \old(c_dr_st))) || (c_dr_pc == 1)) || (p_dw_st == 0))) && ((c_dr_pc == 1) || (c_dr_pc == 0))) && ((((c_dr_st == \old(c_dr_st)) || (c_dr_pc == 1)) || (p_dw_pc == 1)) || (q_read_ev != 2))) - ProcedureContractResult [Line: 287]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread. Requires: ((c_dr_pc == 1) || (c_dr_pc == 0)) Ensures: ((c_dr_pc == 1) || (c_dr_pc == 0)) - ProcedureContractResult [Line: 91]: Procedure Contract for is_do_read_c_triggered Derived contract for procedure is_do_read_c_triggered. Requires: ((c_dr_pc == 1) || (c_dr_pc == 0)) Ensures: (((c_dr_pc == 1) || (c_dr_pc == 0)) && ((\result == 0) || (c_dr_pc == 1))) - ProcedureContractResult [Line: 307]: Procedure Contract for fire_delta_events Derived contract for procedure fire_delta_events. Requires: ((c_dr_pc == 1) || (c_dr_pc == 0)) Ensures: (((((q_write_ev == 2) || (\old(q_read_ev) != 2)) || (2 != \old(q_write_ev))) && ((c_dr_pc == 1) || (c_dr_pc == 0))) && ((\old(q_read_ev) == q_read_ev) || (\old(q_read_ev) == 0))) - ProcedureContractResult [Line: 254]: Procedure Contract for update_channels Derived contract for procedure update_channels. Requires: ((c_dr_pc == 1) || (c_dr_pc == 0)) Ensures: ((((((((((q_ev == \old(q_ev)) && (q_write_ev == \old(q_write_ev))) && (q_read_ev == 2)) && (q_req_up == p_dw_pc)) || (p_dw_pc == 1)) || (\old(q_read_ev) != 2)) || (c_dr_pc != 1)) || (p_dw_pc != \old(q_req_up))) && ((c_dr_pc == 1) || (c_dr_pc == 0))) && (((((c_dr_pc == 1) || ((((q_ev == \old(q_ev)) && (q_req_up == 0)) && (q_write_ev == 2)) && (q_read_ev == 2))) || (c_dr_pc != \old(q_req_up))) || (\old(q_read_ev) != 2)) || (2 != \old(q_write_ev)))) - ProcedureContractResult [Line: 325]: Procedure Contract for reset_delta_events Derived contract for procedure reset_delta_events. Requires: ((c_dr_pc == 1) || (c_dr_pc == 0)) Ensures: (((((\old(q_read_ev) == q_read_ev) || (q_read_ev == 2)) && ((c_dr_pc == 1) || (c_dr_pc == 0))) && (((((q_write_ev == \old(q_write_ev)) && (\old(q_read_ev) != 1)) || (\old(q_read_ev) != \old(q_write_ev))) || (c_dr_pc == 1)) || (q_read_ev == 2))) && ((((c_dr_pc == 1) || (q_write_ev == 2)) || (\old(q_read_ev) != 2)) || (2 != \old(q_write_ev)))) - ProcedureContractResult [Line: 62]: Procedure Contract for is_do_write_p_triggered Derived contract for procedure is_do_write_p_triggered. Requires: ((c_dr_pc == 1) || (c_dr_pc == 0)) Ensures: ((((p_dw_pc == 1) || (\result == 0)) || (q_read_ev != 2)) && ((c_dr_pc == 1) || (c_dr_pc == 0))) - ProcedureContractResult [Line: 15]: Procedure Contract for error Derived contract for procedure error. Requires: 0 Ensures: 0 RESULT: Ultimate proved your program to be correct! [2024-10-11 03:13:29,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE