./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/transmitter.02.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 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 18:16:40,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:16:40,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:16:40,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:16:40,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:16:40,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:16:40,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:16:40,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:16:40,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:16:40,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:16:40,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:16:40,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:16:40,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:16:40,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:16:40,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:16:40,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:16:40,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:16:40,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:16:40,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:16:40,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:16:40,625 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:16:40,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:16:40,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:16:40,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:16:40,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:16:40,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:16:40,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:16:40,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:16:40,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:16:40,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:16:40,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:16:40,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:16:40,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:16:40,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:16:40,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:16:40,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:16:40,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:16:40,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:16:40,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:16:40,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:16:40,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:16:40,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:16:40,636 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 18:16:40,654 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:16:40,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:16:40,656 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:16:40,656 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:16:40,657 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:16:40,657 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:16:40,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:16:40,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:16:40,658 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:16:40,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:16:40,659 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:16:40,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:16:40,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:16:40,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:16:40,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:16:40,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:16:40,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:16:40,660 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:16:40,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:16:40,661 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:16:40,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:16:40,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:16:40,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:16:40,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:16:40,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:16:40,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:16:40,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:16:40,662 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:16:40,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:16:40,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:16:40,663 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:16:40,663 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:16:40,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:16:40,663 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 -> 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c [2022-07-13 18:16:40,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:16:40,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:16:40,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:16:40,867 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:16:40,867 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:16:40,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.02.cil.c [2022-07-13 18:16:40,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e0f9c42/7ce716d96ba7496e83f2fd47d5d85dd6/FLAGfc01b5a39 [2022-07-13 18:16:41,293 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:16:41,294 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2022-07-13 18:16:41,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e0f9c42/7ce716d96ba7496e83f2fd47d5d85dd6/FLAGfc01b5a39 [2022-07-13 18:16:41,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e0f9c42/7ce716d96ba7496e83f2fd47d5d85dd6 [2022-07-13 18:16:41,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:16:41,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:16:41,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:16:41,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:16:41,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:16:41,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:16:41" (1/1) ... [2022-07-13 18:16:41,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@332aed0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:41, skipping insertion in model container [2022-07-13 18:16:41,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:16:41" (1/1) ... [2022-07-13 18:16:41,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:16:41,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:16:41,432 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.02.cil.c[706,719] [2022-07-13 18:16:41,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:16:41,483 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:16:41,494 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.02.cil.c[706,719] [2022-07-13 18:16:41,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:16:41,534 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:16:41,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:41 WrapperNode [2022-07-13 18:16:41,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:16:41,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:16:41,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:16:41,536 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:16:41,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:41" (1/1) ... [2022-07-13 18:16:41,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:41" (1/1) ... [2022-07-13 18:16:41,576 INFO L137 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 264 [2022-07-13 18:16:41,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:16:41,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:16:41,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:16:41,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:16:41,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:41" (1/1) ... [2022-07-13 18:16:41,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:41" (1/1) ... [2022-07-13 18:16:41,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:41" (1/1) ... [2022-07-13 18:16:41,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:41" (1/1) ... [2022-07-13 18:16:41,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:41" (1/1) ... [2022-07-13 18:16:41,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:41" (1/1) ... [2022-07-13 18:16:41,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:41" (1/1) ... [2022-07-13 18:16:41,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:16:41,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:16:41,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:16:41,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:16:41,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:41" (1/1) ... [2022-07-13 18:16:41,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:16:41,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:16:41,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 18:16:41,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 18:16:41,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:16:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-07-13 18:16:41,649 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-07-13 18:16:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-07-13 18:16:41,649 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-07-13 18:16:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-13 18:16:41,649 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-13 18:16:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-07-13 18:16:41,649 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-07-13 18:16:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-07-13 18:16:41,650 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-07-13 18:16:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:16:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-07-13 18:16:41,650 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-07-13 18:16:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:16:41,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:16:41,702 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:16:41,703 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:16:41,996 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:16:42,002 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:16:42,002 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-13 18:16:42,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:16:42 BoogieIcfgContainer [2022-07-13 18:16:42,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:16:42,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:16:42,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:16:42,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:16:42,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:16:41" (1/3) ... [2022-07-13 18:16:42,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63411cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:16:42, skipping insertion in model container [2022-07-13 18:16:42,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:16:41" (2/3) ... [2022-07-13 18:16:42,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63411cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:16:42, skipping insertion in model container [2022-07-13 18:16:42,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:16:42" (3/3) ... [2022-07-13 18:16:42,017 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2022-07-13 18:16:42,026 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:16:42,027 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:16:42,076 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:16:42,082 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@5e6eb5b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58c2821a [2022-07-13 18:16:42,082 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:16:42,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-13 18:16:42,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 18:16:42,092 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:42,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:42,092 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:42,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:42,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2055872345, now seen corresponding path program 1 times [2022-07-13 18:16:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:42,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080166191] [2022-07-13 18:16:42,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:42,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:42,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:42,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080166191] [2022-07-13 18:16:42,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080166191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:42,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:42,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:16:42,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55912737] [2022-07-13 18:16:42,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:42,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:16:42,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:42,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:16:42,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:16:42,348 INFO L87 Difference]: Start difference. First operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:42,645 INFO L93 Difference]: Finished difference Result 277 states and 425 transitions. [2022-07-13 18:16:42,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:16:42,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2022-07-13 18:16:42,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:42,653 INFO L225 Difference]: With dead ends: 277 [2022-07-13 18:16:42,653 INFO L226 Difference]: Without dead ends: 153 [2022-07-13 18:16:42,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:16:42,658 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 268 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:42,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 325 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:16:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-13 18:16:42,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2022-07-13 18:16:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-13 18:16:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2022-07-13 18:16:42,723 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 67 [2022-07-13 18:16:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:42,724 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2022-07-13 18:16:42,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 18:16:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2022-07-13 18:16:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 18:16:42,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:42,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:42,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:16:42,728 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:42,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:42,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1622143259, now seen corresponding path program 1 times [2022-07-13 18:16:42,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:42,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852053406] [2022-07-13 18:16:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:42,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:42,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:42,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852053406] [2022-07-13 18:16:42,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852053406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:42,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:42,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:16:42,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767510624] [2022-07-13 18:16:42,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:42,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:16:42,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:42,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:16:42,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:16:42,857 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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-13 18:16:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:43,406 INFO L93 Difference]: Finished difference Result 406 states and 597 transitions. [2022-07-13 18:16:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:16:43,406 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), 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 67 [2022-07-13 18:16:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:43,409 INFO L225 Difference]: With dead ends: 406 [2022-07-13 18:16:43,409 INFO L226 Difference]: Without dead ends: 293 [2022-07-13 18:16:43,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:16:43,411 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 377 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:43,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 501 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:16:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-13 18:16:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 233. [2022-07-13 18:16:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.443298969072165) internal successors, (280), 196 states have internal predecessors, (280), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-13 18:16:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 333 transitions. [2022-07-13 18:16:43,431 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 333 transitions. Word has length 67 [2022-07-13 18:16:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:43,431 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 333 transitions. [2022-07-13 18:16:43,432 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), 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-13 18:16:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 333 transitions. [2022-07-13 18:16:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 18:16:43,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:43,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:43,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 18:16:43,434 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:43,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:43,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1762963514, now seen corresponding path program 1 times [2022-07-13 18:16:43,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:43,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979052352] [2022-07-13 18:16:43,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:43,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:43,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:43,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979052352] [2022-07-13 18:16:43,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979052352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:43,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:43,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:16:43,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354806737] [2022-07-13 18:16:43,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:43,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:16:43,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:43,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:16:43,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:43,527 INFO L87 Difference]: Start difference. First operand 233 states and 333 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-13 18:16:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:43,861 INFO L93 Difference]: Finished difference Result 516 states and 750 transitions. [2022-07-13 18:16:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 18:16:43,862 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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 67 [2022-07-13 18:16:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:43,864 INFO L225 Difference]: With dead ends: 516 [2022-07-13 18:16:43,864 INFO L226 Difference]: Without dead ends: 293 [2022-07-13 18:16:43,865 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-13 18:16:43,866 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 279 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:43,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 446 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:16:43,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-13 18:16:43,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 233. [2022-07-13 18:16:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.4329896907216495) internal successors, (278), 196 states have internal predecessors, (278), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-07-13 18:16:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 331 transitions. [2022-07-13 18:16:43,895 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 331 transitions. Word has length 67 [2022-07-13 18:16:43,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:43,896 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 331 transitions. [2022-07-13 18:16:43,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-13 18:16:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 331 transitions. [2022-07-13 18:16:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 18:16:43,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:43,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:43,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 18:16:43,898 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:43,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:43,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1655984776, now seen corresponding path program 1 times [2022-07-13 18:16:43,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:43,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871433784] [2022-07-13 18:16:43,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:43,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:43,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:43,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871433784] [2022-07-13 18:16:43,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871433784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:43,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:43,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:16:43,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369554983] [2022-07-13 18:16:43,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:43,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:16:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:43,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:16:43,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:43,963 INFO L87 Difference]: Start difference. First operand 233 states and 331 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-13 18:16:44,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:44,580 INFO L93 Difference]: Finished difference Result 689 states and 986 transitions. [2022-07-13 18:16:44,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 18:16:44,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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 67 [2022-07-13 18:16:44,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:44,584 INFO L225 Difference]: With dead ends: 689 [2022-07-13 18:16:44,585 INFO L226 Difference]: Without dead ends: 466 [2022-07-13 18:16:44,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 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-13 18:16:44,595 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 384 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:44,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 887 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 18:16:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-07-13 18:16:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 337. [2022-07-13 18:16:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 281 states have (on average 1.4234875444839858) internal successors, (400), 284 states have internal predecessors, (400), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-07-13 18:16:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 475 transitions. [2022-07-13 18:16:44,616 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 475 transitions. Word has length 67 [2022-07-13 18:16:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:44,617 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 475 transitions. [2022-07-13 18:16:44,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-13 18:16:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 475 transitions. [2022-07-13 18:16:44,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 18:16:44,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:44,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:44,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 18:16:44,618 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:44,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:44,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1212084102, now seen corresponding path program 1 times [2022-07-13 18:16:44,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:44,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408758364] [2022-07-13 18:16:44,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:44,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:44,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:44,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:44,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:44,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:44,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:44,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:44,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408758364] [2022-07-13 18:16:44,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408758364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:44,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:44,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:16:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537352756] [2022-07-13 18:16:44,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:44,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:16:44,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:44,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:16:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:44,729 INFO L87 Difference]: Start difference. First operand 337 states and 475 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-13 18:16:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:45,387 INFO L93 Difference]: Finished difference Result 1074 states and 1524 transitions. [2022-07-13 18:16:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 18:16:45,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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 67 [2022-07-13 18:16:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:45,392 INFO L225 Difference]: With dead ends: 1074 [2022-07-13 18:16:45,393 INFO L226 Difference]: Without dead ends: 747 [2022-07-13 18:16:45,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-13 18:16:45,398 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 396 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:45,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 854 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 18:16:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-07-13 18:16:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 544. [2022-07-13 18:16:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 456 states have (on average 1.4232456140350878) internal successors, (649), 461 states have internal predecessors, (649), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-07-13 18:16:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 768 transitions. [2022-07-13 18:16:45,435 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 768 transitions. Word has length 67 [2022-07-13 18:16:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:45,435 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 768 transitions. [2022-07-13 18:16:45,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-13 18:16:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 768 transitions. [2022-07-13 18:16:45,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 18:16:45,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:45,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:45,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 18:16:45,441 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:45,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:45,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1054297084, now seen corresponding path program 1 times [2022-07-13 18:16:45,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:45,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317828294] [2022-07-13 18:16:45,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:45,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:45,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:45,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:45,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:45,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:45,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:45,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:45,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317828294] [2022-07-13 18:16:45,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317828294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:45,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:45,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:16:45,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319512723] [2022-07-13 18:16:45,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:45,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:16:45,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:45,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:16:45,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:45,550 INFO L87 Difference]: Start difference. First operand 544 states and 768 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-13 18:16:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:45,971 INFO L93 Difference]: Finished difference Result 1203 states and 1727 transitions. [2022-07-13 18:16:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 18:16:45,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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 67 [2022-07-13 18:16:45,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:45,975 INFO L225 Difference]: With dead ends: 1203 [2022-07-13 18:16:45,975 INFO L226 Difference]: Without dead ends: 670 [2022-07-13 18:16:45,976 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-13 18:16:45,977 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 254 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:45,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 580 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:16:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-07-13 18:16:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 547. [2022-07-13 18:16:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 459 states have (on average 1.411764705882353) internal successors, (648), 464 states have internal predecessors, (648), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-07-13 18:16:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 767 transitions. [2022-07-13 18:16:46,000 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 767 transitions. Word has length 67 [2022-07-13 18:16:46,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:46,000 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 767 transitions. [2022-07-13 18:16:46,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-13 18:16:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 767 transitions. [2022-07-13 18:16:46,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 18:16:46,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:46,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:46,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 18:16:46,001 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:46,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:46,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1302443578, now seen corresponding path program 1 times [2022-07-13 18:16:46,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:46,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858413722] [2022-07-13 18:16:46,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:46,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:46,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:46,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:46,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:46,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:46,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:46,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:46,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858413722] [2022-07-13 18:16:46,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858413722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:46,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:46,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:16:46,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711685501] [2022-07-13 18:16:46,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:46,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:16:46,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:46,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:16:46,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:46,060 INFO L87 Difference]: Start difference. First operand 547 states and 767 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-13 18:16:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:46,459 INFO L93 Difference]: Finished difference Result 1269 states and 1814 transitions. [2022-07-13 18:16:46,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 18:16:46,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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 67 [2022-07-13 18:16:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:46,463 INFO L225 Difference]: With dead ends: 1269 [2022-07-13 18:16:46,463 INFO L226 Difference]: Without dead ends: 733 [2022-07-13 18:16:46,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-07-13 18:16:46,465 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 254 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:46,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 569 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:16:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2022-07-13 18:16:46,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 562. [2022-07-13 18:16:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 474 states have (on average 1.3987341772151898) internal successors, (663), 479 states have internal predecessors, (663), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-07-13 18:16:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 782 transitions. [2022-07-13 18:16:46,495 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 782 transitions. Word has length 67 [2022-07-13 18:16:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:46,495 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 782 transitions. [2022-07-13 18:16:46,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-13 18:16:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 782 transitions. [2022-07-13 18:16:46,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 18:16:46,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:46,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:46,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 18:16:46,499 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:46,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:46,499 INFO L85 PathProgramCache]: Analyzing trace with hash 908076792, now seen corresponding path program 1 times [2022-07-13 18:16:46,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:46,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226376307] [2022-07-13 18:16:46,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:46,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:46,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:46,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:46,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:46,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:46,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:46,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:46,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226376307] [2022-07-13 18:16:46,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226376307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:46,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:46,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:16:46,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192380185] [2022-07-13 18:16:46,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:46,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:16:46,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:46,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:16:46,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:46,613 INFO L87 Difference]: Start difference. First operand 562 states and 782 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-13 18:16:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:47,473 INFO L93 Difference]: Finished difference Result 2996 states and 4324 transitions. [2022-07-13 18:16:47,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 18:16:47,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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 67 [2022-07-13 18:16:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:47,482 INFO L225 Difference]: With dead ends: 2996 [2022-07-13 18:16:47,483 INFO L226 Difference]: Without dead ends: 2445 [2022-07-13 18:16:47,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-13 18:16:47,486 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 1008 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:47,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 848 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 18:16:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2022-07-13 18:16:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 1559. [2022-07-13 18:16:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1314 states have (on average 1.3987823439878235) internal successors, (1838), 1332 states have internal predecessors, (1838), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-07-13 18:16:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2171 transitions. [2022-07-13 18:16:47,567 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2171 transitions. Word has length 67 [2022-07-13 18:16:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:47,568 INFO L495 AbstractCegarLoop]: Abstraction has 1559 states and 2171 transitions. [2022-07-13 18:16:47,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-13 18:16:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2171 transitions. [2022-07-13 18:16:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 18:16:47,569 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:47,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:47,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 18:16:47,570 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:47,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:47,571 INFO L85 PathProgramCache]: Analyzing trace with hash 918077039, now seen corresponding path program 1 times [2022-07-13 18:16:47,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:47,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040327193] [2022-07-13 18:16:47,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:47,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:47,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:47,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:47,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:47,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:47,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:16:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 18:16:47,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:47,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040327193] [2022-07-13 18:16:47,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040327193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:47,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:47,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:16:47,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253606422] [2022-07-13 18:16:47,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:47,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:16:47,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:47,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:16:47,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:47,631 INFO L87 Difference]: Start difference. First operand 1559 states and 2171 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-13 18:16:48,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:48,070 INFO L93 Difference]: Finished difference Result 3474 states and 4944 transitions. [2022-07-13 18:16:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 18:16:48,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 84 [2022-07-13 18:16:48,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:48,078 INFO L225 Difference]: With dead ends: 3474 [2022-07-13 18:16:48,078 INFO L226 Difference]: Without dead ends: 1926 [2022-07-13 18:16:48,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-07-13 18:16:48,081 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 171 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:48,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 569 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:16:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2022-07-13 18:16:48,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1589. [2022-07-13 18:16:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1344 states have (on average 1.3861607142857142) internal successors, (1863), 1362 states have internal predecessors, (1863), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-07-13 18:16:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2196 transitions. [2022-07-13 18:16:48,193 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2196 transitions. Word has length 84 [2022-07-13 18:16:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:48,193 INFO L495 AbstractCegarLoop]: Abstraction has 1589 states and 2196 transitions. [2022-07-13 18:16:48,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-13 18:16:48,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2196 transitions. [2022-07-13 18:16:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 18:16:48,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:48,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:48,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 18:16:48,195 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:48,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:48,196 INFO L85 PathProgramCache]: Analyzing trace with hash 564988657, now seen corresponding path program 1 times [2022-07-13 18:16:48,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:48,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032538164] [2022-07-13 18:16:48,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:48,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:48,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:48,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:48,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:48,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:48,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:16:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 18:16:48,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:48,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032538164] [2022-07-13 18:16:48,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032538164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:48,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:48,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:16:48,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985374199] [2022-07-13 18:16:48,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:48,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:16:48,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:48,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:16:48,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:48,255 INFO L87 Difference]: Start difference. First operand 1589 states and 2196 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-13 18:16:48,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:48,551 INFO L93 Difference]: Finished difference Result 3422 states and 4752 transitions. [2022-07-13 18:16:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:16:48,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 84 [2022-07-13 18:16:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:48,558 INFO L225 Difference]: With dead ends: 3422 [2022-07-13 18:16:48,559 INFO L226 Difference]: Without dead ends: 1845 [2022-07-13 18:16:48,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 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-13 18:16:48,563 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 326 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:48,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 415 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:16:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2022-07-13 18:16:48,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1577. [2022-07-13 18:16:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1332 states have (on average 1.3626126126126126) internal successors, (1815), 1350 states have internal predecessors, (1815), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-07-13 18:16:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2148 transitions. [2022-07-13 18:16:48,642 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2148 transitions. Word has length 84 [2022-07-13 18:16:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:48,642 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 2148 transitions. [2022-07-13 18:16:48,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-13 18:16:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2148 transitions. [2022-07-13 18:16:48,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 18:16:48,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:48,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:48,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 18:16:48,644 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:48,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:48,644 INFO L85 PathProgramCache]: Analyzing trace with hash 813135151, now seen corresponding path program 1 times [2022-07-13 18:16:48,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:48,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18785086] [2022-07-13 18:16:48,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:48,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:48,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:48,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:48,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:48,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:48,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:48,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:16:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 18:16:48,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:48,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18785086] [2022-07-13 18:16:48,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18785086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:48,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:48,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 18:16:48,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454248120] [2022-07-13 18:16:48,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:48,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:16:48,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:48,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:16:48,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:16:48,724 INFO L87 Difference]: Start difference. First operand 1577 states and 2148 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 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-13 18:16:49,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:49,395 INFO L93 Difference]: Finished difference Result 2572 states and 3512 transitions. [2022-07-13 18:16:49,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 18:16:49,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 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 84 [2022-07-13 18:16:49,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:49,401 INFO L225 Difference]: With dead ends: 2572 [2022-07-13 18:16:49,401 INFO L226 Difference]: Without dead ends: 1597 [2022-07-13 18:16:49,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-07-13 18:16:49,404 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 485 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:49,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 656 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:16:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2022-07-13 18:16:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1258. [2022-07-13 18:16:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1061 states have (on average 1.349670122525919) internal successors, (1432), 1072 states have internal predecessors, (1432), 119 states have call successors, (119), 71 states have call predecessors, (119), 77 states have return successors, (140), 116 states have call predecessors, (140), 119 states have call successors, (140) [2022-07-13 18:16:49,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1691 transitions. [2022-07-13 18:16:49,466 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1691 transitions. Word has length 84 [2022-07-13 18:16:49,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:49,466 INFO L495 AbstractCegarLoop]: Abstraction has 1258 states and 1691 transitions. [2022-07-13 18:16:49,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 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-13 18:16:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1691 transitions. [2022-07-13 18:16:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 18:16:49,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:49,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:49,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 18:16:49,468 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:49,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1236781873, now seen corresponding path program 1 times [2022-07-13 18:16:49,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:49,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561809105] [2022-07-13 18:16:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:49,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:49,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:49,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:49,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:49,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:49,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:49,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:16:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-13 18:16:49,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:49,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561809105] [2022-07-13 18:16:49,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561809105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:49,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:49,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 18:16:49,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777018603] [2022-07-13 18:16:49,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:49,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:16:49,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:49,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:16:49,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:16:49,522 INFO L87 Difference]: Start difference. First operand 1258 states and 1691 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 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-13 18:16:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:50,135 INFO L93 Difference]: Finished difference Result 2777 states and 3732 transitions. [2022-07-13 18:16:50,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 18:16:50,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 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 84 [2022-07-13 18:16:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:50,142 INFO L225 Difference]: With dead ends: 2777 [2022-07-13 18:16:50,142 INFO L226 Difference]: Without dead ends: 1622 [2022-07-13 18:16:50,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2022-07-13 18:16:50,145 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 610 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:50,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 593 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:16:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2022-07-13 18:16:50,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1246. [2022-07-13 18:16:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1052 states have (on average 1.3450570342205324) internal successors, (1415), 1060 states have internal predecessors, (1415), 119 states have call successors, (119), 71 states have call predecessors, (119), 74 states have return successors, (133), 115 states have call predecessors, (133), 119 states have call successors, (133) [2022-07-13 18:16:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1667 transitions. [2022-07-13 18:16:50,251 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1667 transitions. Word has length 84 [2022-07-13 18:16:50,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:50,252 INFO L495 AbstractCegarLoop]: Abstraction has 1246 states and 1667 transitions. [2022-07-13 18:16:50,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 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-13 18:16:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1667 transitions. [2022-07-13 18:16:50,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 18:16:50,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:50,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:50,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 18:16:50,254 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:50,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:50,255 INFO L85 PathProgramCache]: Analyzing trace with hash -608585293, now seen corresponding path program 1 times [2022-07-13 18:16:50,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:50,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986165970] [2022-07-13 18:16:50,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:50,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:16:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-13 18:16:50,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:50,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986165970] [2022-07-13 18:16:50,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986165970] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:16:50,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70843475] [2022-07-13 18:16:50,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:50,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:16:50,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:16:50,303 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:16:50,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 18:16:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 18:16:50,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:16:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:50,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:16:50,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70843475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:50,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:16:50,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-13 18:16:50,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010310932] [2022-07-13 18:16:50,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:50,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:50,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:50,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:50,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:50,388 INFO L87 Difference]: Start difference. First operand 1246 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 18:16:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:50,519 INFO L93 Difference]: Finished difference Result 2883 states and 3926 transitions. [2022-07-13 18:16:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:50,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 84 [2022-07-13 18:16:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:50,526 INFO L225 Difference]: With dead ends: 2883 [2022-07-13 18:16:50,526 INFO L226 Difference]: Without dead ends: 2039 [2022-07-13 18:16:50,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:50,528 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 129 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:50,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 474 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2022-07-13 18:16:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2039. [2022-07-13 18:16:50,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2039 states, 1721 states have (on average 1.335270191748983) internal successors, (2298), 1731 states have internal predecessors, (2298), 194 states have call successors, (194), 118 states have call predecessors, (194), 123 states have return successors, (258), 190 states have call predecessors, (258), 194 states have call successors, (258) [2022-07-13 18:16:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2750 transitions. [2022-07-13 18:16:50,626 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2750 transitions. Word has length 84 [2022-07-13 18:16:50,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:50,626 INFO L495 AbstractCegarLoop]: Abstraction has 2039 states and 2750 transitions. [2022-07-13 18:16:50,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 18:16:50,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2750 transitions. [2022-07-13 18:16:50,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 18:16:50,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:50,627 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:50,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 18:16:50,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 18:16:50,845 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:50,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:50,845 INFO L85 PathProgramCache]: Analyzing trace with hash -55730782, now seen corresponding path program 1 times [2022-07-13 18:16:50,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:50,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468742409] [2022-07-13 18:16:50,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:50,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:16:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:16:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 18:16:50,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:50,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468742409] [2022-07-13 18:16:50,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468742409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:50,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:50,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:16:50,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278808172] [2022-07-13 18:16:50,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:50,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:16:50,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:50,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:16:50,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:50,941 INFO L87 Difference]: Start difference. First operand 2039 states and 2750 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:16:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:51,511 INFO L93 Difference]: Finished difference Result 6620 states and 9061 transitions. [2022-07-13 18:16:51,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:16:51,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2022-07-13 18:16:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:51,530 INFO L225 Difference]: With dead ends: 6620 [2022-07-13 18:16:51,531 INFO L226 Difference]: Without dead ends: 4593 [2022-07-13 18:16:51,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:16:51,538 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 611 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:51,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 501 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:16:51,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2022-07-13 18:16:51,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4197. [2022-07-13 18:16:51,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4197 states, 3533 states have (on average 1.3102179450891593) internal successors, (4629), 3587 states have internal predecessors, (4629), 366 states have call successors, (366), 230 states have call predecessors, (366), 297 states have return successors, (707), 381 states have call predecessors, (707), 366 states have call successors, (707) [2022-07-13 18:16:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4197 states to 4197 states and 5702 transitions. [2022-07-13 18:16:51,875 INFO L78 Accepts]: Start accepts. Automaton has 4197 states and 5702 transitions. Word has length 99 [2022-07-13 18:16:51,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:51,875 INFO L495 AbstractCegarLoop]: Abstraction has 4197 states and 5702 transitions. [2022-07-13 18:16:51,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:16:51,876 INFO L276 IsEmpty]: Start isEmpty. Operand 4197 states and 5702 transitions. [2022-07-13 18:16:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 18:16:51,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:51,877 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:51,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 18:16:51,877 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:51,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:51,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1996312796, now seen corresponding path program 1 times [2022-07-13 18:16:51,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:51,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627006390] [2022-07-13 18:16:51,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:51,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:51,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:51,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:51,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:51,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:51,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:51,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:16:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:16:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 18:16:51,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:51,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627006390] [2022-07-13 18:16:51,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627006390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:51,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:51,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:16:51,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746933759] [2022-07-13 18:16:51,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:51,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:16:51,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:51,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:16:51,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:16:51,913 INFO L87 Difference]: Start difference. First operand 4197 states and 5702 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:16:52,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:52,301 INFO L93 Difference]: Finished difference Result 8948 states and 12144 transitions. [2022-07-13 18:16:52,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:16:52,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2022-07-13 18:16:52,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:52,316 INFO L225 Difference]: With dead ends: 8948 [2022-07-13 18:16:52,317 INFO L226 Difference]: Without dead ends: 4762 [2022-07-13 18:16:52,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:16:52,325 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 323 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:52,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 266 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:16:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4762 states. [2022-07-13 18:16:52,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4762 to 4192. [2022-07-13 18:16:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4192 states, 3531 states have (on average 1.3101104502973662) internal successors, (4626), 3584 states have internal predecessors, (4626), 363 states have call successors, (363), 230 states have call predecessors, (363), 297 states have return successors, (703), 378 states have call predecessors, (703), 363 states have call successors, (703) [2022-07-13 18:16:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4192 states to 4192 states and 5692 transitions. [2022-07-13 18:16:52,586 INFO L78 Accepts]: Start accepts. Automaton has 4192 states and 5692 transitions. Word has length 99 [2022-07-13 18:16:52,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:52,586 INFO L495 AbstractCegarLoop]: Abstraction has 4192 states and 5692 transitions. [2022-07-13 18:16:52,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 18:16:52,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4192 states and 5692 transitions. [2022-07-13 18:16:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 18:16:52,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:52,588 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:52,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 18:16:52,588 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:52,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1243137275, now seen corresponding path program 1 times [2022-07-13 18:16:52,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:52,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962469151] [2022-07-13 18:16:52,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:52,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:52,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:52,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:52,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:52,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:52,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 18:16:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:52,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:16:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 18:16:52,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:52,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962469151] [2022-07-13 18:16:52,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962469151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:52,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:16:52,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:16:52,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221996745] [2022-07-13 18:16:52,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:52,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:16:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:52,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:16:52,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:16:52,633 INFO L87 Difference]: Start difference. First operand 4192 states and 5692 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 18:16:53,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:53,241 INFO L93 Difference]: Finished difference Result 9970 states and 13687 transitions. [2022-07-13 18:16:53,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:16:53,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2022-07-13 18:16:53,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:53,266 INFO L225 Difference]: With dead ends: 9970 [2022-07-13 18:16:53,270 INFO L226 Difference]: Without dead ends: 6565 [2022-07-13 18:16:53,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 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-13 18:16:53,278 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 417 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:53,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 352 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:16:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6565 states. [2022-07-13 18:16:53,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6565 to 5725. [2022-07-13 18:16:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5725 states, 4816 states have (on average 1.3054401993355482) internal successors, (6287), 4881 states have internal predecessors, (6287), 504 states have call successors, (504), 321 states have call predecessors, (504), 404 states have return successors, (923), 523 states have call predecessors, (923), 504 states have call successors, (923) [2022-07-13 18:16:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5725 states to 5725 states and 7714 transitions. [2022-07-13 18:16:53,605 INFO L78 Accepts]: Start accepts. Automaton has 5725 states and 7714 transitions. Word has length 100 [2022-07-13 18:16:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:53,605 INFO L495 AbstractCegarLoop]: Abstraction has 5725 states and 7714 transitions. [2022-07-13 18:16:53,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 18:16:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 5725 states and 7714 transitions. [2022-07-13 18:16:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 18:16:53,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:53,608 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:53,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 18:16:53,608 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:53,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:53,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1869458483, now seen corresponding path program 1 times [2022-07-13 18:16:53,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:53,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470930516] [2022-07-13 18:16:53,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:53,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:53,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:53,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:53,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:53,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:53,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:53,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 18:16:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:53,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:16:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:53,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:16:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 18:16:53,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:53,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470930516] [2022-07-13 18:16:53,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470930516] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:16:53,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237308339] [2022-07-13 18:16:53,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:53,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:16:53,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:16:53,665 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:16:53,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 18:16:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:53,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 18:16:53,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:16:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 18:16:53,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:16:53,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237308339] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:53,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:16:53,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2022-07-13 18:16:53,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34199689] [2022-07-13 18:16:53,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:53,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:53,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:53,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:53,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:53,805 INFO L87 Difference]: Start difference. First operand 5725 states and 7714 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 18:16:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:54,192 INFO L93 Difference]: Finished difference Result 13443 states and 18129 transitions. [2022-07-13 18:16:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:54,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 117 [2022-07-13 18:16:54,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:54,215 INFO L225 Difference]: With dead ends: 13443 [2022-07-13 18:16:54,216 INFO L226 Difference]: Without dead ends: 7715 [2022-07-13 18:16:54,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:54,231 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 86 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:54,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 368 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7715 states. [2022-07-13 18:16:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7715 to 7649. [2022-07-13 18:16:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7649 states, 6430 states have (on average 1.3021772939346812) internal successors, (8373), 6510 states have internal predecessors, (8373), 682 states have call successors, (682), 438 states have call predecessors, (682), 536 states have return successors, (1154), 701 states have call predecessors, (1154), 682 states have call successors, (1154) [2022-07-13 18:16:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7649 states to 7649 states and 10209 transitions. [2022-07-13 18:16:54,708 INFO L78 Accepts]: Start accepts. Automaton has 7649 states and 10209 transitions. Word has length 117 [2022-07-13 18:16:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:54,709 INFO L495 AbstractCegarLoop]: Abstraction has 7649 states and 10209 transitions. [2022-07-13 18:16:54,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 18:16:54,709 INFO L276 IsEmpty]: Start isEmpty. Operand 7649 states and 10209 transitions. [2022-07-13 18:16:54,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-13 18:16:54,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:54,714 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:54,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 18:16:54,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 18:16:54,931 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash 964798723, now seen corresponding path program 1 times [2022-07-13 18:16:54,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:54,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079881030] [2022-07-13 18:16:54,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:54,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:54,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:54,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:54,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:54,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:54,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:54,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 18:16:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:54,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 18:16:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:54,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:16:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 18:16:54,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:54,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079881030] [2022-07-13 18:16:54,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079881030] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:16:54,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288289141] [2022-07-13 18:16:54,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:54,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:16:54,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:16:54,993 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:16:55,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 18:16:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:55,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 18:16:55,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:16:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 18:16:55,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:16:55,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288289141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:55,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:16:55,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-13 18:16:55,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848162926] [2022-07-13 18:16:55,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:55,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:55,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:55,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:55,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:55,129 INFO L87 Difference]: Start difference. First operand 7649 states and 10209 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 18:16:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:55,636 INFO L93 Difference]: Finished difference Result 16201 states and 22003 transitions. [2022-07-13 18:16:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:55,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 118 [2022-07-13 18:16:55,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:55,659 INFO L225 Difference]: With dead ends: 16201 [2022-07-13 18:16:55,660 INFO L226 Difference]: Without dead ends: 9348 [2022-07-13 18:16:55,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:55,675 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 121 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:55,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 221 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:55,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9348 states. [2022-07-13 18:16:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9348 to 9241. [2022-07-13 18:16:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9241 states, 7848 states have (on average 1.2719164118246686) internal successors, (9982), 7944 states have internal predecessors, (9982), 758 states have call successors, (758), 529 states have call predecessors, (758), 634 states have return successors, (1380), 768 states have call predecessors, (1380), 758 states have call successors, (1380) [2022-07-13 18:16:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9241 states to 9241 states and 12120 transitions. [2022-07-13 18:16:56,198 INFO L78 Accepts]: Start accepts. Automaton has 9241 states and 12120 transitions. Word has length 118 [2022-07-13 18:16:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:56,199 INFO L495 AbstractCegarLoop]: Abstraction has 9241 states and 12120 transitions. [2022-07-13 18:16:56,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 18:16:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 9241 states and 12120 transitions. [2022-07-13 18:16:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 18:16:56,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:56,202 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:56,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 18:16:56,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 18:16:56,421 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:56,422 INFO L85 PathProgramCache]: Analyzing trace with hash -36607372, now seen corresponding path program 1 times [2022-07-13 18:16:56,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:56,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99716220] [2022-07-13 18:16:56,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:56,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:56,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:56,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:56,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:56,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:56,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:56,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:16:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:56,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 18:16:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:56,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:16:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 18:16:56,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:56,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99716220] [2022-07-13 18:16:56,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99716220] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:16:56,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560063669] [2022-07-13 18:16:56,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:56,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:16:56,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:16:56,484 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:16:56,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 18:16:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:56,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 18:16:56,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:16:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:16:56,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:16:56,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560063669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:56,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:16:56,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-13 18:16:56,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029593118] [2022-07-13 18:16:56,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:56,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:56,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:56,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:56,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:56,569 INFO L87 Difference]: Start difference. First operand 9241 states and 12120 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 18:16:57,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:57,113 INFO L93 Difference]: Finished difference Result 16957 states and 22181 transitions. [2022-07-13 18:16:57,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:57,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 121 [2022-07-13 18:16:57,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:57,137 INFO L225 Difference]: With dead ends: 16957 [2022-07-13 18:16:57,137 INFO L226 Difference]: Without dead ends: 9930 [2022-07-13 18:16:57,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:16:57,151 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 121 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:57,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 440 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9930 states. [2022-07-13 18:16:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9930 to 9843. [2022-07-13 18:16:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9843 states, 8423 states have (on average 1.2614270449958447) internal successors, (10625), 8525 states have internal predecessors, (10625), 758 states have call successors, (758), 550 states have call predecessors, (758), 661 states have return successors, (1272), 768 states have call predecessors, (1272), 758 states have call successors, (1272) [2022-07-13 18:16:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 12655 transitions. [2022-07-13 18:16:57,829 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 12655 transitions. Word has length 121 [2022-07-13 18:16:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:16:57,830 INFO L495 AbstractCegarLoop]: Abstraction has 9843 states and 12655 transitions. [2022-07-13 18:16:57,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-13 18:16:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 12655 transitions. [2022-07-13 18:16:57,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-13 18:16:57,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:16:57,835 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:16:57,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 18:16:58,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:16:58,047 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:16:58,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:16:58,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1792814822, now seen corresponding path program 1 times [2022-07-13 18:16:58,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:16:58,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396414706] [2022-07-13 18:16:58,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:58,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:16:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:58,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:16:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:16:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:16:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:16:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:58,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:16:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:58,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 18:16:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:58,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 18:16:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:58,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:16:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:58,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 18:16:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:58,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:16:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 18:16:58,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:16:58,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396414706] [2022-07-13 18:16:58,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396414706] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:16:58,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414899343] [2022-07-13 18:16:58,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:16:58,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:16:58,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:16:58,109 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:16:58,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 18:16:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:16:58,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 18:16:58,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:16:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-13 18:16:58,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:16:58,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414899343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:16:58,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:16:58,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-07-13 18:16:58,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997392659] [2022-07-13 18:16:58,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:16:58,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:16:58,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:16:58,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:16:58,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:16:58,207 INFO L87 Difference]: Start difference. First operand 9843 states and 12655 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 18:16:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:16:59,432 INFO L93 Difference]: Finished difference Result 28741 states and 37387 transitions. [2022-07-13 18:16:59,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:16:59,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 153 [2022-07-13 18:16:59,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:16:59,489 INFO L225 Difference]: With dead ends: 28741 [2022-07-13 18:16:59,490 INFO L226 Difference]: Without dead ends: 18910 [2022-07-13 18:16:59,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:16:59,512 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 147 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:16:59,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 364 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:16:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18910 states. [2022-07-13 18:17:00,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18910 to 18895. [2022-07-13 18:17:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18895 states, 16195 states have (on average 1.250077184316147) internal successors, (20245), 16388 states have internal predecessors, (20245), 1433 states have call successors, (1433), 1059 states have call predecessors, (1433), 1266 states have return successors, (2696), 1449 states have call predecessors, (2696), 1433 states have call successors, (2696) [2022-07-13 18:17:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18895 states to 18895 states and 24374 transitions. [2022-07-13 18:17:00,689 INFO L78 Accepts]: Start accepts. Automaton has 18895 states and 24374 transitions. Word has length 153 [2022-07-13 18:17:00,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:17:00,689 INFO L495 AbstractCegarLoop]: Abstraction has 18895 states and 24374 transitions. [2022-07-13 18:17:00,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-13 18:17:00,690 INFO L276 IsEmpty]: Start isEmpty. Operand 18895 states and 24374 transitions. [2022-07-13 18:17:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-13 18:17:00,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:17:00,697 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:17:00,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 18:17:00,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:17:00,911 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:17:00,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:17:00,912 INFO L85 PathProgramCache]: Analyzing trace with hash -970215938, now seen corresponding path program 1 times [2022-07-13 18:17:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:17:00,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874129172] [2022-07-13 18:17:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:17:00,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:17:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:00,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:17:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:00,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:17:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:00,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:17:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:00,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:17:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:00,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:17:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:00,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 18:17:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:00,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 18:17:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:00,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:17:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:00,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 18:17:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:00,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:17:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-13 18:17:00,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:17:00,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874129172] [2022-07-13 18:17:00,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874129172] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:17:00,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162727798] [2022-07-13 18:17:00,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:17:00,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:17:00,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:17:00,977 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:17:00,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 18:17:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:01,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 18:17:01,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:17:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 18:17:01,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:17:01,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162727798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:17:01,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:17:01,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-07-13 18:17:01,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460041359] [2022-07-13 18:17:01,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:17:01,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:17:01,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:17:01,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:17:01,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:17:01,083 INFO L87 Difference]: Start difference. First operand 18895 states and 24374 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 18:17:02,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:17:02,081 INFO L93 Difference]: Finished difference Result 29234 states and 38669 transitions. [2022-07-13 18:17:02,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:17:02,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 154 [2022-07-13 18:17:02,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:17:02,138 INFO L225 Difference]: With dead ends: 29234 [2022-07-13 18:17:02,138 INFO L226 Difference]: Without dead ends: 18527 [2022-07-13 18:17:02,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:17:02,163 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 118 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:17:02,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 461 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:17:02,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18527 states. [2022-07-13 18:17:03,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18527 to 18465. [2022-07-13 18:17:03,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18465 states, 15765 states have (on average 1.238883602917856) internal successors, (19531), 15958 states have internal predecessors, (19531), 1433 states have call successors, (1433), 1059 states have call predecessors, (1433), 1266 states have return successors, (2696), 1449 states have call predecessors, (2696), 1433 states have call successors, (2696) [2022-07-13 18:17:03,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18465 states to 18465 states and 23660 transitions. [2022-07-13 18:17:03,476 INFO L78 Accepts]: Start accepts. Automaton has 18465 states and 23660 transitions. Word has length 154 [2022-07-13 18:17:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:17:03,477 INFO L495 AbstractCegarLoop]: Abstraction has 18465 states and 23660 transitions. [2022-07-13 18:17:03,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 18:17:03,477 INFO L276 IsEmpty]: Start isEmpty. Operand 18465 states and 23660 transitions. [2022-07-13 18:17:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-13 18:17:03,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:17:03,484 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:17:03,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-13 18:17:03,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:17:03,702 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:17:03,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:17:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1358937995, now seen corresponding path program 1 times [2022-07-13 18:17:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:17:03,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398009057] [2022-07-13 18:17:03,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:17:03,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:17:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:03,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:17:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:03,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:17:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:03,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:17:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:03,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:17:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:03,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:17:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:03,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 18:17:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:03,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 18:17:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:03,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:17:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:03,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:17:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:03,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:17:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 18:17:03,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:17:03,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398009057] [2022-07-13 18:17:03,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398009057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:17:03,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:17:03,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:17:03,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504744629] [2022-07-13 18:17:03,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:17:03,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:17:03,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:17:03,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:17:03,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:17:03,774 INFO L87 Difference]: Start difference. First operand 18465 states and 23660 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 18:17:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:17:05,368 INFO L93 Difference]: Finished difference Result 33725 states and 43529 transitions. [2022-07-13 18:17:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:17:05,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 155 [2022-07-13 18:17:05,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:17:05,428 INFO L225 Difference]: With dead ends: 33725 [2022-07-13 18:17:05,428 INFO L226 Difference]: Without dead ends: 17956 [2022-07-13 18:17:05,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 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-13 18:17:05,457 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 561 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:17:05,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 586 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:17:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17956 states. [2022-07-13 18:17:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17956 to 16098. [2022-07-13 18:17:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16098 states, 13792 states have (on average 1.2261455916473318) internal successors, (16911), 13972 states have internal predecessors, (16911), 1207 states have call successors, (1207), 894 states have call predecessors, (1207), 1098 states have return successors, (2059), 1233 states have call predecessors, (2059), 1207 states have call successors, (2059) [2022-07-13 18:17:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16098 states to 16098 states and 20177 transitions. [2022-07-13 18:17:06,434 INFO L78 Accepts]: Start accepts. Automaton has 16098 states and 20177 transitions. Word has length 155 [2022-07-13 18:17:06,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:17:06,434 INFO L495 AbstractCegarLoop]: Abstraction has 16098 states and 20177 transitions. [2022-07-13 18:17:06,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 18:17:06,435 INFO L276 IsEmpty]: Start isEmpty. Operand 16098 states and 20177 transitions. [2022-07-13 18:17:06,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-13 18:17:06,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:17:06,440 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:17:06,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 18:17:06,441 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:17:06,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:17:06,441 INFO L85 PathProgramCache]: Analyzing trace with hash 217702764, now seen corresponding path program 1 times [2022-07-13 18:17:06,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:17:06,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147552196] [2022-07-13 18:17:06,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:17:06,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:17:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:06,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:17:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:06,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:17:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:06,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:17:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:06,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:17:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:06,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:17:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:06,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 18:17:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:06,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 18:17:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:06,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:17:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:06,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:17:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:06,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:17:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 37 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-13 18:17:06,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:17:06,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147552196] [2022-07-13 18:17:06,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147552196] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:17:06,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597097787] [2022-07-13 18:17:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:17:06,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:17:06,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:17:06,502 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:17:06,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 18:17:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:06,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 18:17:06,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:17:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 18:17:06,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:17:06,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597097787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:17:06,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:17:06,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-07-13 18:17:06,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460022279] [2022-07-13 18:17:06,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:17:06,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:17:06,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:17:06,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:17:06,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:17:06,646 INFO L87 Difference]: Start difference. First operand 16098 states and 20177 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 18:17:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:17:07,609 INFO L93 Difference]: Finished difference Result 28643 states and 36407 transitions. [2022-07-13 18:17:07,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:17:07,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 156 [2022-07-13 18:17:07,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:17:07,648 INFO L225 Difference]: With dead ends: 28643 [2022-07-13 18:17:07,648 INFO L226 Difference]: Without dead ends: 16151 [2022-07-13 18:17:07,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:17:07,670 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 90 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:17:07,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 402 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:17:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16151 states. [2022-07-13 18:17:08,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16151 to 16082. [2022-07-13 18:17:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16082 states, 13776 states have (on average 1.2047038327526132) internal successors, (16596), 13956 states have internal predecessors, (16596), 1207 states have call successors, (1207), 894 states have call predecessors, (1207), 1098 states have return successors, (2059), 1233 states have call predecessors, (2059), 1207 states have call successors, (2059) [2022-07-13 18:17:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16082 states to 16082 states and 19862 transitions. [2022-07-13 18:17:08,601 INFO L78 Accepts]: Start accepts. Automaton has 16082 states and 19862 transitions. Word has length 156 [2022-07-13 18:17:08,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:17:08,601 INFO L495 AbstractCegarLoop]: Abstraction has 16082 states and 19862 transitions. [2022-07-13 18:17:08,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 18:17:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 16082 states and 19862 transitions. [2022-07-13 18:17:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-13 18:17:08,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:17:08,607 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:17:08,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 18:17:08,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:17:08,824 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:17:08,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:17:08,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1852604969, now seen corresponding path program 2 times [2022-07-13 18:17:08,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:17:08,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219064414] [2022-07-13 18:17:08,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:17:08,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:17:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:08,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 18:17:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:08,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 18:17:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:08,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 18:17:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:08,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 18:17:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:08,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:17:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:08,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 18:17:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:08,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 18:17:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:08,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:17:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:08,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 18:17:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:08,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 18:17:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:17:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-13 18:17:08,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:17:08,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219064414] [2022-07-13 18:17:08,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219064414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:17:08,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:17:08,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 18:17:08,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203542096] [2022-07-13 18:17:08,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:17:08,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:17:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:17:08,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:17:08,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:17:08,885 INFO L87 Difference]: Start difference. First operand 16082 states and 19862 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 18:17:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:17:11,001 INFO L93 Difference]: Finished difference Result 40643 states and 51929 transitions. [2022-07-13 18:17:11,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 18:17:11,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 156 [2022-07-13 18:17:11,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:17:11,066 INFO L225 Difference]: With dead ends: 40643 [2022-07-13 18:17:11,067 INFO L226 Difference]: Without dead ends: 24579 [2022-07-13 18:17:11,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2022-07-13 18:17:11,106 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 912 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:17:11,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 504 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 18:17:11,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24579 states. [2022-07-13 18:17:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24579 to 23029. [2022-07-13 18:17:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23029 states, 19688 states have (on average 1.1473994311255586) internal successors, (22590), 20035 states have internal predecessors, (22590), 1643 states have call successors, (1643), 1326 states have call predecessors, (1643), 1697 states have return successors, (3030), 1669 states have call predecessors, (3030), 1643 states have call successors, (3030) [2022-07-13 18:17:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23029 states to 23029 states and 27263 transitions. [2022-07-13 18:17:12,650 INFO L78 Accepts]: Start accepts. Automaton has 23029 states and 27263 transitions. Word has length 156 [2022-07-13 18:17:12,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:17:12,656 INFO L495 AbstractCegarLoop]: Abstraction has 23029 states and 27263 transitions. [2022-07-13 18:17:12,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-13 18:17:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 23029 states and 27263 transitions. [2022-07-13 18:17:12,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-13 18:17:12,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:17:12,663 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:17:12,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 18:17:12,663 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:17:12,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:17:12,664 INFO L85 PathProgramCache]: Analyzing trace with hash -217774742, now seen corresponding path program 1 times [2022-07-13 18:17:12,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:17:12,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560091892] [2022-07-13 18:17:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:17:12,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:17:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:17:12,675 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 18:17:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:17:12,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 18:17:12,718 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 18:17:12,719 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 18:17:12,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 18:17:12,723 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:17:12,726 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 18:17:12,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:17:12 BoogieIcfgContainer [2022-07-13 18:17:12,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 18:17:12,831 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 18:17:12,832 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 18:17:12,832 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 18:17:12,832 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:16:42" (3/4) ... [2022-07-13 18:17:12,833 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 18:17:12,890 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 18:17:12,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 18:17:12,891 INFO L158 Benchmark]: Toolchain (without parser) took 31580.68ms. Allocated memory was 96.5MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 64.5MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 332.3MB. Max. memory is 16.1GB. [2022-07-13 18:17:12,891 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 79.7MB. Free memory was 50.1MB in the beginning and 50.1MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:17:12,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.23ms. Allocated memory is still 96.5MB. Free memory was 64.5MB in the beginning and 70.5MB in the end (delta: -6.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 18:17:12,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.23ms. Allocated memory is still 96.5MB. Free memory was 70.5MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:17:12,892 INFO L158 Benchmark]: Boogie Preprocessor took 24.92ms. Allocated memory is still 96.5MB. Free memory was 68.4MB in the beginning and 66.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:17:12,892 INFO L158 Benchmark]: RCFGBuilder took 408.22ms. Allocated memory is still 96.5MB. Free memory was 66.8MB in the beginning and 50.1MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 18:17:12,892 INFO L158 Benchmark]: TraceAbstraction took 30818.74ms. Allocated memory was 96.5MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 49.6MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 307.5MB. Max. memory is 16.1GB. [2022-07-13 18:17:12,892 INFO L158 Benchmark]: Witness Printer took 59.20ms. Allocated memory is still 4.6GB. Free memory was 4.3GB in the beginning and 4.3GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 18:17:12,893 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.09ms. Allocated memory is still 79.7MB. Free memory was 50.1MB in the beginning and 50.1MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.23ms. Allocated memory is still 96.5MB. Free memory was 64.5MB in the beginning and 70.5MB in the end (delta: -6.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.23ms. Allocated memory is still 96.5MB. Free memory was 70.5MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.92ms. Allocated memory is still 96.5MB. Free memory was 68.4MB in the beginning and 66.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 408.22ms. Allocated memory is still 96.5MB. Free memory was 66.8MB in the beginning and 50.1MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 30818.74ms. Allocated memory was 96.5MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 49.6MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 307.5MB. Max. memory is 16.1GB. * Witness Printer took 59.20ms. Allocated memory is still 4.6GB. Free memory was 4.3GB in the beginning and 4.3GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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 t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; VAL [E_1=2, E_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L349] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L354] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L523] RET fire_delta_events() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0] [L524] RET activate_threads() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L382] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L387] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] RET reset_delta_events() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L136] t2_pc = 1 [L137] t2_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L315] RET transmit2() [L271] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 [L287] CALL master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L61] E_1 = 1 VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0] [L435] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1] [L435] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.7s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8635 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8448 mSDsluCounter, 12182 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7022 mSDsCounter, 1514 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8818 IncrementalHoareTripleChecker+Invalid, 10332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1514 mSolverCounterUnsat, 5160 mSDtfsCounter, 8818 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1550 GetRequests, 1299 SyntacticMatches, 2 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23029occurred in iteration=24, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 8602 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3444 NumberOfCodeBlocks, 3444 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3256 ConstructedInterpolants, 0 QuantifiedInterpolants, 6782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2763 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 31 InterpolantComputations, 24 PerfectInterpolantSequences, 865/990 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-13 18:17:12,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE