./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/transmitter.01.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 ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 06:35:53,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 06:35:53,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 06:35:53,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 06:35:53,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 06:35:53,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 06:35:53,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 06:35:53,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 06:35:53,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 06:35:53,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 06:35:53,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 06:35:53,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 06:35:53,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 06:35:53,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 06:35:53,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 06:35:53,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 06:35:53,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 06:35:53,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 06:35:53,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 06:35:53,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 06:35:53,754 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 06:35:53,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 06:35:53,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 06:35:53,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 06:35:53,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 06:35:53,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 06:35:53,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 06:35:53,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 06:35:53,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 06:35:53,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 06:35:53,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 06:35:53,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 06:35:53,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 06:35:53,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 06:35:53,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 06:35:53,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 06:35:53,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 06:35:53,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 06:35:53,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 06:35:53,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 06:35:53,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 06:35:53,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 06:35:53,771 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 06:35:53,792 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 06:35:53,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 06:35:53,793 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 06:35:53,793 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 06:35:53,794 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 06:35:53,794 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 06:35:53,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 06:35:53,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 06:35:53,795 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 06:35:53,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 06:35:53,796 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 06:35:53,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 06:35:53,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 06:35:53,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 06:35:53,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 06:35:53,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 06:35:53,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 06:35:53,797 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 06:35:53,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 06:35:53,798 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 06:35:53,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 06:35:53,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 06:35:53,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 06:35:53,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 06:35:53,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:35:53,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 06:35:53,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 06:35:53,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 06:35:53,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 06:35:53,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 06:35:53,799 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 06:35:53,800 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 06:35:53,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 06:35:53,800 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 -> ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe [2022-07-12 06:35:53,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 06:35:54,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 06:35:54,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 06:35:54,008 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 06:35:54,009 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 06:35:54,010 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.01.cil.c [2022-07-12 06:35:54,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a1b1475/fdf2bf43cbb646eca3196df5024c5bc6/FLAG45c52945e [2022-07-12 06:35:54,429 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 06:35:54,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c [2022-07-12 06:35:54,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a1b1475/fdf2bf43cbb646eca3196df5024c5bc6/FLAG45c52945e [2022-07-12 06:35:54,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a1b1475/fdf2bf43cbb646eca3196df5024c5bc6 [2022-07-12 06:35:54,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 06:35:54,446 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 06:35:54,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 06:35:54,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 06:35:54,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 06:35:54,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:35:54" (1/1) ... [2022-07-12 06:35:54,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d16de30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:54, skipping insertion in model container [2022-07-12 06:35:54,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:35:54" (1/1) ... [2022-07-12 06:35:54,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 06:35:54,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 06:35:54,587 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/transmitter.01.cil.c[706,719] [2022-07-12 06:35:54,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:35:54,617 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 06:35:54,624 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/transmitter.01.cil.c[706,719] [2022-07-12 06:35:54,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:35:54,644 INFO L208 MainTranslator]: Completed translation [2022-07-12 06:35:54,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:54 WrapperNode [2022-07-12 06:35:54,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 06:35:54,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 06:35:54,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 06:35:54,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 06:35:54,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:54" (1/1) ... [2022-07-12 06:35:54,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:54" (1/1) ... [2022-07-12 06:35:54,671 INFO L137 Inliner]: procedures = 30, calls = 33, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 209 [2022-07-12 06:35:54,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 06:35:54,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 06:35:54,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 06:35:54,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 06:35:54,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:54" (1/1) ... [2022-07-12 06:35:54,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:54" (1/1) ... [2022-07-12 06:35:54,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:54" (1/1) ... [2022-07-12 06:35:54,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:54" (1/1) ... [2022-07-12 06:35:54,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:54" (1/1) ... [2022-07-12 06:35:54,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:54" (1/1) ... [2022-07-12 06:35:54,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:54" (1/1) ... [2022-07-12 06:35:54,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 06:35:54,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 06:35:54,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 06:35:54,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 06:35:54,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:54" (1/1) ... [2022-07-12 06:35:54,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:35:54,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:35:54,724 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-12 06:35:54,726 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-12 06:35:54,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 06:35:54,757 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-12 06:35:54,757 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-12 06:35:54,757 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-12 06:35:54,757 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-12 06:35:54,757 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-12 06:35:54,757 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-12 06:35:54,757 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-12 06:35:54,757 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-12 06:35:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 06:35:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-12 06:35:54,758 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-12 06:35:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 06:35:54,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 06:35:54,807 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 06:35:54,808 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 06:35:55,001 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 06:35:55,006 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 06:35:55,007 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 06:35:55,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:35:55 BoogieIcfgContainer [2022-07-12 06:35:55,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 06:35:55,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 06:35:55,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 06:35:55,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 06:35:55,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:35:54" (1/3) ... [2022-07-12 06:35:55,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fbc3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:35:55, skipping insertion in model container [2022-07-12 06:35:55,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:35:54" (2/3) ... [2022-07-12 06:35:55,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fbc3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:35:55, skipping insertion in model container [2022-07-12 06:35:55,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:35:55" (3/3) ... [2022-07-12 06:35:55,014 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2022-07-12 06:35:55,023 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 06:35:55,023 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 06:35:55,057 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 06:35:55,062 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@2a737f45, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@40d2519e [2022-07-12 06:35:55,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 06:35:55,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 80 states have (on average 1.525) internal successors, (122), 82 states have internal predecessors, (122), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-12 06:35:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 06:35:55,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:35:55,074 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] [2022-07-12 06:35:55,075 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:35:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:35:55,079 INFO L85 PathProgramCache]: Analyzing trace with hash -20293138, now seen corresponding path program 1 times [2022-07-12 06:35:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:35:55,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595088055] [2022-07-12 06:35:55,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:35:55,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:35:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:35:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:55,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:35:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:55,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:35:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:55,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 06:35:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:55,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 06:35:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:55,410 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-12 06:35:55,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:35:55,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595088055] [2022-07-12 06:35:55,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595088055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:35:55,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:35:55,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:35:55,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086645925] [2022-07-12 06:35:55,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:35:55,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:35:55,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:35:55,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:35:55,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:35:55,445 INFO L87 Difference]: Start difference. First operand has 100 states, 80 states have (on average 1.525) internal successors, (122), 82 states have internal predecessors, (122), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:35:55,817 INFO L93 Difference]: Finished difference Result 210 states and 318 transitions. [2022-07-12 06:35:55,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 06:35:55,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-12 06:35:55,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:35:55,831 INFO L225 Difference]: With dead ends: 210 [2022-07-12 06:35:55,832 INFO L226 Difference]: Without dead ends: 115 [2022-07-12 06:35:55,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-12 06:35:55,838 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 197 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:35:55,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 357 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 06:35:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-12 06:35:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 95. [2022-07-12 06:35:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.381578947368421) internal successors, (105), 77 states have internal predecessors, (105), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-12 06:35:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 131 transitions. [2022-07-12 06:35:55,879 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 131 transitions. Word has length 55 [2022-07-12 06:35:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:35:55,879 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 131 transitions. [2022-07-12 06:35:55,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 131 transitions. [2022-07-12 06:35:55,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 06:35:55,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:35:55,881 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] [2022-07-12 06:35:55,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 06:35:55,881 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:35:55,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:35:55,882 INFO L85 PathProgramCache]: Analyzing trace with hash -917686416, now seen corresponding path program 1 times [2022-07-12 06:35:55,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:35:55,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005996923] [2022-07-12 06:35:55,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:35:55,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:35:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:55,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:35:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:55,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:35:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:55,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:35:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:55,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 06:35:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:55,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 06:35:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:55,988 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-12 06:35:55,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:35:55,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005996923] [2022-07-12 06:35:55,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005996923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:35:55,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:35:55,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:35:55,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947378872] [2022-07-12 06:35:55,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:35:55,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:35:55,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:35:55,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:35:55,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:35:55,995 INFO L87 Difference]: Start difference. First operand 95 states and 131 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:35:56,456 INFO L93 Difference]: Finished difference Result 334 states and 477 transitions. [2022-07-12 06:35:56,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 06:35:56,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-12 06:35:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:35:56,460 INFO L225 Difference]: With dead ends: 334 [2022-07-12 06:35:56,460 INFO L226 Difference]: Without dead ends: 248 [2022-07-12 06:35:56,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-12 06:35:56,462 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 336 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:35:56,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 635 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 06:35:56,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-12 06:35:56,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 175. [2022-07-12 06:35:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 143 states have internal predecessors, (195), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2022-07-12 06:35:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 246 transitions. [2022-07-12 06:35:56,497 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 246 transitions. Word has length 55 [2022-07-12 06:35:56,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:35:56,497 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 246 transitions. [2022-07-12 06:35:56,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 246 transitions. [2022-07-12 06:35:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 06:35:56,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:35:56,499 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] [2022-07-12 06:35:56,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 06:35:56,499 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:35:56,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:35:56,500 INFO L85 PathProgramCache]: Analyzing trace with hash -669539922, now seen corresponding path program 1 times [2022-07-12 06:35:56,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:35:56,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831422611] [2022-07-12 06:35:56,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:35:56,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:35:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:56,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:35:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:56,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:35:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:56,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:35:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:56,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 06:35:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:56,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 06:35:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:56,565 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-12 06:35:56,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:35:56,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831422611] [2022-07-12 06:35:56,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831422611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:35:56,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:35:56,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 06:35:56,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374213017] [2022-07-12 06:35:56,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:35:56,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 06:35:56,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:35:56,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 06:35:56,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 06:35:56,567 INFO L87 Difference]: Start difference. First operand 175 states and 246 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:35:56,901 INFO L93 Difference]: Finished difference Result 457 states and 644 transitions. [2022-07-12 06:35:56,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 06:35:56,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-12 06:35:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:35:56,908 INFO L225 Difference]: With dead ends: 457 [2022-07-12 06:35:56,909 INFO L226 Difference]: Without dead ends: 293 [2022-07-12 06:35:56,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-12 06:35:56,911 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 344 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:35:56,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 517 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:35:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-12 06:35:56,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 244. [2022-07-12 06:35:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 195 states have (on average 1.3743589743589744) internal successors, (268), 199 states have internal predecessors, (268), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-07-12 06:35:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 337 transitions. [2022-07-12 06:35:56,933 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 337 transitions. Word has length 55 [2022-07-12 06:35:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:35:56,933 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 337 transitions. [2022-07-12 06:35:56,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 337 transitions. [2022-07-12 06:35:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 06:35:56,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:35:56,934 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] [2022-07-12 06:35:56,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 06:35:56,935 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:35:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:35:56,935 INFO L85 PathProgramCache]: Analyzing trace with hash 455720047, now seen corresponding path program 1 times [2022-07-12 06:35:56,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:35:56,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339658420] [2022-07-12 06:35:56,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:35:56,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:35:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:56,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:35:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:56,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:35:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:56,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:35:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 06:35:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:57,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 06:35:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:57,015 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-12 06:35:57,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:35:57,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339658420] [2022-07-12 06:35:57,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339658420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:35:57,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:35:57,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:35:57,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153671035] [2022-07-12 06:35:57,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:35:57,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:35:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:35:57,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:35:57,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:35:57,018 INFO L87 Difference]: Start difference. First operand 244 states and 337 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:35:57,312 INFO L93 Difference]: Finished difference Result 519 states and 731 transitions. [2022-07-12 06:35:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 06:35:57,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-12 06:35:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:35:57,314 INFO L225 Difference]: With dead ends: 519 [2022-07-12 06:35:57,314 INFO L226 Difference]: Without dead ends: 286 [2022-07-12 06:35:57,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-12 06:35:57,316 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 155 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:35:57,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 455 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:35:57,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-12 06:35:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 247. [2022-07-12 06:35:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 198 states have (on average 1.3585858585858586) internal successors, (269), 202 states have internal predecessors, (269), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-07-12 06:35:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 338 transitions. [2022-07-12 06:35:57,354 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 338 transitions. Word has length 55 [2022-07-12 06:35:57,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:35:57,355 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 338 transitions. [2022-07-12 06:35:57,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 338 transitions. [2022-07-12 06:35:57,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 06:35:57,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:35:57,360 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] [2022-07-12 06:35:57,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 06:35:57,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:35:57,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:35:57,361 INFO L85 PathProgramCache]: Analyzing trace with hash 383333489, now seen corresponding path program 1 times [2022-07-12 06:35:57,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:35:57,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125430527] [2022-07-12 06:35:57,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:35:57,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:35:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:57,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:35:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:57,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:35:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:57,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:35:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:57,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 06:35:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:57,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 06:35:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:57,418 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-12 06:35:57,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:35:57,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125430527] [2022-07-12 06:35:57,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125430527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:35:57,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:35:57,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:35:57,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331621733] [2022-07-12 06:35:57,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:35:57,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:35:57,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:35:57,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:35:57,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:35:57,420 INFO L87 Difference]: Start difference. First operand 247 states and 338 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:57,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:35:57,694 INFO L93 Difference]: Finished difference Result 531 states and 743 transitions. [2022-07-12 06:35:57,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 06:35:57,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-12 06:35:57,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:35:57,697 INFO L225 Difference]: With dead ends: 531 [2022-07-12 06:35:57,697 INFO L226 Difference]: Without dead ends: 295 [2022-07-12 06:35:57,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-07-12 06:35:57,698 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 119 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:35:57,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 449 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:35:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-12 06:35:57,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2022-07-12 06:35:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 207 states have (on average 1.3429951690821256) internal successors, (278), 211 states have internal predecessors, (278), 31 states have call successors, (31), 15 states have call predecessors, (31), 17 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-07-12 06:35:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 347 transitions. [2022-07-12 06:35:57,715 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 347 transitions. Word has length 55 [2022-07-12 06:35:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:35:57,716 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 347 transitions. [2022-07-12 06:35:57,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 347 transitions. [2022-07-12 06:35:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 06:35:57,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:35:57,717 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] [2022-07-12 06:35:57,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 06:35:57,718 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:35:57,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:35:57,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1988405773, now seen corresponding path program 1 times [2022-07-12 06:35:57,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:35:57,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708387747] [2022-07-12 06:35:57,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:35:57,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:35:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:57,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:35:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:57,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:35:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:57,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:35:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:57,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 06:35:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:57,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 06:35:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:57,784 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-12 06:35:57,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:35:57,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708387747] [2022-07-12 06:35:57,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708387747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:35:57,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:35:57,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:35:57,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703527369] [2022-07-12 06:35:57,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:35:57,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:35:57,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:35:57,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:35:57,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:35:57,787 INFO L87 Difference]: Start difference. First operand 256 states and 347 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:35:58,073 INFO L93 Difference]: Finished difference Result 654 states and 887 transitions. [2022-07-12 06:35:58,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 06:35:58,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-12 06:35:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:35:58,076 INFO L225 Difference]: With dead ends: 654 [2022-07-12 06:35:58,076 INFO L226 Difference]: Without dead ends: 476 [2022-07-12 06:35:58,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-12 06:35:58,078 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 366 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:35:58,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 402 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:35:58,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-07-12 06:35:58,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 411. [2022-07-12 06:35:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 337 states have (on average 1.3293768545994065) internal successors, (448), 343 states have internal predecessors, (448), 45 states have call successors, (45), 25 states have call predecessors, (45), 28 states have return successors, (50), 44 states have call predecessors, (50), 45 states have call successors, (50) [2022-07-12 06:35:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 543 transitions. [2022-07-12 06:35:58,099 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 543 transitions. Word has length 55 [2022-07-12 06:35:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:35:58,100 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 543 transitions. [2022-07-12 06:35:58,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 543 transitions. [2022-07-12 06:35:58,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 06:35:58,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:35:58,101 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] [2022-07-12 06:35:58,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 06:35:58,101 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:35:58,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:35:58,102 INFO L85 PathProgramCache]: Analyzing trace with hash 501123189, now seen corresponding path program 1 times [2022-07-12 06:35:58,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:35:58,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597537001] [2022-07-12 06:35:58,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:35:58,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:35:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:35:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:35:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:35:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 06:35:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 06:35:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,151 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-12 06:35:58,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:35:58,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597537001] [2022-07-12 06:35:58,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597537001] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:35:58,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:35:58,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:35:58,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169544553] [2022-07-12 06:35:58,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:35:58,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:35:58,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:35:58,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:35:58,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:35:58,153 INFO L87 Difference]: Start difference. First operand 411 states and 543 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:35:58,327 INFO L93 Difference]: Finished difference Result 848 states and 1126 transitions. [2022-07-12 06:35:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 06:35:58,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-12 06:35:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:35:58,330 INFO L225 Difference]: With dead ends: 848 [2022-07-12 06:35:58,330 INFO L226 Difference]: Without dead ends: 448 [2022-07-12 06:35:58,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 06:35:58,331 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 220 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:35:58,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 319 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:35:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-07-12 06:35:58,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 410. [2022-07-12 06:35:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 336 states have (on average 1.2946428571428572) internal successors, (435), 342 states have internal predecessors, (435), 45 states have call successors, (45), 25 states have call predecessors, (45), 28 states have return successors, (50), 44 states have call predecessors, (50), 45 states have call successors, (50) [2022-07-12 06:35:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 530 transitions. [2022-07-12 06:35:58,353 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 530 transitions. Word has length 55 [2022-07-12 06:35:58,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:35:58,353 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 530 transitions. [2022-07-12 06:35:58,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:58,353 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 530 transitions. [2022-07-12 06:35:58,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 06:35:58,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:35:58,354 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] [2022-07-12 06:35:58,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 06:35:58,354 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:35:58,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:35:58,354 INFO L85 PathProgramCache]: Analyzing trace with hash 719977907, now seen corresponding path program 1 times [2022-07-12 06:35:58,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:35:58,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625695851] [2022-07-12 06:35:58,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:35:58,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:35:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:35:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:35:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:35:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 06:35:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 06:35:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,416 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-12 06:35:58,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:35:58,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625695851] [2022-07-12 06:35:58,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625695851] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:35:58,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:35:58,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 06:35:58,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447947241] [2022-07-12 06:35:58,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:35:58,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 06:35:58,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:35:58,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 06:35:58,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 06:35:58,419 INFO L87 Difference]: Start difference. First operand 410 states and 530 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:58,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:35:58,623 INFO L93 Difference]: Finished difference Result 1248 states and 1632 transitions. [2022-07-12 06:35:58,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 06:35:58,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2022-07-12 06:35:58,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:35:58,628 INFO L225 Difference]: With dead ends: 1248 [2022-07-12 06:35:58,628 INFO L226 Difference]: Without dead ends: 849 [2022-07-12 06:35:58,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-07-12 06:35:58,630 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 324 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:35:58,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 291 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:35:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-07-12 06:35:58,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 787. [2022-07-12 06:35:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 644 states have (on average 1.2763975155279503) internal successors, (822), 655 states have internal predecessors, (822), 85 states have call successors, (85), 50 states have call predecessors, (85), 57 states have return successors, (113), 85 states have call predecessors, (113), 85 states have call successors, (113) [2022-07-12 06:35:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1020 transitions. [2022-07-12 06:35:58,690 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1020 transitions. Word has length 55 [2022-07-12 06:35:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:35:58,691 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1020 transitions. [2022-07-12 06:35:58,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:35:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1020 transitions. [2022-07-12 06:35:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 06:35:58,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:35:58,694 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] [2022-07-12 06:35:58,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 06:35:58,694 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:35:58,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:35:58,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1595512707, now seen corresponding path program 1 times [2022-07-12 06:35:58,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:35:58,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756289818] [2022-07-12 06:35:58,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:35:58,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:35:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:35:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:35:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:35:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 06:35:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 06:35:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:58,748 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-12 06:35:58,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:35:58,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756289818] [2022-07-12 06:35:58,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756289818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:35:58,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:35:58,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:35:58,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434670602] [2022-07-12 06:35:58,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:35:58,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:35:58,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:35:58,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:35:58,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:35:58,751 INFO L87 Difference]: Start difference. First operand 787 states and 1020 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-12 06:35:58,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:35:58,952 INFO L93 Difference]: Finished difference Result 2374 states and 3066 transitions. [2022-07-12 06:35:58,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 06:35:58,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2022-07-12 06:35:58,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:35:58,958 INFO L225 Difference]: With dead ends: 2374 [2022-07-12 06:35:58,958 INFO L226 Difference]: Without dead ends: 1601 [2022-07-12 06:35:58,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 06:35:58,960 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 264 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:35:58,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 276 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:35:58,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-07-12 06:35:59,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1471. [2022-07-12 06:35:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1193 states have (on average 1.2514668901927912) internal successors, (1493), 1213 states have internal predecessors, (1493), 163 states have call successors, (163), 100 states have call predecessors, (163), 114 states have return successors, (217), 161 states have call predecessors, (217), 163 states have call successors, (217) [2022-07-12 06:35:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 1873 transitions. [2022-07-12 06:35:59,042 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 1873 transitions. Word has length 56 [2022-07-12 06:35:59,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:35:59,042 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 1873 transitions. [2022-07-12 06:35:59,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-12 06:35:59,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1873 transitions. [2022-07-12 06:35:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-12 06:35:59,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:35:59,043 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 06:35:59,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 06:35:59,043 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:35:59,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:35:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1907953452, now seen corresponding path program 1 times [2022-07-12 06:35:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:35:59,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998650448] [2022-07-12 06:35:59,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:35:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:35:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:59,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:35:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:59,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 06:35:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:59,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:35:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:59,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 06:35:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:59,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 06:35:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:59,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 06:35:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:35:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 06:35:59,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:35:59,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998650448] [2022-07-12 06:35:59,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998650448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:35:59,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:35:59,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 06:35:59,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908924887] [2022-07-12 06:35:59,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:35:59,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 06:35:59,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:35:59,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 06:35:59,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 06:35:59,102 INFO L87 Difference]: Start difference. First operand 1471 states and 1873 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 06:35:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:35:59,544 INFO L93 Difference]: Finished difference Result 4511 states and 5775 transitions. [2022-07-12 06:35:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 06:35:59,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2022-07-12 06:35:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:35:59,555 INFO L225 Difference]: With dead ends: 4511 [2022-07-12 06:35:59,556 INFO L226 Difference]: Without dead ends: 2340 [2022-07-12 06:35:59,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-07-12 06:35:59,561 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 500 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:35:59,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 529 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 06:35:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2022-07-12 06:35:59,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2209. [2022-07-12 06:35:59,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 1786 states have (on average 1.232922732362822) internal successors, (2202), 1825 states have internal predecessors, (2202), 241 states have call successors, (241), 150 states have call predecessors, (241), 181 states have return successors, (375), 237 states have call predecessors, (375), 241 states have call successors, (375) [2022-07-12 06:35:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2818 transitions. [2022-07-12 06:35:59,679 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2818 transitions. Word has length 73 [2022-07-12 06:35:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:35:59,679 INFO L495 AbstractCegarLoop]: Abstraction has 2209 states and 2818 transitions. [2022-07-12 06:35:59,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 06:35:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2818 transitions. [2022-07-12 06:35:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 06:35:59,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:35:59,682 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:35:59,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 06:35:59,682 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:35:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:35:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash 175805213, now seen corresponding path program 1 times [2022-07-12 06:35:59,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:35:59,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336275371] [2022-07-12 06:35:59,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:35:59,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:35:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:35:59,692 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 06:35:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:35:59,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 06:35:59,718 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 06:35:59,719 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 06:35:59,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 06:35:59,722 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:35:59,725 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 06:35:59,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:35:59 BoogieIcfgContainer [2022-07-12 06:35:59,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 06:35:59,767 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 06:35:59,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 06:35:59,768 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 06:35:59,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:35:55" (3/4) ... [2022-07-12 06:35:59,769 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 06:35:59,810 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 06:35:59,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 06:35:59,811 INFO L158 Benchmark]: Toolchain (without parser) took 5365.25ms. Allocated memory was 109.1MB in the beginning and 234.9MB in the end (delta: 125.8MB). Free memory was 69.8MB in the beginning and 175.1MB in the end (delta: -105.3MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-07-12 06:35:59,811 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory was 86.7MB in the beginning and 86.6MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:35:59,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.23ms. Allocated memory is still 109.1MB. Free memory was 69.6MB in the beginning and 82.4MB in the end (delta: -12.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 06:35:59,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.40ms. Allocated memory is still 109.1MB. Free memory was 82.4MB in the beginning and 80.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:35:59,812 INFO L158 Benchmark]: Boogie Preprocessor took 21.70ms. Allocated memory is still 109.1MB. Free memory was 80.3MB in the beginning and 79.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:35:59,812 INFO L158 Benchmark]: RCFGBuilder took 313.49ms. Allocated memory is still 109.1MB. Free memory was 78.6MB in the beginning and 64.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 06:35:59,813 INFO L158 Benchmark]: TraceAbstraction took 4757.51ms. Allocated memory was 109.1MB in the beginning and 234.9MB in the end (delta: 125.8MB). Free memory was 63.8MB in the beginning and 181.4MB in the end (delta: -117.6MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-07-12 06:35:59,813 INFO L158 Benchmark]: Witness Printer took 43.40ms. Allocated memory is still 234.9MB. Free memory was 181.4MB in the beginning and 175.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 06:35:59,814 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.17ms. Allocated memory is still 109.1MB. Free memory was 86.7MB in the beginning and 86.6MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.23ms. Allocated memory is still 109.1MB. Free memory was 69.6MB in the beginning and 82.4MB in the end (delta: -12.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.40ms. Allocated memory is still 109.1MB. Free memory was 82.4MB in the beginning and 80.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.70ms. Allocated memory is still 109.1MB. Free memory was 80.3MB in the beginning and 79.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 313.49ms. Allocated memory is still 109.1MB. Free memory was 78.6MB in the beginning and 64.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4757.51ms. Allocated memory was 109.1MB in the beginning and 234.9MB in the end (delta: 125.8MB). Free memory was 63.8MB in the beginning and 181.4MB in the end (delta: -117.6MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Witness Printer took 43.40ms. Allocated memory is still 234.9MB. Free memory was 181.4MB in the beginning and 175.1MB 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int m_i ; [L30] int t1_i ; [L31] int M_E = 2; [L32] int T1_E = 2; [L33] int E_1 = 2; VAL [E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L449] int __retres1 ; [L453] CALL init_model() [L364] m_i = 1 [L365] t1_i = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L453] RET init_model() [L454] CALL start_simulation() [L390] int kernel_st ; [L391] int tmp ; [L392] int tmp___0 ; [L396] kernel_st = 0 VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L397] FCALL update_channels() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] CALL init_threads() [L161] COND TRUE m_i == 1 [L162] m_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] COND TRUE t1_i == 1 [L167] t1_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L398] RET init_threads() [L399] CALL fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L255] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L260] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L399] RET fire_delta_events() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L400] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L125] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L127] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L144] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L146] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L400] RET activate_threads() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L401] CALL reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L278] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(T1_E)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L401] RET reset_delta_events() VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L404] COND TRUE 1 VAL [E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L407] kernel_st = 1 [L408] CALL eval() [L197] int tmp ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L176] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [__retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L192] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L93] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L95] t1_pc = 1 [L96] t1_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L231] RET transmit1() [L201] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L204] CALL, EXPR exists_runnable_thread() VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L176] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 VAL [__retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L192] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L204] RET, EXPR exists_runnable_thread() VAL [E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1] [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND TRUE \read(tmp_ndt_1) [L216] m_st = 1 [L217] CALL master() [L41] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L52] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L55] E_1 = 1 [L56] CALL immediate_notify() [L322] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L293] int tmp ; [L294] int tmp___0 ; [L298] CALL, EXPR is_master_triggered() [L112] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L127] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L298] RET, EXPR is_master_triggered() [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L306] CALL, EXPR is_transmit1_triggered() [L131] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L134] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L135] COND TRUE E_1 == 1 [L136] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L146] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L306] RET, EXPR is_transmit1_triggered() [L306] tmp___0 = is_transmit1_triggered() [L308] COND TRUE \read(tmp___0) [L309] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L322] RET activate_threads() VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L56] RET immediate_notify() [L57] E_1 = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L60] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L62] m_pc = 1 [L63] m_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L217] RET master() [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND TRUE \read(tmp_ndt_2) [L230] t1_st = 1 [L231] CALL transmit1() [L82] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L85] COND TRUE t1_pc == 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L101] CALL error() [L21] reach_error() VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2914 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2825 mSDsluCounter, 4230 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2766 mSDsCounter, 631 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3115 IncrementalHoareTripleChecker+Invalid, 3746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 631 mSolverCounterUnsat, 1464 mSDtfsCounter, 3115 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2209occurred in iteration=10, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 646 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 664 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 559 ConstructedInterpolants, 0 QuantifiedInterpolants, 1169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 14/14 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 RESULT: Ultimate proved your program to be incorrect! [2022-07-12 06:35:59,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE