./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-16 01:08:38,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 01:08:38,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 01:08:38,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 01:08:38,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 01:08:38,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 01:08:38,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 01:08:38,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 01:08:38,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 01:08:38,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 01:08:38,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 01:08:38,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 01:08:38,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 01:08:38,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 01:08:38,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 01:08:38,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 01:08:38,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 01:08:38,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 01:08:38,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 01:08:38,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 01:08:38,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 01:08:38,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 01:08:38,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 01:08:38,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 01:08:38,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 01:08:38,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 01:08:38,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 01:08:38,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 01:08:38,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 01:08:38,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 01:08:38,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 01:08:38,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 01:08:38,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 01:08:38,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 01:08:38,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 01:08:38,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 01:08:38,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 01:08:38,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 01:08:38,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 01:08:38,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 01:08:38,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 01:08:38,450 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 01:08:38,478 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 01:08:38,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 01:08:38,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 01:08:38,479 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 01:08:38,479 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 01:08:38,479 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 01:08:38,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 01:08:38,480 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 01:08:38,480 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 01:08:38,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 01:08:38,481 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 01:08:38,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 01:08:38,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 01:08:38,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 01:08:38,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 01:08:38,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 01:08:38,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 01:08:38,482 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 01:08:38,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 01:08:38,482 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 01:08:38,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 01:08:38,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 01:08:38,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 01:08:38,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 01:08:38,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:08:38,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 01:08:38,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 01:08:38,483 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 01:08:38,484 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 01:08:38,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 01:08:38,484 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 01:08:38,484 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 01:08:38,484 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 01:08:38,484 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 01:08:38,485 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 [2021-12-16 01:08:38,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 01:08:38,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 01:08:38,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 01:08:38,711 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 01:08:38,711 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 01:08:38,712 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.02.cil.c [2021-12-16 01:08:38,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f92477c/c3b2eaded507451b825c8ac81f82331b/FLAGb4ff88909 [2021-12-16 01:08:39,169 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 01:08:39,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2021-12-16 01:08:39,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f92477c/c3b2eaded507451b825c8ac81f82331b/FLAGb4ff88909 [2021-12-16 01:08:39,192 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f92477c/c3b2eaded507451b825c8ac81f82331b [2021-12-16 01:08:39,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 01:08:39,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 01:08:39,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 01:08:39,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 01:08:39,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 01:08:39,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:08:39" (1/1) ... [2021-12-16 01:08:39,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@365ee4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:39, skipping insertion in model container [2021-12-16 01:08:39,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 01:08:39" (1/1) ... [2021-12-16 01:08:39,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 01:08:39,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 01:08:39,412 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] [2021-12-16 01:08:39,444 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:08:39,455 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 01:08:39,464 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] [2021-12-16 01:08:39,489 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 01:08:39,501 INFO L208 MainTranslator]: Completed translation [2021-12-16 01:08:39,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:39 WrapperNode [2021-12-16 01:08:39,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 01:08:39,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 01:08:39,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 01:08:39,503 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 01:08:39,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:39" (1/1) ... [2021-12-16 01:08:39,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:39" (1/1) ... [2021-12-16 01:08:39,551 INFO L137 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 264 [2021-12-16 01:08:39,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 01:08:39,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 01:08:39,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 01:08:39,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 01:08:39,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:39" (1/1) ... [2021-12-16 01:08:39,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:39" (1/1) ... [2021-12-16 01:08:39,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:39" (1/1) ... [2021-12-16 01:08:39,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:39" (1/1) ... [2021-12-16 01:08:39,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:39" (1/1) ... [2021-12-16 01:08:39,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:39" (1/1) ... [2021-12-16 01:08:39,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:39" (1/1) ... [2021-12-16 01:08:39,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 01:08:39,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 01:08:39,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 01:08:39,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 01:08:39,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:39" (1/1) ... [2021-12-16 01:08:39,608 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 01:08:39,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:08:39,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) [2021-12-16 01:08:39,650 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 [2021-12-16 01:08:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 01:08:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-16 01:08:39,664 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-16 01:08:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-16 01:08:39,664 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-16 01:08:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-16 01:08:39,664 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-16 01:08:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-16 01:08:39,664 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-16 01:08:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-16 01:08:39,665 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-16 01:08:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 01:08:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-16 01:08:39,665 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-16 01:08:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 01:08:39,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 01:08:39,739 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 01:08:39,741 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 01:08:40,053 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 01:08:40,059 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 01:08:40,059 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-16 01:08:40,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:08:40 BoogieIcfgContainer [2021-12-16 01:08:40,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 01:08:40,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 01:08:40,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 01:08:40,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 01:08:40,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 01:08:39" (1/3) ... [2021-12-16 01:08:40,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1459f348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:08:40, skipping insertion in model container [2021-12-16 01:08:40,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 01:08:39" (2/3) ... [2021-12-16 01:08:40,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1459f348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 01:08:40, skipping insertion in model container [2021-12-16 01:08:40,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:08:40" (3/3) ... [2021-12-16 01:08:40,073 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2021-12-16 01:08:40,078 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 01:08:40,079 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 01:08:40,126 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 01:08:40,132 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 01:08:40,133 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 01:08:40,151 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) [2021-12-16 01:08:40,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 01:08:40,158 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:40,159 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:40,160 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2055872345, now seen corresponding path program 1 times [2021-12-16 01:08:40,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:40,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211028262] [2021-12-16 01:08:40,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:40,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:40,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:40,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:40,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:40,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:40,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:40,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:40,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211028262] [2021-12-16 01:08:40,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211028262] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:40,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:40,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 01:08:40,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345972633] [2021-12-16 01:08:40,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:40,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 01:08:40,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:40,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 01:08:40,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:08:40,466 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) [2021-12-16 01:08:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:40,868 INFO L93 Difference]: Finished difference Result 277 states and 425 transitions. [2021-12-16 01:08:40,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 01:08:40,872 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 [2021-12-16 01:08:40,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:40,879 INFO L225 Difference]: With dead ends: 277 [2021-12-16 01:08:40,880 INFO L226 Difference]: Without dead ends: 153 [2021-12-16 01:08:40,882 INFO L932 BasicCegarLoop]: 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 [2021-12-16 01:08:40,884 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 268 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:40,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 334 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:08:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-16 01:08:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2021-12-16 01:08:40,921 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) [2021-12-16 01:08:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2021-12-16 01:08:40,924 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 67 [2021-12-16 01:08:40,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:40,924 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2021-12-16 01:08:40,924 INFO L471 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) [2021-12-16 01:08:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2021-12-16 01:08:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 01:08:40,927 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:40,927 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:40,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 01:08:40,928 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:40,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1622143259, now seen corresponding path program 1 times [2021-12-16 01:08:40,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:40,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562622971] [2021-12-16 01:08:40,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:40,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:40,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:40,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:41,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:41,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562622971] [2021-12-16 01:08:41,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562622971] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:41,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:41,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:08:41,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12395699] [2021-12-16 01:08:41,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:41,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:08:41,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:41,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:08:41,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:08:41,071 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) [2021-12-16 01:08:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:41,415 INFO L93 Difference]: Finished difference Result 265 states and 386 transitions. [2021-12-16 01:08:41,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 01:08:41,416 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 [2021-12-16 01:08:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:41,417 INFO L225 Difference]: With dead ends: 265 [2021-12-16 01:08:41,417 INFO L226 Difference]: Without dead ends: 152 [2021-12-16 01:08:41,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-16 01:08:41,420 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 258 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:41,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 373 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:08:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-16 01:08:41,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2021-12-16 01:08:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4257425742574257) internal successors, (144), 102 states have internal predecessors, (144), 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) [2021-12-16 01:08:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2021-12-16 01:08:41,433 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 67 [2021-12-16 01:08:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:41,433 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2021-12-16 01:08:41,434 INFO L471 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) [2021-12-16 01:08:41,434 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2021-12-16 01:08:41,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 01:08:41,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:41,435 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:41,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 01:08:41,436 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:41,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:41,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1286038627, now seen corresponding path program 1 times [2021-12-16 01:08:41,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:41,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820890642] [2021-12-16 01:08:41,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:41,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:41,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:41,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820890642] [2021-12-16 01:08:41,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820890642] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:41,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:41,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:41,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438286191] [2021-12-16 01:08:41,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:41,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:41,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:41,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:41,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:41,528 INFO L87 Difference]: Start difference. First operand 123 states and 174 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) [2021-12-16 01:08:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:41,858 INFO L93 Difference]: Finished difference Result 269 states and 391 transitions. [2021-12-16 01:08:41,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 01:08:41,859 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 [2021-12-16 01:08:41,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:41,860 INFO L225 Difference]: With dead ends: 269 [2021-12-16 01:08:41,860 INFO L226 Difference]: Without dead ends: 156 [2021-12-16 01:08:41,861 INFO L932 BasicCegarLoop]: 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 [2021-12-16 01:08:41,862 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 313 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:41,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 385 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:08:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-16 01:08:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 123. [2021-12-16 01:08:41,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 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) [2021-12-16 01:08:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 173 transitions. [2021-12-16 01:08:41,877 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 173 transitions. Word has length 67 [2021-12-16 01:08:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:41,877 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 173 transitions. [2021-12-16 01:08:41,877 INFO L471 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) [2021-12-16 01:08:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 173 transitions. [2021-12-16 01:08:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 01:08:41,879 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:41,879 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:41,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 01:08:41,879 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:41,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:41,880 INFO L85 PathProgramCache]: Analyzing trace with hash -410019621, now seen corresponding path program 1 times [2021-12-16 01:08:41,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:41,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902895375] [2021-12-16 01:08:41,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:41,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:41,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:41,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902895375] [2021-12-16 01:08:41,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902895375] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:41,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:41,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:41,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38122464] [2021-12-16 01:08:41,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:41,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:41,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:41,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:41,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:41,993 INFO L87 Difference]: Start difference. First operand 123 states and 173 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) [2021-12-16 01:08:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:42,291 INFO L93 Difference]: Finished difference Result 267 states and 385 transitions. [2021-12-16 01:08:42,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 01:08:42,291 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 [2021-12-16 01:08:42,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:42,293 INFO L225 Difference]: With dead ends: 267 [2021-12-16 01:08:42,293 INFO L226 Difference]: Without dead ends: 154 [2021-12-16 01:08:42,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-16 01:08:42,294 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 266 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:42,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 444 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:08:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-16 01:08:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 123. [2021-12-16 01:08:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 102 states have internal predecessors, (142), 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) [2021-12-16 01:08:42,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2021-12-16 01:08:42,305 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 172 transitions. Word has length 67 [2021-12-16 01:08:42,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:42,305 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 172 transitions. [2021-12-16 01:08:42,305 INFO L471 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) [2021-12-16 01:08:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 172 transitions. [2021-12-16 01:08:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 01:08:42,311 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:42,311 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:42,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 01:08:42,312 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:42,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:42,312 INFO L85 PathProgramCache]: Analyzing trace with hash 33881053, now seen corresponding path program 1 times [2021-12-16 01:08:42,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:42,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281174609] [2021-12-16 01:08:42,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:42,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:42,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:42,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:42,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:42,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:42,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:42,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:42,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281174609] [2021-12-16 01:08:42,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281174609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:42,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:42,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:42,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997767843] [2021-12-16 01:08:42,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:42,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:42,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:42,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:42,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:42,416 INFO L87 Difference]: Start difference. First operand 123 states and 172 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) [2021-12-16 01:08:42,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:42,663 INFO L93 Difference]: Finished difference Result 265 states and 379 transitions. [2021-12-16 01:08:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 01:08:42,663 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 [2021-12-16 01:08:42,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:42,665 INFO L225 Difference]: With dead ends: 265 [2021-12-16 01:08:42,665 INFO L226 Difference]: Without dead ends: 152 [2021-12-16 01:08:42,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-16 01:08:42,666 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 308 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:42,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 372 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:08:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-16 01:08:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2021-12-16 01:08:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.396039603960396) internal successors, (141), 102 states have internal predecessors, (141), 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) [2021-12-16 01:08:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 171 transitions. [2021-12-16 01:08:42,675 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 171 transitions. Word has length 67 [2021-12-16 01:08:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:42,676 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 171 transitions. [2021-12-16 01:08:42,676 INFO L471 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) [2021-12-16 01:08:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 171 transitions. [2021-12-16 01:08:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 01:08:42,677 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:42,677 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:42,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 01:08:42,678 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:42,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:42,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1994705057, now seen corresponding path program 1 times [2021-12-16 01:08:42,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:42,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399575314] [2021-12-16 01:08:42,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:42,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:42,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:42,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:42,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:42,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:42,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:42,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:42,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399575314] [2021-12-16 01:08:42,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399575314] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:42,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:42,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:08:42,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644614737] [2021-12-16 01:08:42,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:42,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:08:42,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:42,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:08:42,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:08:42,764 INFO L87 Difference]: Start difference. First operand 123 states and 171 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) [2021-12-16 01:08:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:43,220 INFO L93 Difference]: Finished difference Result 397 states and 563 transitions. [2021-12-16 01:08:43,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:08:43,220 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 [2021-12-16 01:08:43,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:43,222 INFO L225 Difference]: With dead ends: 397 [2021-12-16 01:08:43,222 INFO L226 Difference]: Without dead ends: 285 [2021-12-16 01:08:43,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-16 01:08:43,223 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 476 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:43,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 696 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 01:08:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-12-16 01:08:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 225. [2021-12-16 01:08:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 186 states have (on average 1.39247311827957) internal successors, (259), 188 states have internal predecessors, (259), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-16 01:08:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2021-12-16 01:08:43,238 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 67 [2021-12-16 01:08:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:43,239 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2021-12-16 01:08:43,239 INFO L471 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) [2021-12-16 01:08:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2021-12-16 01:08:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 01:08:43,240 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:43,240 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:43,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 01:08:43,240 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:43,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:43,240 INFO L85 PathProgramCache]: Analyzing trace with hash 992257470, now seen corresponding path program 1 times [2021-12-16 01:08:43,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:43,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414380078] [2021-12-16 01:08:43,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:43,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:43,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:43,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:43,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:43,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:43,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:43,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:43,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414380078] [2021-12-16 01:08:43,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414380078] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:43,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:43,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:43,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805831691] [2021-12-16 01:08:43,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:43,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:43,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:43,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:43,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:43,332 INFO L87 Difference]: Start difference. First operand 225 states and 311 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) [2021-12-16 01:08:43,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:43,734 INFO L93 Difference]: Finished difference Result 523 states and 746 transitions. [2021-12-16 01:08:43,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 01:08:43,736 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 [2021-12-16 01:08:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:43,737 INFO L225 Difference]: With dead ends: 523 [2021-12-16 01:08:43,738 INFO L226 Difference]: Without dead ends: 309 [2021-12-16 01:08:43,738 INFO L932 BasicCegarLoop]: 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 [2021-12-16 01:08:43,739 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 247 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:43,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 651 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:08:43,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-12-16 01:08:43,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 228. [2021-12-16 01:08:43,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.380952380952381) internal successors, (261), 191 states have internal predecessors, (261), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-16 01:08:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 313 transitions. [2021-12-16 01:08:43,755 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 313 transitions. Word has length 67 [2021-12-16 01:08:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:43,755 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 313 transitions. [2021-12-16 01:08:43,755 INFO L471 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) [2021-12-16 01:08:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 313 transitions. [2021-12-16 01:08:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 01:08:43,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:43,756 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:43,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 01:08:43,757 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:43,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:43,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1240403964, now seen corresponding path program 1 times [2021-12-16 01:08:43,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:43,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241112375] [2021-12-16 01:08:43,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:43,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:43,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:43,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:43,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:43,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:43,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:43,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:43,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241112375] [2021-12-16 01:08:43,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241112375] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:43,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:43,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:43,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464924648] [2021-12-16 01:08:43,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:43,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:43,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:43,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:43,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:43,827 INFO L87 Difference]: Start difference. First operand 228 states and 313 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) [2021-12-16 01:08:44,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:44,217 INFO L93 Difference]: Finished difference Result 541 states and 773 transitions. [2021-12-16 01:08:44,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 01:08:44,217 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 [2021-12-16 01:08:44,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:44,219 INFO L225 Difference]: With dead ends: 541 [2021-12-16 01:08:44,219 INFO L226 Difference]: Without dead ends: 324 [2021-12-16 01:08:44,220 INFO L932 BasicCegarLoop]: 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 [2021-12-16 01:08:44,220 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 247 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:44,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 643 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:08:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-16 01:08:44,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 234. [2021-12-16 01:08:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 197 states have internal predecessors, (267), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-16 01:08:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 319 transitions. [2021-12-16 01:08:44,235 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 319 transitions. Word has length 67 [2021-12-16 01:08:44,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:44,235 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 319 transitions. [2021-12-16 01:08:44,235 INFO L471 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) [2021-12-16 01:08:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2021-12-16 01:08:44,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-16 01:08:44,236 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:44,236 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:44,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 01:08:44,237 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:44,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:44,237 INFO L85 PathProgramCache]: Analyzing trace with hash 846037178, now seen corresponding path program 1 times [2021-12-16 01:08:44,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:44,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136957009] [2021-12-16 01:08:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:44,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:44,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:44,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:44,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:44,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:44,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:44,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:44,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136957009] [2021-12-16 01:08:44,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136957009] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:44,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:44,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:44,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633378254] [2021-12-16 01:08:44,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:44,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:44,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:44,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:44,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:44,339 INFO L87 Difference]: Start difference. First operand 234 states and 319 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) [2021-12-16 01:08:45,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:45,130 INFO L93 Difference]: Finished difference Result 886 states and 1260 transitions. [2021-12-16 01:08:45,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 01:08:45,131 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 [2021-12-16 01:08:45,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:45,135 INFO L225 Difference]: With dead ends: 886 [2021-12-16 01:08:45,135 INFO L226 Difference]: Without dead ends: 663 [2021-12-16 01:08:45,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-12-16 01:08:45,136 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 919 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:45,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [945 Valid, 793 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-16 01:08:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2021-12-16 01:08:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 438. [2021-12-16 01:08:45,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 366 states have (on average 1.3688524590163935) internal successors, (501), 369 states have internal predecessors, (501), 47 states have call successors, (47), 24 states have call predecessors, (47), 24 states have return successors, (51), 45 states have call predecessors, (51), 47 states have call successors, (51) [2021-12-16 01:08:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 599 transitions. [2021-12-16 01:08:45,177 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 599 transitions. Word has length 67 [2021-12-16 01:08:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:45,177 INFO L470 AbstractCegarLoop]: Abstraction has 438 states and 599 transitions. [2021-12-16 01:08:45,178 INFO L471 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) [2021-12-16 01:08:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 599 transitions. [2021-12-16 01:08:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-16 01:08:45,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:45,179 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:45,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 01:08:45,179 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1815470317, now seen corresponding path program 1 times [2021-12-16 01:08:45,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:45,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055151184] [2021-12-16 01:08:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:45,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:45,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:45,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:45,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:45,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:45,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:45,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-16 01:08:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 01:08:45,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:45,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055151184] [2021-12-16 01:08:45,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055151184] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:45,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:45,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:45,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111655287] [2021-12-16 01:08:45,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:45,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:45,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:45,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:45,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:45,262 INFO L87 Difference]: Start difference. First operand 438 states and 599 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) [2021-12-16 01:08:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:45,696 INFO L93 Difference]: Finished difference Result 990 states and 1411 transitions. [2021-12-16 01:08:45,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 01:08:45,697 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 [2021-12-16 01:08:45,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:45,700 INFO L225 Difference]: With dead ends: 990 [2021-12-16 01:08:45,700 INFO L226 Difference]: Without dead ends: 563 [2021-12-16 01:08:45,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-12-16 01:08:45,702 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 163 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:45,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 645 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 01:08:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-12-16 01:08:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 447. [2021-12-16 01:08:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 375 states have (on average 1.3573333333333333) internal successors, (509), 378 states have internal predecessors, (509), 47 states have call successors, (47), 24 states have call predecessors, (47), 24 states have return successors, (51), 45 states have call predecessors, (51), 47 states have call successors, (51) [2021-12-16 01:08:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 607 transitions. [2021-12-16 01:08:45,727 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 607 transitions. Word has length 84 [2021-12-16 01:08:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:45,728 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 607 transitions. [2021-12-16 01:08:45,728 INFO L471 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) [2021-12-16 01:08:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 607 transitions. [2021-12-16 01:08:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-16 01:08:45,729 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:45,729 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:45,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 01:08:45,729 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:45,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:45,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1462381935, now seen corresponding path program 1 times [2021-12-16 01:08:45,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:45,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315438721] [2021-12-16 01:08:45,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:45,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:45,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:45,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:45,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:45,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:45,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:45,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-16 01:08:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 01:08:45,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:45,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315438721] [2021-12-16 01:08:45,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315438721] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:45,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:45,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:45,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763746951] [2021-12-16 01:08:45,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:45,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:45,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:45,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:45,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:45,793 INFO L87 Difference]: Start difference. First operand 447 states and 607 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) [2021-12-16 01:08:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:46,142 INFO L93 Difference]: Finished difference Result 1127 states and 1518 transitions. [2021-12-16 01:08:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:08:46,143 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 [2021-12-16 01:08:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:46,147 INFO L225 Difference]: With dead ends: 1127 [2021-12-16 01:08:46,147 INFO L226 Difference]: Without dead ends: 692 [2021-12-16 01:08:46,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-16 01:08:46,149 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 483 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:46,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [490 Valid, 416 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:08:46,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-12-16 01:08:46,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 554. [2021-12-16 01:08:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 478 states have (on average 1.3179916317991631) internal successors, (630), 480 states have internal predecessors, (630), 47 states have call successors, (47), 28 states have call predecessors, (47), 28 states have return successors, (52), 46 states have call predecessors, (52), 47 states have call successors, (52) [2021-12-16 01:08:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 729 transitions. [2021-12-16 01:08:46,187 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 729 transitions. Word has length 84 [2021-12-16 01:08:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:46,188 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 729 transitions. [2021-12-16 01:08:46,188 INFO L471 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) [2021-12-16 01:08:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 729 transitions. [2021-12-16 01:08:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-16 01:08:46,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:46,189 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:46,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 01:08:46,189 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:46,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash 564988657, now seen corresponding path program 1 times [2021-12-16 01:08:46,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:46,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259536699] [2021-12-16 01:08:46,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:46,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-16 01:08:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 01:08:46,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:46,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259536699] [2021-12-16 01:08:46,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259536699] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:46,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:46,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:46,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311839642] [2021-12-16 01:08:46,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:46,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:46,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:46,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:46,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:46,272 INFO L87 Difference]: Start difference. First operand 554 states and 729 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) [2021-12-16 01:08:46,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:46,537 INFO L93 Difference]: Finished difference Result 1230 states and 1623 transitions. [2021-12-16 01:08:46,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 01:08:46,538 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 [2021-12-16 01:08:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:46,541 INFO L225 Difference]: With dead ends: 1230 [2021-12-16 01:08:46,541 INFO L226 Difference]: Without dead ends: 688 [2021-12-16 01:08:46,543 INFO L932 BasicCegarLoop]: 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 [2021-12-16 01:08:46,544 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 300 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:46,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 415 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:08:46,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-12-16 01:08:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 554. [2021-12-16 01:08:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 478 states have (on average 1.301255230125523) internal successors, (622), 480 states have internal predecessors, (622), 47 states have call successors, (47), 28 states have call predecessors, (47), 28 states have return successors, (52), 46 states have call predecessors, (52), 47 states have call successors, (52) [2021-12-16 01:08:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 721 transitions. [2021-12-16 01:08:46,579 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 721 transitions. Word has length 84 [2021-12-16 01:08:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:46,579 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 721 transitions. [2021-12-16 01:08:46,579 INFO L471 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) [2021-12-16 01:08:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 721 transitions. [2021-12-16 01:08:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-16 01:08:46,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:46,580 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:46,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 01:08:46,580 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:46,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash 813135151, now seen corresponding path program 1 times [2021-12-16 01:08:46,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:46,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270049605] [2021-12-16 01:08:46,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:46,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-16 01:08:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 01:08:46,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:46,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270049605] [2021-12-16 01:08:46,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270049605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:46,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:46,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:46,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457269493] [2021-12-16 01:08:46,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:46,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:46,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:46,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:46,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:46,657 INFO L87 Difference]: Start difference. First operand 554 states and 721 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) [2021-12-16 01:08:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:46,897 INFO L93 Difference]: Finished difference Result 1226 states and 1599 transitions. [2021-12-16 01:08:46,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 01:08:46,898 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 [2021-12-16 01:08:46,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:46,901 INFO L225 Difference]: With dead ends: 1226 [2021-12-16 01:08:46,901 INFO L226 Difference]: Without dead ends: 684 [2021-12-16 01:08:46,902 INFO L932 BasicCegarLoop]: 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 [2021-12-16 01:08:46,903 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 297 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:46,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 407 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:08:46,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-12-16 01:08:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 554. [2021-12-16 01:08:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 478 states have (on average 1.284518828451883) internal successors, (614), 480 states have internal predecessors, (614), 47 states have call successors, (47), 28 states have call predecessors, (47), 28 states have return successors, (52), 46 states have call predecessors, (52), 47 states have call successors, (52) [2021-12-16 01:08:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 713 transitions. [2021-12-16 01:08:46,936 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 713 transitions. Word has length 84 [2021-12-16 01:08:46,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:46,936 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 713 transitions. [2021-12-16 01:08:46,936 INFO L471 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) [2021-12-16 01:08:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 713 transitions. [2021-12-16 01:08:46,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-16 01:08:46,937 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:46,937 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:46,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 01:08:46,937 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:46,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:46,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1236781873, now seen corresponding path program 1 times [2021-12-16 01:08:46,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:46,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837229871] [2021-12-16 01:08:46,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:46,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-16 01:08:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 01:08:46,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:46,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837229871] [2021-12-16 01:08:46,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837229871] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:46,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:46,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:46,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929417133] [2021-12-16 01:08:46,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:46,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:46,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:46,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:46,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:46,996 INFO L87 Difference]: Start difference. First operand 554 states and 713 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) [2021-12-16 01:08:47,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:47,313 INFO L93 Difference]: Finished difference Result 1389 states and 1788 transitions. [2021-12-16 01:08:47,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:08:47,314 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 [2021-12-16 01:08:47,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:47,317 INFO L225 Difference]: With dead ends: 1389 [2021-12-16 01:08:47,317 INFO L226 Difference]: Without dead ends: 847 [2021-12-16 01:08:47,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-16 01:08:47,319 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 358 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:47,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 421 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:08:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2021-12-16 01:08:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 654. [2021-12-16 01:08:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 568 states have (on average 1.2429577464788732) internal successors, (706), 570 states have internal predecessors, (706), 50 states have call successors, (50), 35 states have call predecessors, (50), 35 states have return successors, (62), 49 states have call predecessors, (62), 50 states have call successors, (62) [2021-12-16 01:08:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 818 transitions. [2021-12-16 01:08:47,364 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 818 transitions. Word has length 84 [2021-12-16 01:08:47,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:47,364 INFO L470 AbstractCegarLoop]: Abstraction has 654 states and 818 transitions. [2021-12-16 01:08:47,364 INFO L471 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) [2021-12-16 01:08:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 818 transitions. [2021-12-16 01:08:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-16 01:08:47,365 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:47,366 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:47,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 01:08:47,366 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:47,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:47,366 INFO L85 PathProgramCache]: Analyzing trace with hash -608585293, now seen corresponding path program 1 times [2021-12-16 01:08:47,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:47,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200774393] [2021-12-16 01:08:47,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:47,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-16 01:08:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-16 01:08:47,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:47,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200774393] [2021-12-16 01:08:47,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200774393] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:08:47,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269734461] [2021-12-16 01:08:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:47,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:08:47,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:08:47,430 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) [2021-12-16 01:08:47,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-16 01:08:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:47,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 01:08:47,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:08:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:47,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:08:47,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269734461] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:47,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:08:47,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-16 01:08:47,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61079502] [2021-12-16 01:08:47,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:47,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:47,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:47,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:47,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:47,694 INFO L87 Difference]: Start difference. First operand 654 states and 818 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) [2021-12-16 01:08:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:47,774 INFO L93 Difference]: Finished difference Result 1613 states and 2040 transitions. [2021-12-16 01:08:47,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:47,775 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 [2021-12-16 01:08:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:47,779 INFO L225 Difference]: With dead ends: 1613 [2021-12-16 01:08:47,779 INFO L226 Difference]: Without dead ends: 1123 [2021-12-16 01:08:47,780 INFO L932 BasicCegarLoop]: 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 [2021-12-16 01:08:47,780 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 121 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 410 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 [2021-12-16 01:08:47,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 410 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:47,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2021-12-16 01:08:47,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2021-12-16 01:08:47,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 977 states have (on average 1.2364380757420677) internal successors, (1208), 979 states have internal predecessors, (1208), 84 states have call successors, (84), 61 states have call predecessors, (84), 61 states have return successors, (116), 83 states have call predecessors, (116), 84 states have call successors, (116) [2021-12-16 01:08:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1408 transitions. [2021-12-16 01:08:47,838 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1408 transitions. Word has length 84 [2021-12-16 01:08:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:47,839 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1408 transitions. [2021-12-16 01:08:47,839 INFO L471 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) [2021-12-16 01:08:47,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1408 transitions. [2021-12-16 01:08:47,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-16 01:08:47,840 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:47,840 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:47,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-16 01:08:48,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-16 01:08:48,056 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:48,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:48,057 INFO L85 PathProgramCache]: Analyzing trace with hash -55730782, now seen corresponding path program 1 times [2021-12-16 01:08:48,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:48,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648303152] [2021-12-16 01:08:48,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:48,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-16 01:08:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:08:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-16 01:08:48,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:48,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648303152] [2021-12-16 01:08:48,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648303152] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:48,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:48,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 01:08:48,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565962678] [2021-12-16 01:08:48,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:48,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 01:08:48,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:48,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 01:08:48,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:48,145 INFO L87 Difference]: Start difference. First operand 1123 states and 1408 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) [2021-12-16 01:08:48,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:48,572 INFO L93 Difference]: Finished difference Result 3486 states and 4372 transitions. [2021-12-16 01:08:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:08:48,573 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 [2021-12-16 01:08:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:48,581 INFO L225 Difference]: With dead ends: 3486 [2021-12-16 01:08:48,581 INFO L226 Difference]: Without dead ends: 2375 [2021-12-16 01:08:48,584 INFO L932 BasicCegarLoop]: 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 [2021-12-16 01:08:48,585 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 595 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:48,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [603 Valid, 461 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:08:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2021-12-16 01:08:48,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 2136. [2021-12-16 01:08:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 1849 states have (on average 1.2201189832341806) internal successors, (2256), 1870 states have internal predecessors, (2256), 153 states have call successors, (153), 108 states have call predecessors, (153), 133 states have return successors, (265), 159 states have call predecessors, (265), 153 states have call successors, (265) [2021-12-16 01:08:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 2674 transitions. [2021-12-16 01:08:48,717 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 2674 transitions. Word has length 99 [2021-12-16 01:08:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:48,717 INFO L470 AbstractCegarLoop]: Abstraction has 2136 states and 2674 transitions. [2021-12-16 01:08:48,717 INFO L471 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) [2021-12-16 01:08:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2674 transitions. [2021-12-16 01:08:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-16 01:08:48,719 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:48,719 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:48,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 01:08:48,719 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:48,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:48,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1996312796, now seen corresponding path program 1 times [2021-12-16 01:08:48,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:48,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374424134] [2021-12-16 01:08:48,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:48,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-16 01:08:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:08:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-16 01:08:48,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:48,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374424134] [2021-12-16 01:08:48,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374424134] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:48,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:48,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 01:08:48,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955069180] [2021-12-16 01:08:48,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:48,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 01:08:48,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:48,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 01:08:48,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:08:48,788 INFO L87 Difference]: Start difference. First operand 2136 states and 2674 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) [2021-12-16 01:08:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:49,035 INFO L93 Difference]: Finished difference Result 4575 states and 5687 transitions. [2021-12-16 01:08:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 01:08:49,036 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 [2021-12-16 01:08:49,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:49,046 INFO L225 Difference]: With dead ends: 4575 [2021-12-16 01:08:49,046 INFO L226 Difference]: Without dead ends: 2450 [2021-12-16 01:08:49,050 INFO L932 BasicCegarLoop]: 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 [2021-12-16 01:08:49,051 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 297 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:49,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 262 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 01:08:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2021-12-16 01:08:49,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2131. [2021-12-16 01:08:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2131 states, 1847 states have (on average 1.2198159177043855) internal successors, (2253), 1867 states have internal predecessors, (2253), 150 states have call successors, (150), 108 states have call predecessors, (150), 133 states have return successors, (261), 156 states have call predecessors, (261), 150 states have call successors, (261) [2021-12-16 01:08:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2664 transitions. [2021-12-16 01:08:49,198 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2664 transitions. Word has length 99 [2021-12-16 01:08:49,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:49,198 INFO L470 AbstractCegarLoop]: Abstraction has 2131 states and 2664 transitions. [2021-12-16 01:08:49,199 INFO L471 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) [2021-12-16 01:08:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2664 transitions. [2021-12-16 01:08:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-16 01:08:49,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:49,200 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:49,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 01:08:49,201 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:49,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:49,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1243137275, now seen corresponding path program 1 times [2021-12-16 01:08:49,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:49,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897028583] [2021-12-16 01:08:49,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:49,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-16 01:08:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:08:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-16 01:08:49,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:49,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897028583] [2021-12-16 01:08:49,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897028583] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:49,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:49,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 01:08:49,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346572743] [2021-12-16 01:08:49,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:49,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 01:08:49,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:49,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 01:08:49,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 01:08:49,261 INFO L87 Difference]: Start difference. First operand 2131 states and 2664 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) [2021-12-16 01:08:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:49,657 INFO L93 Difference]: Finished difference Result 4973 states and 6237 transitions. [2021-12-16 01:08:49,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 01:08:49,657 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 [2021-12-16 01:08:49,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:49,669 INFO L225 Difference]: With dead ends: 4973 [2021-12-16 01:08:49,670 INFO L226 Difference]: Without dead ends: 3137 [2021-12-16 01:08:49,674 INFO L932 BasicCegarLoop]: 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 [2021-12-16 01:08:49,675 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 381 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:49,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 360 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:08:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2021-12-16 01:08:49,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 2700. [2021-12-16 01:08:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2341 states have (on average 1.215719777872704) internal successors, (2846), 2363 states have internal predecessors, (2846), 190 states have call successors, (190), 138 states have call predecessors, (190), 168 states have return successors, (324), 199 states have call predecessors, (324), 190 states have call successors, (324) [2021-12-16 01:08:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3360 transitions. [2021-12-16 01:08:49,846 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3360 transitions. Word has length 100 [2021-12-16 01:08:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:49,846 INFO L470 AbstractCegarLoop]: Abstraction has 2700 states and 3360 transitions. [2021-12-16 01:08:49,847 INFO L471 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) [2021-12-16 01:08:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3360 transitions. [2021-12-16 01:08:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-16 01:08:49,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:49,849 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:49,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 01:08:49,849 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:49,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1869458483, now seen corresponding path program 1 times [2021-12-16 01:08:49,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:49,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820858104] [2021-12-16 01:08:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:49,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-16 01:08:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-16 01:08:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:08:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-16 01:08:49,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:49,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820858104] [2021-12-16 01:08:49,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820858104] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:08:49,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785740600] [2021-12-16 01:08:49,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:49,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:08:49,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:08:49,913 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) [2021-12-16 01:08:49,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-16 01:08:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:49,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 01:08:49,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:08:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 01:08:50,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:08:50,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785740600] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:50,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:08:50,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2021-12-16 01:08:50,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220793288] [2021-12-16 01:08:50,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:50,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:50,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:50,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:50,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:50,135 INFO L87 Difference]: Start difference. First operand 2700 states and 3360 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) [2021-12-16 01:08:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:50,327 INFO L93 Difference]: Finished difference Result 6076 states and 7553 transitions. [2021-12-16 01:08:50,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:50,328 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 [2021-12-16 01:08:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:50,341 INFO L225 Difference]: With dead ends: 6076 [2021-12-16 01:08:50,341 INFO L226 Difference]: Without dead ends: 3387 [2021-12-16 01:08:50,349 INFO L932 BasicCegarLoop]: 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 [2021-12-16 01:08:50,350 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 71 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 341 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 [2021-12-16 01:08:50,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 341 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2021-12-16 01:08:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3369. [2021-12-16 01:08:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3369 states, 2914 states have (on average 1.2055593685655457) internal successors, (3513), 2936 states have internal predecessors, (3513), 246 states have call successors, (246), 178 states have call predecessors, (246), 208 states have return successors, (386), 255 states have call predecessors, (386), 246 states have call successors, (386) [2021-12-16 01:08:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 4145 transitions. [2021-12-16 01:08:50,565 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 4145 transitions. Word has length 117 [2021-12-16 01:08:50,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:50,566 INFO L470 AbstractCegarLoop]: Abstraction has 3369 states and 4145 transitions. [2021-12-16 01:08:50,566 INFO L471 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) [2021-12-16 01:08:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 4145 transitions. [2021-12-16 01:08:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-16 01:08:50,568 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:50,569 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:50,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-16 01:08:50,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:08:50,786 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:50,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash -36607372, now seen corresponding path program 1 times [2021-12-16 01:08:50,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:50,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73984673] [2021-12-16 01:08:50,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:50,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 01:08:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-16 01:08:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:08:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-16 01:08:50,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:50,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73984673] [2021-12-16 01:08:50,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73984673] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:08:50,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840181227] [2021-12-16 01:08:50,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:50,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:08:50,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:08:50,846 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) [2021-12-16 01:08:50,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-16 01:08:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:50,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 01:08:50,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:08:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 01:08:51,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:08:51,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840181227] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:51,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:08:51,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-16 01:08:51,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866767698] [2021-12-16 01:08:51,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:51,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:51,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:51,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:51,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 01:08:51,049 INFO L87 Difference]: Start difference. First operand 3369 states and 4145 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) [2021-12-16 01:08:51,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:51,226 INFO L93 Difference]: Finished difference Result 6104 states and 7524 transitions. [2021-12-16 01:08:51,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:51,227 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 [2021-12-16 01:08:51,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:51,237 INFO L225 Difference]: With dead ends: 6104 [2021-12-16 01:08:51,237 INFO L226 Difference]: Without dead ends: 3416 [2021-12-16 01:08:51,242 INFO L932 BasicCegarLoop]: 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 [2021-12-16 01:08:51,243 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 112 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 401 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 [2021-12-16 01:08:51,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 401 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:51,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2021-12-16 01:08:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3369. [2021-12-16 01:08:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3369 states, 2914 states have (on average 1.199382292381606) internal successors, (3495), 2936 states have internal predecessors, (3495), 246 states have call successors, (246), 178 states have call predecessors, (246), 208 states have return successors, (345), 255 states have call predecessors, (345), 246 states have call successors, (345) [2021-12-16 01:08:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 4086 transitions. [2021-12-16 01:08:51,463 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 4086 transitions. Word has length 121 [2021-12-16 01:08:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:51,463 INFO L470 AbstractCegarLoop]: Abstraction has 3369 states and 4086 transitions. [2021-12-16 01:08:51,463 INFO L471 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) [2021-12-16 01:08:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 4086 transitions. [2021-12-16 01:08:51,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-12-16 01:08:51,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:51,469 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:51,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-16 01:08:51,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:08:51,686 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:51,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:51,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1792814822, now seen corresponding path program 1 times [2021-12-16 01:08:51,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:51,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817399386] [2021-12-16 01:08:51,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:51,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-16 01:08:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-16 01:08:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:08:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-16 01:08:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:08:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-16 01:08:51,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:51,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817399386] [2021-12-16 01:08:51,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817399386] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:08:51,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741519276] [2021-12-16 01:08:51,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:51,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:08:51,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:08:51,755 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) [2021-12-16 01:08:51,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-16 01:08:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:51,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 01:08:51,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:08:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-16 01:08:51,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:08:51,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741519276] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:51,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:08:51,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-16 01:08:51,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106842720] [2021-12-16 01:08:51,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:51,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:51,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:51,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:51,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:08:51,983 INFO L87 Difference]: Start difference. First operand 3369 states and 4086 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) [2021-12-16 01:08:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:52,354 INFO L93 Difference]: Finished difference Result 9860 states and 12095 transitions. [2021-12-16 01:08:52,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:52,354 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 [2021-12-16 01:08:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:52,383 INFO L225 Difference]: With dead ends: 9860 [2021-12-16 01:08:52,383 INFO L226 Difference]: Without dead ends: 6503 [2021-12-16 01:08:52,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:08:52,392 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 137 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 346 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 [2021-12-16 01:08:52,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 346 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:52,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6503 states. [2021-12-16 01:08:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6503 to 6492. [2021-12-16 01:08:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6492 states, 5638 states have (on average 1.1906704505143668) internal successors, (6713), 5674 states have internal predecessors, (6713), 459 states have call successors, (459), 340 states have call predecessors, (459), 394 states have return successors, (722), 479 states have call predecessors, (722), 459 states have call successors, (722) [2021-12-16 01:08:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6492 states to 6492 states and 7894 transitions. [2021-12-16 01:08:52,781 INFO L78 Accepts]: Start accepts. Automaton has 6492 states and 7894 transitions. Word has length 153 [2021-12-16 01:08:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:52,782 INFO L470 AbstractCegarLoop]: Abstraction has 6492 states and 7894 transitions. [2021-12-16 01:08:52,782 INFO L471 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) [2021-12-16 01:08:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6492 states and 7894 transitions. [2021-12-16 01:08:52,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-16 01:08:52,788 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:52,789 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:52,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-16 01:08:52,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:08:52,999 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:53,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:53,000 INFO L85 PathProgramCache]: Analyzing trace with hash -970215938, now seen corresponding path program 1 times [2021-12-16 01:08:53,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:53,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384627040] [2021-12-16 01:08:53,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:53,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-16 01:08:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-16 01:08:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:08:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-16 01:08:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:08:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,064 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-16 01:08:53,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:53,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384627040] [2021-12-16 01:08:53,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384627040] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:08:53,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620526782] [2021-12-16 01:08:53,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:53,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:08:53,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:08:53,066 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) [2021-12-16 01:08:53,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-16 01:08:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:53,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 01:08:53,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:08:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-16 01:08:53,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:08:53,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620526782] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:53,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:08:53,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-16 01:08:53,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904183180] [2021-12-16 01:08:53,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:53,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:53,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:53,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:53,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:08:53,351 INFO L87 Difference]: Start difference. First operand 6492 states and 7894 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) [2021-12-16 01:08:53,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:53,683 INFO L93 Difference]: Finished difference Result 10644 states and 13205 transitions. [2021-12-16 01:08:53,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:53,684 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 [2021-12-16 01:08:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:53,712 INFO L225 Difference]: With dead ends: 10644 [2021-12-16 01:08:53,713 INFO L226 Difference]: Without dead ends: 6468 [2021-12-16 01:08:53,723 INFO L932 BasicCegarLoop]: 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 [2021-12-16 01:08:53,724 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 111 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 438 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 [2021-12-16 01:08:53,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 438 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:53,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6468 states. [2021-12-16 01:08:54,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6468 to 6446. [2021-12-16 01:08:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6446 states, 5592 states have (on average 1.1686337625178826) internal successors, (6535), 5628 states have internal predecessors, (6535), 459 states have call successors, (459), 340 states have call predecessors, (459), 394 states have return successors, (722), 479 states have call predecessors, (722), 459 states have call successors, (722) [2021-12-16 01:08:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6446 states to 6446 states and 7716 transitions. [2021-12-16 01:08:54,188 INFO L78 Accepts]: Start accepts. Automaton has 6446 states and 7716 transitions. Word has length 154 [2021-12-16 01:08:54,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:54,189 INFO L470 AbstractCegarLoop]: Abstraction has 6446 states and 7716 transitions. [2021-12-16 01:08:54,189 INFO L471 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) [2021-12-16 01:08:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 6446 states and 7716 transitions. [2021-12-16 01:08:54,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-12-16 01:08:54,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:54,196 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:54,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-16 01:08:54,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-16 01:08:54,411 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:54,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1358937995, now seen corresponding path program 1 times [2021-12-16 01:08:54,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:54,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438591338] [2021-12-16 01:08:54,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:54,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-16 01:08:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-16 01:08:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:08:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-16 01:08:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:08:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-16 01:08:54,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:54,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438591338] [2021-12-16 01:08:54,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438591338] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:54,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:54,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:08:54,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085232782] [2021-12-16 01:08:54,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:54,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:08:54,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:54,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:08:54,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:08:54,485 INFO L87 Difference]: Start difference. First operand 6446 states and 7716 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) [2021-12-16 01:08:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:55,045 INFO L93 Difference]: Finished difference Result 9228 states and 11064 transitions. [2021-12-16 01:08:55,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 01:08:55,046 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 [2021-12-16 01:08:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:55,057 INFO L225 Difference]: With dead ends: 9228 [2021-12-16 01:08:55,057 INFO L226 Difference]: Without dead ends: 4925 [2021-12-16 01:08:55,064 INFO L932 BasicCegarLoop]: 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 [2021-12-16 01:08:55,064 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 509 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:55,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 578 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:08:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2021-12-16 01:08:55,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 4454. [2021-12-16 01:08:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 3883 states have (on average 1.161473087818697) internal successors, (4510), 3905 states have internal predecessors, (4510), 303 states have call successors, (303), 224 states have call predecessors, (303), 267 states have return successors, (448), 326 states have call predecessors, (448), 303 states have call successors, (448) [2021-12-16 01:08:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 5261 transitions. [2021-12-16 01:08:55,302 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 5261 transitions. Word has length 155 [2021-12-16 01:08:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:55,302 INFO L470 AbstractCegarLoop]: Abstraction has 4454 states and 5261 transitions. [2021-12-16 01:08:55,302 INFO L471 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) [2021-12-16 01:08:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 5261 transitions. [2021-12-16 01:08:55,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-16 01:08:55,309 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:55,309 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:55,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-16 01:08:55,309 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:55,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:55,310 INFO L85 PathProgramCache]: Analyzing trace with hash 217702764, now seen corresponding path program 1 times [2021-12-16 01:08:55,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:55,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87606986] [2021-12-16 01:08:55,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:55,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-16 01:08:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-16 01:08:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:08:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-16 01:08:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:08:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 37 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-16 01:08:55,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:55,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87606986] [2021-12-16 01:08:55,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87606986] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 01:08:55,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604183264] [2021-12-16 01:08:55,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:55,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:08:55,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 01:08:55,380 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) [2021-12-16 01:08:55,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-16 01:08:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:55,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 01:08:55,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 01:08:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-16 01:08:55,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 01:08:55,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604183264] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:55,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 01:08:55,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-12-16 01:08:55,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427411343] [2021-12-16 01:08:55,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:55,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 01:08:55,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:55,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 01:08:55,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:08:55,693 INFO L87 Difference]: Start difference. First operand 4454 states and 5261 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) [2021-12-16 01:08:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:55,966 INFO L93 Difference]: Finished difference Result 8019 states and 9613 transitions. [2021-12-16 01:08:55,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 01:08:55,967 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 [2021-12-16 01:08:55,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:55,976 INFO L225 Difference]: With dead ends: 8019 [2021-12-16 01:08:55,976 INFO L226 Difference]: Without dead ends: 4470 [2021-12-16 01:08:55,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:08:55,983 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 82 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 378 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 [2021-12-16 01:08:55,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 378 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 01:08:55,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4470 states. [2021-12-16 01:08:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4470 to 4454. [2021-12-16 01:08:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 3883 states have (on average 1.1382951326294102) internal successors, (4420), 3905 states have internal predecessors, (4420), 303 states have call successors, (303), 224 states have call predecessors, (303), 267 states have return successors, (448), 326 states have call predecessors, (448), 303 states have call successors, (448) [2021-12-16 01:08:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 5171 transitions. [2021-12-16 01:08:56,211 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 5171 transitions. Word has length 156 [2021-12-16 01:08:56,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:56,212 INFO L470 AbstractCegarLoop]: Abstraction has 4454 states and 5171 transitions. [2021-12-16 01:08:56,212 INFO L471 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) [2021-12-16 01:08:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 5171 transitions. [2021-12-16 01:08:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-12-16 01:08:56,217 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:56,217 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:56,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-16 01:08:56,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 01:08:56,436 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:56,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:56,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1852604969, now seen corresponding path program 2 times [2021-12-16 01:08:56,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:56,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930105713] [2021-12-16 01:08:56,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:56,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-16 01:08:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-16 01:08:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-16 01:08:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-16 01:08:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-16 01:08:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-16 01:08:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-16 01:08:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:08:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-16 01:08:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-16 01:08:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 01:08:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-16 01:08:56,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 01:08:56,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930105713] [2021-12-16 01:08:56,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930105713] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 01:08:56,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 01:08:56,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 01:08:56,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910778895] [2021-12-16 01:08:56,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 01:08:56,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 01:08:56,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 01:08:56,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 01:08:56,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 01:08:56,497 INFO L87 Difference]: Start difference. First operand 4454 states and 5171 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 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) [2021-12-16 01:08:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 01:08:56,815 INFO L93 Difference]: Finished difference Result 7209 states and 8473 transitions. [2021-12-16 01:08:56,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 01:08:56,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 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 156 [2021-12-16 01:08:56,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 01:08:56,821 INFO L225 Difference]: With dead ends: 7209 [2021-12-16 01:08:56,821 INFO L226 Difference]: Without dead ends: 1669 [2021-12-16 01:08:56,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-16 01:08:56,830 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 348 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 01:08:56,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 331 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 01:08:56,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2021-12-16 01:08:56,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1669. [2021-12-16 01:08:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1446 states have (on average 1.0802213001383125) internal successors, (1562), 1445 states have internal predecessors, (1562), 127 states have call successors, (127), 92 states have call predecessors, (127), 95 states have return successors, (160), 133 states have call predecessors, (160), 127 states have call successors, (160) [2021-12-16 01:08:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 1849 transitions. [2021-12-16 01:08:56,906 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 1849 transitions. Word has length 156 [2021-12-16 01:08:56,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 01:08:56,906 INFO L470 AbstractCegarLoop]: Abstraction has 1669 states and 1849 transitions. [2021-12-16 01:08:56,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 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) [2021-12-16 01:08:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 1849 transitions. [2021-12-16 01:08:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-16 01:08:56,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 01:08:56,909 INFO L514 BasicCegarLoop]: 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] [2021-12-16 01:08:56,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-16 01:08:56,910 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 01:08:56,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 01:08:56,910 INFO L85 PathProgramCache]: Analyzing trace with hash -217774742, now seen corresponding path program 1 times [2021-12-16 01:08:56,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 01:08:56,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741739639] [2021-12-16 01:08:56,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 01:08:56,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 01:08:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 01:08:56,919 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 01:08:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 01:08:56,961 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 01:08:56,961 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 01:08:56,962 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 01:08:56,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-16 01:08:56,965 INFO L732 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, 1] [2021-12-16 01:08:56,967 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 01:08:57,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 01:08:57 BoogieIcfgContainer [2021-12-16 01:08:57,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 01:08:57,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 01:08:57,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 01:08:57,056 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 01:08:57,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 01:08:40" (3/4) ... [2021-12-16 01:08:57,058 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 01:08:57,148 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 01:08:57,148 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 01:08:57,148 INFO L158 Benchmark]: Toolchain (without parser) took 17951.93ms. Allocated memory was 100.7MB in the beginning and 973.1MB in the end (delta: 872.4MB). Free memory was 67.3MB in the beginning and 902.3MB in the end (delta: -834.9MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2021-12-16 01:08:57,148 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory was 77.6MB in the beginning and 77.6MB in the end (delta: 29.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 01:08:57,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.65ms. Allocated memory is still 100.7MB. Free memory was 67.1MB in the beginning and 74.4MB in the end (delta: -7.3MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2021-12-16 01:08:57,149 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.76ms. Allocated memory is still 100.7MB. Free memory was 73.9MB in the beginning and 71.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 01:08:57,149 INFO L158 Benchmark]: Boogie Preprocessor took 41.50ms. Allocated memory is still 100.7MB. Free memory was 71.8MB in the beginning and 70.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 01:08:57,150 INFO L158 Benchmark]: RCFGBuilder took 465.09ms. Allocated memory is still 100.7MB. Free memory was 70.3MB in the beginning and 53.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-16 01:08:57,151 INFO L158 Benchmark]: TraceAbstraction took 16993.40ms. Allocated memory was 100.7MB in the beginning and 973.1MB in the end (delta: 872.4MB). Free memory was 53.0MB in the beginning and 918.0MB in the end (delta: -865.0MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2021-12-16 01:08:57,151 INFO L158 Benchmark]: Witness Printer took 91.89ms. Allocated memory is still 973.1MB. Free memory was 918.0MB in the beginning and 902.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-16 01:08:57,156 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.18ms. Allocated memory is still 100.7MB. Free memory was 77.6MB in the beginning and 77.6MB in the end (delta: 29.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.65ms. Allocated memory is still 100.7MB. Free memory was 67.1MB in the beginning and 74.4MB in the end (delta: -7.3MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.76ms. Allocated memory is still 100.7MB. Free memory was 73.9MB in the beginning and 71.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.50ms. Allocated memory is still 100.7MB. Free memory was 71.8MB in the beginning and 70.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 465.09ms. Allocated memory is still 100.7MB. Free memory was 70.3MB in the beginning and 53.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16993.40ms. Allocated memory was 100.7MB in the beginning and 973.1MB in the end (delta: 872.4MB). Free memory was 53.0MB in the beginning and 918.0MB in the end (delta: -865.0MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Witness Printer took 91.89ms. Allocated memory is still 973.1MB. Free memory was 918.0MB in the beginning and 902.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. 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: 16.8s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7887 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7667 mSDsluCounter, 11301 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6505 mSDsCounter, 1238 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6466 IncrementalHoareTripleChecker+Invalid, 7704 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1238 mSolverCounterUnsat, 4796 mSDtfsCounter, 6466 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1381 GetRequests, 1167 SyntacticMatches, 1 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6492occurred in iteration=21, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 2899 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 3359 NumberOfCodeBlocks, 3359 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3171 ConstructedInterpolants, 0 QuantifiedInterpolants, 6354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2395 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 832/936 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! [2021-12-16 01:08:57,194 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