./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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.2-?-f4b24e3 [2022-07-13 18:12:27,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:12:27,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:12:27,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:12:27,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:12:27,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:12:27,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:12:27,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:12:27,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:12:27,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:12:27,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:12:27,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:12:27,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:12:27,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:12:27,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:12:27,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:12:27,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:12:27,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:12:27,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:12:27,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:12:27,318 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:12:27,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:12:27,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:12:27,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:12:27,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:12:27,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:12:27,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:12:27,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:12:27,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:12:27,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:12:27,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:12:27,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:12:27,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:12:27,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:12:27,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:12:27,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:12:27,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:12:27,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:12:27,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:12:27,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:12:27,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:12:27,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:12:27,362 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 18:12:27,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:12:27,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:12:27,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:12:27,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:12:27,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:12:27,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:12:27,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:12:27,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:12:27,415 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:12:27,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:12:27,415 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:12:27,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:12:27,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:12:27,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:12:27,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:12:27,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:12:27,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:12:27,416 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:12:27,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:12:27,417 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:12:27,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:12:27,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:12:27,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:12:27,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:12:27,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:12:27,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:12:27,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:12:27,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:12:27,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:12:27,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:12:27,419 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:12:27,419 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:12:27,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:12:27,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2022-07-13 18:12:27,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:12:27,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:12:27,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:12:27,853 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:12:27,855 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:12:27,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-07-13 18:12:27,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9312b1ff6/335d619f6f0c49e69399f2cd6fc5bfcf/FLAGee946cabe [2022-07-13 18:12:28,728 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:12:28,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-07-13 18:12:28,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9312b1ff6/335d619f6f0c49e69399f2cd6fc5bfcf/FLAGee946cabe [2022-07-13 18:12:29,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9312b1ff6/335d619f6f0c49e69399f2cd6fc5bfcf [2022-07-13 18:12:29,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:12:29,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:12:29,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:12:29,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:12:29,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:12:29,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:12:29" (1/1) ... [2022-07-13 18:12:29,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3379696c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:29, skipping insertion in model container [2022-07-13 18:12:29,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:12:29" (1/1) ... [2022-07-13 18:12:29,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:12:29,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:12:29,568 WARN L230 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] [2022-07-13 18:12:29,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:12:29,740 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:12:29,765 WARN L230 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] [2022-07-13 18:12:29,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:12:29,863 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:12:29,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:29 WrapperNode [2022-07-13 18:12:29,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:12:29,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:12:29,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:12:29,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:12:29,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:29" (1/1) ... [2022-07-13 18:12:29,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:29" (1/1) ... [2022-07-13 18:12:29,938 INFO L137 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 225 [2022-07-13 18:12:29,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:12:29,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:12:29,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:12:29,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:12:29,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:29" (1/1) ... [2022-07-13 18:12:29,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:29" (1/1) ... [2022-07-13 18:12:29,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:29" (1/1) ... [2022-07-13 18:12:29,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:29" (1/1) ... [2022-07-13 18:12:29,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:29" (1/1) ... [2022-07-13 18:12:29,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:29" (1/1) ... [2022-07-13 18:12:30,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:29" (1/1) ... [2022-07-13 18:12:30,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:12:30,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:12:30,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:12:30,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:12:30,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:29" (1/1) ... [2022-07-13 18:12:30,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:12:30,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:30,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 18:12:30,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 18:12:30,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:12:30,157 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-07-13 18:12:30,157 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-07-13 18:12:30,157 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-13 18:12:30,157 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-13 18:12:30,157 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-13 18:12:30,157 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-13 18:12:30,158 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-13 18:12:30,158 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-13 18:12:30,158 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-13 18:12:30,158 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-13 18:12:30,158 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-13 18:12:30,158 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-13 18:12:30,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:12:30,159 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-13 18:12:30,159 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-13 18:12:30,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:12:30,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:12:30,159 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-13 18:12:30,160 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-13 18:12:30,275 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:12:30,276 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:12:30,718 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2022-07-13 18:12:30,718 INFO L764 $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; [2022-07-13 18:12:30,747 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:12:30,754 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:12:30,767 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 18:12:30,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:12:30 BoogieIcfgContainer [2022-07-13 18:12:30,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:12:30,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:12:30,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:12:30,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:12:30,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:12:29" (1/3) ... [2022-07-13 18:12:30,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e14d7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:12:30, skipping insertion in model container [2022-07-13 18:12:30,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:12:29" (2/3) ... [2022-07-13 18:12:30,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e14d7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:12:30, skipping insertion in model container [2022-07-13 18:12:30,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:12:30" (3/3) ... [2022-07-13 18:12:30,778 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2022-07-13 18:12:30,807 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:12:30,808 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:12:30,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:12:30,911 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68c98a35, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5cdcbfdf [2022-07-13 18:12:30,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:12:30,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 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) [2022-07-13 18:12:30,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 18:12:30,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:30,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:30,953 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:30,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1330697302, now seen corresponding path program 1 times [2022-07-13 18:12:30,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:30,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166242383] [2022-07-13 18:12:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:30,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:31,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:31,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:31,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:31,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:31,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:31,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:31,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:31,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166242383] [2022-07-13 18:12:31,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166242383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:31,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:31,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 18:12:31,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824712951] [2022-07-13 18:12:31,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:31,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:12:31,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:31,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:12:31,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:31,897 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 97 states have internal predecessors, (142), 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 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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) [2022-07-13 18:12:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:33,024 INFO L93 Difference]: Finished difference Result 382 states and 574 transitions. [2022-07-13 18:12:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 18:12:33,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2022-07-13 18:12:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:33,047 INFO L225 Difference]: With dead ends: 382 [2022-07-13 18:12:33,049 INFO L226 Difference]: Without dead ends: 264 [2022-07-13 18:12:33,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:12:33,077 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 366 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:33,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 603 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 18:12:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-07-13 18:12:33,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 225. [2022-07-13 18:12:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 179 states have (on average 1.4245810055865922) internal successors, (255), 183 states have internal predecessors, (255), 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) [2022-07-13 18:12:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2022-07-13 18:12:33,250 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 64 [2022-07-13 18:12:33,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:33,252 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2022-07-13 18:12:33,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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) [2022-07-13 18:12:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2022-07-13 18:12:33,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 18:12:33,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:33,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:33,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:12:33,265 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:33,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1285381354, now seen corresponding path program 1 times [2022-07-13 18:12:33,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:33,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829738403] [2022-07-13 18:12:33,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:33,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:33,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:33,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829738403] [2022-07-13 18:12:33,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829738403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:33,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:33,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 18:12:33,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066761466] [2022-07-13 18:12:33,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:33,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:12:33,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:33,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:12:33,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:33,607 INFO L87 Difference]: Start difference. First operand 225 states and 316 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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) [2022-07-13 18:12:35,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:35,206 INFO L93 Difference]: Finished difference Result 622 states and 882 transitions. [2022-07-13 18:12:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 18:12:35,207 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 64 [2022-07-13 18:12:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:35,210 INFO L225 Difference]: With dead ends: 622 [2022-07-13 18:12:35,210 INFO L226 Difference]: Without dead ends: 413 [2022-07-13 18:12:35,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-13 18:12:35,213 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 451 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:35,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 835 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 18:12:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-07-13 18:12:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 337. [2022-07-13 18:12:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 269 states have (on average 1.41635687732342) internal successors, (381), 275 states have internal predecessors, (381), 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) [2022-07-13 18:12:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 476 transitions. [2022-07-13 18:12:35,308 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 476 transitions. Word has length 64 [2022-07-13 18:12:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:35,310 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 476 transitions. [2022-07-13 18:12:35,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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) [2022-07-13 18:12:35,311 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 476 transitions. [2022-07-13 18:12:35,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 18:12:35,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:35,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:35,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 18:12:35,316 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:35,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:35,316 INFO L85 PathProgramCache]: Analyzing trace with hash 980999832, now seen corresponding path program 1 times [2022-07-13 18:12:35,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:35,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679013180] [2022-07-13 18:12:35,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:35,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 18:12:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:12:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:35,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:35,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679013180] [2022-07-13 18:12:35,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679013180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:35,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:35,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 18:12:35,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572969457] [2022-07-13 18:12:35,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:35,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 18:12:35,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:35,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 18:12:35,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 18:12:35,630 INFO L87 Difference]: Start difference. First operand 337 states and 476 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 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) [2022-07-13 18:12:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:37,746 INFO L93 Difference]: Finished difference Result 1883 states and 2674 transitions. [2022-07-13 18:12:37,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 18:12:37,747 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 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 64 [2022-07-13 18:12:37,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:37,763 INFO L225 Difference]: With dead ends: 1883 [2022-07-13 18:12:37,764 INFO L226 Difference]: Without dead ends: 1550 [2022-07-13 18:12:37,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 18:12:37,778 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 1613 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:37,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 1146 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 18:12:37,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2022-07-13 18:12:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1390. [2022-07-13 18:12:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1117 states have (on average 1.3652641002685766) internal successors, (1525), 1138 states have internal predecessors, (1525), 152 states have call successors, (152), 105 states have call predecessors, (152), 120 states have return successors, (186), 148 states have call predecessors, (186), 150 states have call successors, (186) [2022-07-13 18:12:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1863 transitions. [2022-07-13 18:12:37,984 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1863 transitions. Word has length 64 [2022-07-13 18:12:37,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:37,984 INFO L495 AbstractCegarLoop]: Abstraction has 1390 states and 1863 transitions. [2022-07-13 18:12:37,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 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) [2022-07-13 18:12:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1863 transitions. [2022-07-13 18:12:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 18:12:37,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:37,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:37,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 18:12:37,987 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:37,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash 779831852, now seen corresponding path program 1 times [2022-07-13 18:12:37,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:37,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979988447] [2022-07-13 18:12:37,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:37,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:38,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:38,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:38,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:38,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:38,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:38,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 18:12:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:38,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:12:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:38,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:38,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979988447] [2022-07-13 18:12:38,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979988447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:38,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:38,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 18:12:38,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965053050] [2022-07-13 18:12:38,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:38,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 18:12:38,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:38,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 18:12:38,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:12:38,190 INFO L87 Difference]: Start difference. First operand 1390 states and 1863 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-07-13 18:12:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:38,863 INFO L93 Difference]: Finished difference Result 2918 states and 3942 transitions. [2022-07-13 18:12:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 18:12:38,863 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-07-13 18:12:38,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:38,872 INFO L225 Difference]: With dead ends: 2918 [2022-07-13 18:12:38,872 INFO L226 Difference]: Without dead ends: 1538 [2022-07-13 18:12:38,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-13 18:12:38,878 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 130 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:38,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 666 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:12:38,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-07-13 18:12:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1430. [2022-07-13 18:12:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1149 states have (on average 1.349869451697128) internal successors, (1551), 1170 states have internal predecessors, (1551), 152 states have call successors, (152), 105 states have call predecessors, (152), 128 states have return successors, (194), 156 states have call predecessors, (194), 150 states have call successors, (194) [2022-07-13 18:12:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1897 transitions. [2022-07-13 18:12:38,997 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1897 transitions. Word has length 65 [2022-07-13 18:12:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:38,998 INFO L495 AbstractCegarLoop]: Abstraction has 1430 states and 1897 transitions. [2022-07-13 18:12:38,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-07-13 18:12:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1897 transitions. [2022-07-13 18:12:38,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 18:12:38,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:39,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:39,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 18:12:39,000 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:39,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:39,001 INFO L85 PathProgramCache]: Analyzing trace with hash -249527446, now seen corresponding path program 1 times [2022-07-13 18:12:39,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:39,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119153412] [2022-07-13 18:12:39,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:39,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 18:12:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:12:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:12:39,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:39,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119153412] [2022-07-13 18:12:39,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119153412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:39,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:39,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 18:12:39,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575430199] [2022-07-13 18:12:39,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:39,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 18:12:39,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:39,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 18:12:39,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 18:12:39,135 INFO L87 Difference]: Start difference. First operand 1430 states and 1897 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 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) [2022-07-13 18:12:41,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:41,254 INFO L93 Difference]: Finished difference Result 5002 states and 6771 transitions. [2022-07-13 18:12:41,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 18:12:41,255 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 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 65 [2022-07-13 18:12:41,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:41,264 INFO L225 Difference]: With dead ends: 5002 [2022-07-13 18:12:41,264 INFO L226 Difference]: Without dead ends: 1821 [2022-07-13 18:12:41,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 18:12:41,275 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 1515 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:41,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 1322 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 18:12:41,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-07-13 18:12:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1641. [2022-07-13 18:12:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1288 states have (on average 1.3020186335403727) internal successors, (1677), 1311 states have internal predecessors, (1677), 192 states have call successors, (192), 133 states have call predecessors, (192), 160 states have return successors, (240), 198 states have call predecessors, (240), 190 states have call successors, (240) [2022-07-13 18:12:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2109 transitions. [2022-07-13 18:12:41,376 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2109 transitions. Word has length 65 [2022-07-13 18:12:41,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:41,377 INFO L495 AbstractCegarLoop]: Abstraction has 1641 states and 2109 transitions. [2022-07-13 18:12:41,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 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) [2022-07-13 18:12:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2109 transitions. [2022-07-13 18:12:41,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 18:12:41,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:41,380 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:41,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 18:12:41,381 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:41,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:41,381 INFO L85 PathProgramCache]: Analyzing trace with hash -31264562, now seen corresponding path program 1 times [2022-07-13 18:12:41,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:41,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006245270] [2022-07-13 18:12:41,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:41,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:12:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 18:12:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:12:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 18:12:41,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:41,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006245270] [2022-07-13 18:12:41,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006245270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:41,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:41,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 18:12:41,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299814506] [2022-07-13 18:12:41,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:41,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 18:12:41,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:41,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 18:12:41,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:12:41,547 INFO L87 Difference]: Start difference. First operand 1641 states and 2109 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 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) [2022-07-13 18:12:42,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:42,116 INFO L93 Difference]: Finished difference Result 3466 states and 4511 transitions. [2022-07-13 18:12:42,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 18:12:42,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 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 90 [2022-07-13 18:12:42,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:42,126 INFO L225 Difference]: With dead ends: 3466 [2022-07-13 18:12:42,139 INFO L226 Difference]: Without dead ends: 1835 [2022-07-13 18:12:42,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:12:42,150 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 182 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:42,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 554 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:12:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2022-07-13 18:12:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1701. [2022-07-13 18:12:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1336 states have (on average 1.2866766467065869) internal successors, (1719), 1359 states have internal predecessors, (1719), 192 states have call successors, (192), 133 states have call predecessors, (192), 172 states have return successors, (252), 210 states have call predecessors, (252), 190 states have call successors, (252) [2022-07-13 18:12:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2163 transitions. [2022-07-13 18:12:42,284 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2163 transitions. Word has length 90 [2022-07-13 18:12:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:42,284 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 2163 transitions. [2022-07-13 18:12:42,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 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) [2022-07-13 18:12:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2163 transitions. [2022-07-13 18:12:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 18:12:42,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:42,286 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:42,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 18:12:42,287 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:42,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:42,304 INFO L85 PathProgramCache]: Analyzing trace with hash 412636112, now seen corresponding path program 1 times [2022-07-13 18:12:42,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:42,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423437498] [2022-07-13 18:12:42,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:42,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:12:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 18:12:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:12:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 18:12:42,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:42,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423437498] [2022-07-13 18:12:42,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423437498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:42,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:42,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 18:12:42,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172049529] [2022-07-13 18:12:42,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:42,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:12:42,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:42,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:12:42,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:12:42,543 INFO L87 Difference]: Start difference. First operand 1701 states and 2163 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 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) [2022-07-13 18:12:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:43,829 INFO L93 Difference]: Finished difference Result 3228 states and 4127 transitions. [2022-07-13 18:12:43,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 18:12:43,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 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 90 [2022-07-13 18:12:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:43,841 INFO L225 Difference]: With dead ends: 3228 [2022-07-13 18:12:43,841 INFO L226 Difference]: Without dead ends: 1775 [2022-07-13 18:12:43,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-07-13 18:12:43,849 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 365 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:43,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 643 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 18:12:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2022-07-13 18:12:43,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1480. [2022-07-13 18:12:43,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1168 states have (on average 1.2851027397260273) internal successors, (1501), 1186 states have internal predecessors, (1501), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2022-07-13 18:12:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1877 transitions. [2022-07-13 18:12:44,024 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1877 transitions. Word has length 90 [2022-07-13 18:12:44,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:44,025 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1877 transitions. [2022-07-13 18:12:44,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 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) [2022-07-13 18:12:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1877 transitions. [2022-07-13 18:12:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 18:12:44,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:44,026 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:44,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 18:12:44,027 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:44,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:44,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1943169138, now seen corresponding path program 1 times [2022-07-13 18:12:44,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:44,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753364606] [2022-07-13 18:12:44,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:44,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:44,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:44,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:44,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:44,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:44,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:44,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:12:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:44,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 18:12:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:44,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:12:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 18:12:44,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:44,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753364606] [2022-07-13 18:12:44,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753364606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:44,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:44,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:12:44,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61534693] [2022-07-13 18:12:44,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:44,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:12:44,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:44,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:12:44,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:12:44,180 INFO L87 Difference]: Start difference. First operand 1480 states and 1877 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 18:12:44,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:44,924 INFO L93 Difference]: Finished difference Result 4632 states and 5989 transitions. [2022-07-13 18:12:44,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 18:12:44,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2022-07-13 18:12:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:44,941 INFO L225 Difference]: With dead ends: 4632 [2022-07-13 18:12:44,941 INFO L226 Difference]: Without dead ends: 3163 [2022-07-13 18:12:44,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-13 18:12:44,947 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 365 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:44,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 490 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 18:12:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2022-07-13 18:12:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2949. [2022-07-13 18:12:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2317 states have (on average 1.2641346568839016) internal successors, (2929), 2364 states have internal predecessors, (2929), 325 states have call successors, (325), 227 states have call predecessors, (325), 306 states have return successors, (495), 359 states have call predecessors, (495), 323 states have call successors, (495) [2022-07-13 18:12:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3749 transitions. [2022-07-13 18:12:45,107 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3749 transitions. Word has length 90 [2022-07-13 18:12:45,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:45,108 INFO L495 AbstractCegarLoop]: Abstraction has 2949 states and 3749 transitions. [2022-07-13 18:12:45,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-13 18:12:45,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3749 transitions. [2022-07-13 18:12:45,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 18:12:45,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:45,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:45,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 18:12:45,111 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:45,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:45,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1293960080, now seen corresponding path program 1 times [2022-07-13 18:12:45,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:45,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057403848] [2022-07-13 18:12:45,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:45,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:12:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 18:12:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:12:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 18:12:45,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:45,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057403848] [2022-07-13 18:12:45,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057403848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:45,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:45,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:12:45,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68314866] [2022-07-13 18:12:45,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:45,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:12:45,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:45,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:12:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:12:45,198 INFO L87 Difference]: Start difference. First operand 2949 states and 3749 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:12:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:45,444 INFO L93 Difference]: Finished difference Result 4533 states and 5733 transitions. [2022-07-13 18:12:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 18:12:45,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2022-07-13 18:12:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:45,454 INFO L225 Difference]: With dead ends: 4533 [2022-07-13 18:12:45,454 INFO L226 Difference]: Without dead ends: 1595 [2022-07-13 18:12:45,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-13 18:12:45,479 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 290 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:45,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 241 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:12:45,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2022-07-13 18:12:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1480. [2022-07-13 18:12:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1168 states have (on average 1.2534246575342465) internal successors, (1464), 1186 states have internal predecessors, (1464), 164 states have call successors, (164), 114 states have call predecessors, (164), 147 states have return successors, (212), 180 states have call predecessors, (212), 162 states have call successors, (212) [2022-07-13 18:12:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1840 transitions. [2022-07-13 18:12:45,628 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1840 transitions. Word has length 90 [2022-07-13 18:12:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:45,628 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1840 transitions. [2022-07-13 18:12:45,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:12:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1840 transitions. [2022-07-13 18:12:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 18:12:45,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:45,630 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:45,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 18:12:45,630 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:45,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1668589887, now seen corresponding path program 1 times [2022-07-13 18:12:45,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:45,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974600012] [2022-07-13 18:12:45,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:45,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:12:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 18:12:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:12:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 18:12:45,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:45,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974600012] [2022-07-13 18:12:45,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974600012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:45,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:12:45,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 18:12:45,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425410102] [2022-07-13 18:12:45,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:45,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 18:12:45,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:45,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 18:12:45,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:12:45,770 INFO L87 Difference]: Start difference. First operand 1480 states and 1840 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 18:12:47,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:47,150 INFO L93 Difference]: Finished difference Result 3898 states and 4923 transitions. [2022-07-13 18:12:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 18:12:47,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 91 [2022-07-13 18:12:47,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:47,179 INFO L225 Difference]: With dead ends: 3898 [2022-07-13 18:12:47,179 INFO L226 Difference]: Without dead ends: 2278 [2022-07-13 18:12:47,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-07-13 18:12:47,194 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 1314 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:47,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 609 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 18:12:47,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2022-07-13 18:12:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2101. [2022-07-13 18:12:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2101 states, 1635 states have (on average 1.2269113149847095) internal successors, (2006), 1661 states have internal predecessors, (2006), 241 states have call successors, (241), 162 states have call predecessors, (241), 224 states have return successors, (343), 278 states have call predecessors, (343), 239 states have call successors, (343) [2022-07-13 18:12:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 2590 transitions. [2022-07-13 18:12:47,450 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 2590 transitions. Word has length 91 [2022-07-13 18:12:47,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:47,451 INFO L495 AbstractCegarLoop]: Abstraction has 2101 states and 2590 transitions. [2022-07-13 18:12:47,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 18:12:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2590 transitions. [2022-07-13 18:12:47,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-13 18:12:47,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:47,458 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:47,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 18:12:47,458 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:47,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:47,459 INFO L85 PathProgramCache]: Analyzing trace with hash -633049043, now seen corresponding path program 1 times [2022-07-13 18:12:47,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:47,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732681399] [2022-07-13 18:12:47,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:47,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:12:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 18:12:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:12:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:12:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 18:12:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 18:12:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 18:12:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 18:12:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 18:12:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 18:12:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-13 18:12:47,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:47,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732681399] [2022-07-13 18:12:47,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732681399] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:47,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519302532] [2022-07-13 18:12:47,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:47,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:47,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:47,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:47,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 18:12:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:47,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 18:12:47,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:48,088 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 18:12:48,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:12:48,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519302532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:48,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:12:48,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-13 18:12:48,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898108063] [2022-07-13 18:12:48,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:48,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:12:48,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:48,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:12:48,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:12:48,094 INFO L87 Difference]: Start difference. First operand 2101 states and 2590 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-13 18:12:48,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:48,348 INFO L93 Difference]: Finished difference Result 6027 states and 7419 transitions. [2022-07-13 18:12:48,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:12:48,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2022-07-13 18:12:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:48,385 INFO L225 Difference]: With dead ends: 6027 [2022-07-13 18:12:48,386 INFO L226 Difference]: Without dead ends: 4013 [2022-07-13 18:12:48,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:12:48,392 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 61 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:48,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 281 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:48,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2022-07-13 18:12:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3971. [2022-07-13 18:12:48,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3971 states, 3092 states have (on average 1.2160413971539457) internal successors, (3760), 3141 states have internal predecessors, (3760), 448 states have call successors, (448), 323 states have call predecessors, (448), 430 states have return successors, (611), 507 states have call predecessors, (611), 446 states have call successors, (611) [2022-07-13 18:12:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4819 transitions. [2022-07-13 18:12:48,763 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4819 transitions. Word has length 162 [2022-07-13 18:12:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:48,765 INFO L495 AbstractCegarLoop]: Abstraction has 3971 states and 4819 transitions. [2022-07-13 18:12:48,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-13 18:12:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4819 transitions. [2022-07-13 18:12:48,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-13 18:12:48,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:48,774 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:48,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:48,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-13 18:12:48,976 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:48,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:48,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1912569076, now seen corresponding path program 1 times [2022-07-13 18:12:48,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:48,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145872554] [2022-07-13 18:12:48,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:48,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:12:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 18:12:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:12:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:12:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 18:12:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 18:12:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 18:12:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 18:12:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 18:12:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 18:12:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 18:12:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-13 18:12:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-13 18:12:49,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:49,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145872554] [2022-07-13 18:12:49,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145872554] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:49,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066097629] [2022-07-13 18:12:49,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:49,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:49,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:49,285 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:49,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 18:12:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:49,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 18:12:49,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 18:12:49,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:12:49,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066097629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:49,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:12:49,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-13 18:12:49,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517746638] [2022-07-13 18:12:49,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:49,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:12:49,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:49,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:12:49,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:12:49,641 INFO L87 Difference]: Start difference. First operand 3971 states and 4819 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 18:12:49,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:49,930 INFO L93 Difference]: Finished difference Result 11891 states and 14427 transitions. [2022-07-13 18:12:49,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:12:49,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 194 [2022-07-13 18:12:49,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:49,971 INFO L225 Difference]: With dead ends: 11891 [2022-07-13 18:12:49,971 INFO L226 Difference]: Without dead ends: 7931 [2022-07-13 18:12:49,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:12:49,985 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 52 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:49,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 281 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2022-07-13 18:12:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7921. [2022-07-13 18:12:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7921 states, 6170 states have (on average 1.2092382495948135) internal successors, (7461), 6266 states have internal predecessors, (7461), 890 states have call successors, (890), 645 states have call predecessors, (890), 860 states have return successors, (1218), 1010 states have call predecessors, (1218), 888 states have call successors, (1218) [2022-07-13 18:12:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7921 states to 7921 states and 9569 transitions. [2022-07-13 18:12:50,454 INFO L78 Accepts]: Start accepts. Automaton has 7921 states and 9569 transitions. Word has length 194 [2022-07-13 18:12:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:50,454 INFO L495 AbstractCegarLoop]: Abstraction has 7921 states and 9569 transitions. [2022-07-13 18:12:50,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-13 18:12:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 7921 states and 9569 transitions. [2022-07-13 18:12:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-13 18:12:50,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:50,461 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:50,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:50,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 18:12:50,688 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:50,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1015175798, now seen corresponding path program 1 times [2022-07-13 18:12:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:50,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511172574] [2022-07-13 18:12:50,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:50,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:12:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:12:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:12:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 18:12:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:12:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:12:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 18:12:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 18:12:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 18:12:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 18:12:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 18:12:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 18:12:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-13 18:12:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-13 18:12:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-13 18:12:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-13 18:12:50,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:50,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511172574] [2022-07-13 18:12:50,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511172574] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:50,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621532251] [2022-07-13 18:12:50,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:50,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:50,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:50,857 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:50,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 18:12:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:50,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 18:12:50,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-13 18:12:51,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:12:51,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621532251] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:12:51,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:12:51,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-13 18:12:51,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481239055] [2022-07-13 18:12:51,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:12:51,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:12:51,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:51,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:12:51,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:12:51,206 INFO L87 Difference]: Start difference. First operand 7921 states and 9569 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-13 18:12:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:51,606 INFO L93 Difference]: Finished difference Result 14427 states and 17761 transitions. [2022-07-13 18:12:51,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:12:51,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 194 [2022-07-13 18:12:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:51,611 INFO L225 Difference]: With dead ends: 14427 [2022-07-13 18:12:51,611 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 18:12:51,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:12:51,644 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:51,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 129 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:12:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 18:12:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 18:12:51,645 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) [2022-07-13 18:12:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 18:12:51,647 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 194 [2022-07-13 18:12:51,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:51,648 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 18:12:51,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-13 18:12:51,648 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 18:12:51,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 18:12:51,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 18:12:51,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:51,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:51,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 18:13:28,496 INFO L895 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)))) (and (or (not (<= ~c_dr_pc~0 0)) (not (= |old(~c_dr_st~0)| 0)) .cse0 (not (= 1 ~c_dr_i~0))) (or .cse0 (not (= ~c_dr_pc~0 1))))) [2022-07-13 18:13:28,496 INFO L895 garLoopResultBuilder]: At program point L387-2(lines 387 391) the Hoare annotation is: (let ((.cse2 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse9 (= ~p_dw_st~0 0)) (.cse6 (not (<= ~c_dr_pc~0 0))) (.cse7 (not (= |old(~c_dr_st~0)| 0))) (.cse0 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse1 (< 0 (+ activate_threads_~tmp~1 1))) (.cse3 (<= activate_threads_~tmp~1 0)) (.cse4 (= ~p_dw_pc~0 1)) (.cse5 (not (= ~q_read_ev~0 2))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 (not (= ~c_dr_pc~0 1)) .cse5) (let ((.cse8 (= ~c_dr_st~0 0))) (or .cse6 .cse7 (and .cse0 .cse8 .cse2) (and .cse8 .cse2 .cse9) .cse10)) (or .cse6 (not .cse9) .cse7 (= |old(~p_dw_st~0)| 0) (not (<= 2 ~fast_clk_edge~0)) (not .cse4) .cse10) (or .cse6 .cse7 (and .cse0 .cse1 .cse3) .cse4 .cse5 .cse10))) [2022-07-13 18:13:28,497 INFO L899 garLoopResultBuilder]: For program point L385-1(line 385) no Hoare annotation was computed. [2022-07-13 18:13:28,497 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 379 403) the Hoare annotation is: (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|)))) (and (or (not (<= ~c_dr_pc~0 0)) (not (= |old(~c_dr_st~0)| 0)) .cse0 (not (= 1 ~c_dr_i~0))) (or .cse0 (not (= ~c_dr_pc~0 1))))) [2022-07-13 18:13:28,497 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2022-07-13 18:13:28,497 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 379 403) no Hoare annotation was computed. [2022-07-13 18:13:28,497 INFO L899 garLoopResultBuilder]: For program point L393(line 393) no Hoare annotation was computed. [2022-07-13 18:13:28,497 INFO L899 garLoopResultBuilder]: For program point L395-2(lines 379 403) no Hoare annotation was computed. [2022-07-13 18:13:28,498 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2022-07-13 18:13:28,498 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 287 306) no Hoare annotation was computed. [2022-07-13 18:13:28,498 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 287 306) the Hoare annotation is: true [2022-07-13 18:13:28,498 INFO L902 garLoopResultBuilder]: At program point L303(lines 290 305) the Hoare annotation is: true [2022-07-13 18:13:28,498 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 300) no Hoare annotation was computed. [2022-07-13 18:13:28,498 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 301) no Hoare annotation was computed. [2022-07-13 18:13:28,498 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 287 306) no Hoare annotation was computed. [2022-07-13 18:13:28,499 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2022-07-13 18:13:28,499 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2022-07-13 18:13:28,499 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 94 118) no Hoare annotation was computed. [2022-07-13 18:13:28,499 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 91 119) the Hoare annotation is: true [2022-07-13 18:13:28,499 INFO L895 garLoopResultBuilder]: At program point L116(lines 94 118) the Hoare annotation is: (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1)) (not (= 1 ~c_dr_i~0))) [2022-07-13 18:13:28,499 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 91 119) no Hoare annotation was computed. [2022-07-13 18:13:28,500 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 111) no Hoare annotation was computed. [2022-07-13 18:13:28,500 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 105 114) no Hoare annotation was computed. [2022-07-13 18:13:28,500 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 91 119) no Hoare annotation was computed. [2022-07-13 18:13:28,500 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 307 324) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) .cse0 (not (= 1 ~c_dr_i~0))))) [2022-07-13 18:13:28,500 INFO L899 garLoopResultBuilder]: For program point L316-1(lines 307 324) no Hoare annotation was computed. [2022-07-13 18:13:28,500 INFO L899 garLoopResultBuilder]: For program point L311-1(lines 310 323) no Hoare annotation was computed. [2022-07-13 18:13:28,500 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 307 324) no Hoare annotation was computed. [2022-07-13 18:13:28,501 INFO L899 garLoopResultBuilder]: For program point L258-1(lines 254 268) no Hoare annotation was computed. [2022-07-13 18:13:28,501 INFO L895 garLoopResultBuilder]: At program point L49(lines 32 51) the Hoare annotation is: (let ((.cse1 (not (= ~c_dr_pc~0 1))) (.cse0 (= ~q_req_up~0 0)) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse2 (not (= |old(~q_req_up~0)| 0))) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1) (or .cse1 .cse2) (or .cse3 .cse4 .cse0 .cse5) (or .cse3 .cse4 .cse2 .cse5))) [2022-07-13 18:13:28,501 INFO L895 garLoopResultBuilder]: At program point update_channelsENTRY(lines 254 268) the Hoare annotation is: (let ((.cse0 (and (= ~q_ev~0 |old(~q_ev~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)|)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) .cse0 (not (= ~c_dr_st~0 0)) (not (= 1 ~c_dr_i~0))))) [2022-07-13 18:13:28,501 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 254 268) no Hoare annotation was computed. [2022-07-13 18:13:28,501 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 41 45) no Hoare annotation was computed. [2022-07-13 18:13:28,501 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2022-07-13 18:13:28,502 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 35 50) no Hoare annotation was computed. [2022-07-13 18:13:28,502 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 325 342) no Hoare annotation was computed. [2022-07-13 18:13:28,502 INFO L899 garLoopResultBuilder]: For program point L334-1(lines 325 342) no Hoare annotation was computed. [2022-07-13 18:13:28,502 INFO L899 garLoopResultBuilder]: For program point L329-1(lines 328 341) no Hoare annotation was computed. [2022-07-13 18:13:28,502 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 325 342) the Hoare annotation is: (let ((.cse0 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) (and (or .cse0 (not (= ~c_dr_pc~0 1))) (or (not (<= ~c_dr_pc~0 0)) (not (= ~c_dr_st~0 0)) .cse0 (not (= 1 ~c_dr_i~0))))) [2022-07-13 18:13:28,502 INFO L899 garLoopResultBuilder]: For program point L514-1(line 514) no Hoare annotation was computed. [2022-07-13 18:13:28,503 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-07-13 18:13:28,503 INFO L899 garLoopResultBuilder]: For program point L415-1(lines 410 450) no Hoare annotation was computed. [2022-07-13 18:13:28,503 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 356) no Hoare annotation was computed. [2022-07-13 18:13:28,503 INFO L895 garLoopResultBuilder]: At program point L349-2(lines 345 360) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,503 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 470) no Hoare annotation was computed. [2022-07-13 18:13:28,503 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 246) no Hoare annotation was computed. [2022-07-13 18:13:28,503 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 18:13:28,504 INFO L899 garLoopResultBuilder]: For program point L218-1(lines 218 228) no Hoare annotation was computed. [2022-07-13 18:13:28,504 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2022-07-13 18:13:28,504 INFO L895 garLoopResultBuilder]: At program point L499(line 499) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,504 INFO L899 garLoopResultBuilder]: For program point L499-1(line 499) no Hoare annotation was computed. [2022-07-13 18:13:28,505 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 241) no Hoare annotation was computed. [2022-07-13 18:13:28,505 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 206) no Hoare annotation was computed. [2022-07-13 18:13:28,505 INFO L895 garLoopResultBuilder]: At program point L153(lines 148 192) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 1))) (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) .cse0 (<= ~c_dr_pc~0 0)) (and (= ~c_dr_pc~0 1) .cse0))) [2022-07-13 18:13:28,505 INFO L895 garLoopResultBuilder]: At program point L203(lines 198 252) the Hoare annotation is: false [2022-07-13 18:13:28,505 INFO L895 garLoopResultBuilder]: At program point L484(line 484) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0)) [2022-07-13 18:13:28,505 INFO L899 garLoopResultBuilder]: For program point L484-1(line 484) no Hoare annotation was computed. [2022-07-13 18:13:28,506 INFO L895 garLoopResultBuilder]: At program point L451(lines 404 456) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,506 INFO L895 garLoopResultBuilder]: At program point L435(lines 410 450) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,506 INFO L895 garLoopResultBuilder]: At program point L171(lines 148 192) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,506 INFO L895 garLoopResultBuilder]: At program point L551(lines 535 553) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0)) [2022-07-13 18:13:28,506 INFO L895 garLoopResultBuilder]: At program point L188(lines 145 193) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (not (= ~p_dw_st~0 0)) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,506 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2022-07-13 18:13:28,507 INFO L895 garLoopResultBuilder]: At program point L370-1(lines 361 378) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,507 INFO L895 garLoopResultBuilder]: At program point L486(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-07-13 18:13:28,507 INFO L895 garLoopResultBuilder]: At program point L486-1(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-07-13 18:13:28,507 INFO L899 garLoopResultBuilder]: For program point L420(lines 410 450) no Hoare annotation was computed. [2022-07-13 18:13:28,507 INFO L895 garLoopResultBuilder]: At program point L503(line 503) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,508 INFO L895 garLoopResultBuilder]: At program point L503-1(line 503) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,508 INFO L895 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: false [2022-07-13 18:13:28,508 INFO L895 garLoopResultBuilder]: At program point L487(line 487) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-07-13 18:13:28,508 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 18:13:28,508 INFO L895 garLoopResultBuilder]: At program point L504(line 504) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,508 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2022-07-13 18:13:28,509 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 272 285) no Hoare annotation was computed. [2022-07-13 18:13:28,509 INFO L895 garLoopResultBuilder]: At program point L505(line 505) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,509 INFO L895 garLoopResultBuilder]: At program point L472(lines 461 474) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,509 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 446) no Hoare annotation was computed. [2022-07-13 18:13:28,509 INFO L895 garLoopResultBuilder]: At program point L473(lines 457 475) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,509 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-07-13 18:13:28,510 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 431) no Hoare annotation was computed. [2022-07-13 18:13:28,510 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 18:13:28,510 INFO L895 garLoopResultBuilder]: At program point L491-1(lines 488 528) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,510 INFO L899 garLoopResultBuilder]: For program point L508(line 508) no Hoare annotation was computed. [2022-07-13 18:13:28,510 INFO L895 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: false [2022-07-13 18:13:28,510 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-13 18:13:28,510 INFO L902 garLoopResultBuilder]: At program point L244-1(lines 198 252) the Hoare annotation is: true [2022-07-13 18:13:28,511 INFO L899 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-07-13 18:13:28,511 INFO L895 garLoopResultBuilder]: At program point L278-1(lines 269 286) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_req_up~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse6 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~slow_clk_edge~0) .cse4 (<= 2 ~fast_clk_edge~0) .cse5 .cse6))) [2022-07-13 18:13:28,511 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 519) no Hoare annotation was computed. [2022-07-13 18:13:28,511 INFO L899 garLoopResultBuilder]: For program point L510-2(lines 510 519) no Hoare annotation was computed. [2022-07-13 18:13:28,511 INFO L895 garLoopResultBuilder]: At program point L411(line 411) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,511 INFO L895 garLoopResultBuilder]: At program point L164-1(lines 148 192) the Hoare annotation is: (let ((.cse6 (= ~p_dw_pc~0 1))) (let ((.cse1 (= ~c_dr_st~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (= 1 ~c_dr_i~0)) (.cse0 (not .cse6)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse5 (= ~q_req_up~0 ~p_dw_pc~0))) (or (and (= ~c_dr_pc~0 1) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse0 .cse4) (and .cse6 .cse5 (= ~c_dr_pc~0 ~q_req_up~0))))) [2022-07-13 18:13:28,512 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 18:13:28,512 INFO L899 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2022-07-13 18:13:28,512 INFO L899 garLoopResultBuilder]: For program point L413(line 413) no Hoare annotation was computed. [2022-07-13 18:13:28,512 INFO L895 garLoopResultBuilder]: At program point L248(lines 195 253) the Hoare annotation is: (= ~c_dr_pc~0 1) [2022-07-13 18:13:28,512 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 161) no Hoare annotation was computed. [2022-07-13 18:13:28,512 INFO L902 garLoopResultBuilder]: At program point L529(lines 476 534) the Hoare annotation is: true [2022-07-13 18:13:28,513 INFO L895 garLoopResultBuilder]: At program point L463(line 463) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,513 INFO L899 garLoopResultBuilder]: For program point L463-1(line 463) no Hoare annotation was computed. [2022-07-13 18:13:28,513 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-07-13 18:13:28,513 INFO L902 garLoopResultBuilder]: At program point L563(lines 554 565) the Hoare annotation is: true [2022-07-13 18:13:28,513 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2022-07-13 18:13:28,513 INFO L899 garLoopResultBuilder]: For program point L365-2(lines 364 377) no Hoare annotation was computed. [2022-07-13 18:13:28,513 INFO L895 garLoopResultBuilder]: At program point L514(line 514) the Hoare annotation is: (or (and (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (<= ~c_dr_pc~0 0)) (= ~c_dr_pc~0 1)) [2022-07-13 18:13:28,514 INFO L899 garLoopResultBuilder]: For program point L66-2(lines 65 89) no Hoare annotation was computed. [2022-07-13 18:13:28,514 INFO L895 garLoopResultBuilder]: At program point L87(lines 65 89) the Hoare annotation is: (let ((.cse2 (not (= ~q_read_ev~0 2))) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse0 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse1 (= ~p_dw_pc~0 1)) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 (not (= ~c_dr_pc~0 1)) .cse2) (or .cse3 .cse4 .cse0 .cse1 .cse2 .cse5) (or .cse3 (not (<= 2 ~fast_clk_edge~0)) .cse4 .cse0 (not .cse1) .cse5))) [2022-07-13 18:13:28,514 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 62 90) no Hoare annotation was computed. [2022-07-13 18:13:28,514 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 62 90) no Hoare annotation was computed. [2022-07-13 18:13:28,514 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2022-07-13 18:13:28,514 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 76 85) no Hoare annotation was computed. [2022-07-13 18:13:28,515 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 62 90) the Hoare annotation is: true [2022-07-13 18:13:28,515 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2022-07-13 18:13:28,515 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2022-07-13 18:13:28,515 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-07-13 18:13:28,515 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-07-13 18:13:28,515 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2022-07-13 18:13:28,516 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2022-07-13 18:13:28,519 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:28,521 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 18:13:28,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:13:28 BoogieIcfgContainer [2022-07-13 18:13:28,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 18:13:28,540 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 18:13:28,540 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 18:13:28,540 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 18:13:28,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:12:30" (3/4) ... [2022-07-13 18:13:28,552 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 18:13:28,558 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-07-13 18:13:28,558 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-07-13 18:13:28,558 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-07-13 18:13:28,558 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-07-13 18:13:28,558 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-07-13 18:13:28,559 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-07-13 18:13:28,559 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-07-13 18:13:28,559 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-07-13 18:13:28,565 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-07-13 18:13:28,566 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 18:13:28,566 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 18:13:28,567 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 18:13:28,587 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((q_req_up == 0 || !(c_dr_pc == 1)) && (!(c_dr_pc == 1) || !(\old(q_req_up) == 0))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || q_req_up == 0) || !(1 == c_dr_i))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || !(\old(q_req_up) == 0)) || !(1 == c_dr_i)) [2022-07-13 18:13:28,628 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 18:13:28,629 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 18:13:28,629 INFO L158 Benchmark]: Toolchain (without parser) took 59514.75ms. Allocated memory was 100.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 76.0MB in the beginning and 699.5MB in the end (delta: -623.5MB). Peak memory consumption was 459.3MB. Max. memory is 16.1GB. [2022-07-13 18:13:28,629 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 79.7MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:13:28,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 763.25ms. Allocated memory is still 100.7MB. Free memory was 75.8MB in the beginning and 74.8MB in the end (delta: 974.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 18:13:28,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.65ms. Allocated memory is still 100.7MB. Free memory was 74.7MB in the beginning and 72.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:13:28,631 INFO L158 Benchmark]: Boogie Preprocessor took 76.32ms. Allocated memory is still 100.7MB. Free memory was 72.7MB in the beginning and 71.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:13:28,631 INFO L158 Benchmark]: RCFGBuilder took 753.23ms. Allocated memory is still 100.7MB. Free memory was 71.1MB in the beginning and 54.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 18:13:28,632 INFO L158 Benchmark]: TraceAbstraction took 57767.31ms. Allocated memory was 100.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 54.2MB in the beginning and 705.8MB in the end (delta: -651.7MB). Peak memory consumption was 729.3MB. Max. memory is 16.1GB. [2022-07-13 18:13:28,632 INFO L158 Benchmark]: Witness Printer took 88.78ms. Allocated memory is still 1.2GB. Free memory was 705.8MB in the beginning and 699.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 18:13:28,634 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44ms. Allocated memory is still 79.7MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 763.25ms. Allocated memory is still 100.7MB. Free memory was 75.8MB in the beginning and 74.8MB in the end (delta: 974.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.65ms. Allocated memory is still 100.7MB. Free memory was 74.7MB in the beginning and 72.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.32ms. Allocated memory is still 100.7MB. Free memory was 72.7MB in the beginning and 71.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 753.23ms. Allocated memory is still 100.7MB. Free memory was 71.1MB in the beginning and 54.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 57767.31ms. Allocated memory was 100.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 54.2MB in the beginning and 705.8MB in the end (delta: -651.7MB). Peak memory consumption was 729.3MB. Max. memory is 16.1GB. * Witness Printer took 88.78ms. Allocated memory is still 1.2GB. Free memory was 705.8MB in the beginning and 699.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.7s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 36.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6832 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6729 mSDsluCounter, 7800 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5281 mSDsCounter, 2004 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6655 IncrementalHoareTripleChecker+Invalid, 8659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2004 mSolverCounterUnsat, 2519 mSDtfsCounter, 6655 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1096 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7921occurred in iteration=12, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 1550 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 7671 PreInvPairs, 10405 NumberOfFragments, 1065 HoareAnnotationTreeSize, 7671 FomulaSimplifications, 19986 FormulaSimplificationTreeSizeReduction, 23.9s HoareSimplificationTime, 46 FomulaSimplificationsInter, 792157 FormulaSimplificationTreeSizeReductionInter, 12.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1873 NumberOfCodeBlocks, 1873 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1857 ConstructedInterpolants, 0 QuantifiedInterpolants, 3678 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1629 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 862/889 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: 461]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((__retres1 <= 0 && 0 <= __retres1) || p_dw_pc == 1) || !(c_dr_pc == 1)) || !(q_read_ev == 2)) && (((((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || p_dw_pc == 1) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && (((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 1)) || !(1 == c_dr_i)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && p_dw_pc == 1) && c_dr_pc <= 0) || (c_dr_pc == 1 && p_dw_pc == 1) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(1 == c_dr_i) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((c_dr_pc == 1 && !(p_dw_pc == 1)) || ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) && q_req_up == p_dw_pc)) || ((((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && !(p_dw_pc == 1)) && c_dr_pc <= 0)) || ((p_dw_pc == 1 && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) || ((((((((c_dr_st == 0 && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((q_req_up == 0 || !(c_dr_pc == 1)) && (!(c_dr_pc == 1) || !(\old(q_req_up) == 0))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || q_req_up == 0) || !(1 == c_dr_i))) && (((!(c_dr_pc <= 0) || !(c_dr_st == 0)) || !(\old(q_req_up) == 0)) || !(1 == c_dr_i)) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: ((((((((c_dr_st == 0 && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && p_dw_st == 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: c_dr_pc == 1 - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((c_dr_st == 0 && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((c_dr_st == 0 && !(p_dw_st == 0)) && 1 == c_dr_i) && c_dr_pc <= 0) || c_dr_pc == 1 RESULT: Ultimate proved your program to be correct! [2022-07-13 18:13:28,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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