./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.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/combinations/Problem05_label49+token_ring.01.cil-2.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 eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 19:05:12,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 19:05:12,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 19:05:12,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 19:05:12,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 19:05:12,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 19:05:12,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 19:05:12,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 19:05:12,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 19:05:12,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 19:05:12,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 19:05:12,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 19:05:12,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 19:05:12,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 19:05:12,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 19:05:12,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 19:05:12,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 19:05:12,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 19:05:12,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 19:05:12,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 19:05:12,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 19:05:12,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 19:05:12,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 19:05:12,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 19:05:12,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 19:05:12,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 19:05:12,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 19:05:12,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 19:05:12,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 19:05:12,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 19:05:12,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 19:05:12,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 19:05:12,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 19:05:12,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 19:05:12,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 19:05:12,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 19:05:12,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 19:05:12,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 19:05:12,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 19:05:12,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 19:05:12,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 19:05:12,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 19:05:12,451 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 19:05:12,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 19:05:12,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 19:05:12,452 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 19:05:12,452 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 19:05:12,452 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 19:05:12,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 19:05:12,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 19:05:12,453 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 19:05:12,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 19:05:12,454 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 19:05:12,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 19:05:12,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 19:05:12,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 19:05:12,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 19:05:12,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 19:05:12,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 19:05:12,455 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 19:05:12,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 19:05:12,455 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 19:05:12,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 19:05:12,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 19:05:12,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 19:05:12,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 19:05:12,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 19:05:12,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 19:05:12,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 19:05:12,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 19:05:12,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 19:05:12,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 19:05:12,457 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 19:05:12,457 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 19:05:12,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 19:05:12,458 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 19:05:12,458 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 -> eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 [2021-12-17 19:05:12,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 19:05:12,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 19:05:12,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 19:05:12,658 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 19:05:12,658 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 19:05:12,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2021-12-17 19:05:12,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d03f8174/ff2e35ba96534541bcd6fd8d590535f8/FLAGba20372c7 [2021-12-17 19:05:13,395 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 19:05:13,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2021-12-17 19:05:13,438 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d03f8174/ff2e35ba96534541bcd6fd8d590535f8/FLAGba20372c7 [2021-12-17 19:05:13,686 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d03f8174/ff2e35ba96534541bcd6fd8d590535f8 [2021-12-17 19:05:13,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 19:05:13,690 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 19:05:13,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 19:05:13,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 19:05:13,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 19:05:13,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:05:13" (1/1) ... [2021-12-17 19:05:13,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75391d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:13, skipping insertion in model container [2021-12-17 19:05:13,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:05:13" (1/1) ... [2021-12-17 19:05:13,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 19:05:13,888 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 19:05:15,156 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/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2021-12-17 19:05:15,174 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/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2021-12-17 19:05:15,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 19:05:15,283 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 19:05:15,875 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/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2021-12-17 19:05:15,881 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/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2021-12-17 19:05:15,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 19:05:15,937 INFO L208 MainTranslator]: Completed translation [2021-12-17 19:05:15,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:15 WrapperNode [2021-12-17 19:05:15,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 19:05:15,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 19:05:15,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 19:05:15,938 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 19:05:15,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:15" (1/1) ... [2021-12-17 19:05:16,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:15" (1/1) ... [2021-12-17 19:05:16,288 INFO L137 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12566 [2021-12-17 19:05:16,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 19:05:16,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 19:05:16,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 19:05:16,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 19:05:16,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:15" (1/1) ... [2021-12-17 19:05:16,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:15" (1/1) ... [2021-12-17 19:05:16,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:15" (1/1) ... [2021-12-17 19:05:16,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:15" (1/1) ... [2021-12-17 19:05:16,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:15" (1/1) ... [2021-12-17 19:05:16,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:15" (1/1) ... [2021-12-17 19:05:16,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:15" (1/1) ... [2021-12-17 19:05:16,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 19:05:16,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 19:05:16,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 19:05:16,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 19:05:16,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:15" (1/1) ... [2021-12-17 19:05:16,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 19:05:16,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:05:16,821 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-17 19:05:16,883 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-17 19:05:16,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 19:05:16,917 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-12-17 19:05:16,917 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-12-17 19:05:16,918 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-17 19:05:16,918 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-17 19:05:16,918 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-17 19:05:16,918 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-17 19:05:16,918 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-17 19:05:16,918 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-17 19:05:16,918 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-17 19:05:16,919 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-17 19:05:16,919 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-17 19:05:16,919 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-17 19:05:16,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 19:05:16,919 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-17 19:05:16,920 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-17 19:05:16,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 19:05:16,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 19:05:17,032 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 19:05:17,041 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 19:05:21,804 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 19:05:21,830 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 19:05:21,830 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-17 19:05:21,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:05:21 BoogieIcfgContainer [2021-12-17 19:05:21,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 19:05:21,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 19:05:21,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 19:05:21,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 19:05:21,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:05:13" (1/3) ... [2021-12-17 19:05:21,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8c69d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:05:21, skipping insertion in model container [2021-12-17 19:05:21,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:05:15" (2/3) ... [2021-12-17 19:05:21,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8c69d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:05:21, skipping insertion in model container [2021-12-17 19:05:21,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:05:21" (3/3) ... [2021-12-17 19:05:21,840 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.01.cil-2.c [2021-12-17 19:05:21,843 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 19:05:21,843 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 19:05:21,880 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 19:05:21,884 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-17 19:05:21,884 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-17 19:05:21,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-17 19:05:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 19:05:21,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:21,932 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] [2021-12-17 19:05:21,932 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:21,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:21,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1417964819, now seen corresponding path program 1 times [2021-12-17 19:05:21,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:21,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166387847] [2021-12-17 19:05:21,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:21,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:22,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:22,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:22,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:22,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:22,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:22,350 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-17 19:05:22,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:22,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166387847] [2021-12-17 19:05:22,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166387847] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:22,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 19:05:22,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 19:05:22,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776469138] [2021-12-17 19:05:22,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:22,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 19:05:22,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:22,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 19:05:22,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 19:05:22,386 INFO L87 Difference]: Start difference. First operand has 2298 states, 2271 states have (on average 1.8590929106120653) internal successors, (4222), 2276 states have internal predecessors, (4222), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 19:05:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:23,011 INFO L93 Difference]: Finished difference Result 4727 states and 8720 transitions. [2021-12-17 19:05:23,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 19:05:23,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-17 19:05:23,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:23,031 INFO L225 Difference]: With dead ends: 4727 [2021-12-17 19:05:23,031 INFO L226 Difference]: Without dead ends: 2368 [2021-12-17 19:05:23,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-17 19:05:23,041 INFO L933 BasicCegarLoop]: 4199 mSDtfsCounter, 4329 mSDsluCounter, 12409 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4337 SdHoareTripleChecker+Valid, 16608 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 19:05:23,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4337 Valid, 16608 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 19:05:23,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2021-12-17 19:05:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2325. [2021-12-17 19:05:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2325 states, 2283 states have (on average 1.838370565045992) internal successors, (4197), 2287 states have internal predecessors, (4197), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2021-12-17 19:05:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2325 states to 2325 states and 4252 transitions. [2021-12-17 19:05:23,155 INFO L78 Accepts]: Start accepts. Automaton has 2325 states and 4252 transitions. Word has length 58 [2021-12-17 19:05:23,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:23,155 INFO L470 AbstractCegarLoop]: Abstraction has 2325 states and 4252 transitions. [2021-12-17 19:05:23,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 19:05:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2325 states and 4252 transitions. [2021-12-17 19:05:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 19:05:23,158 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:23,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] [2021-12-17 19:05:23,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 19:05:23,175 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:23,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:23,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1082743281, now seen corresponding path program 1 times [2021-12-17 19:05:23,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:23,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499701107] [2021-12-17 19:05:23,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:23,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:23,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:23,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:23,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:23,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:23,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:23,255 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-17 19:05:23,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:23,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499701107] [2021-12-17 19:05:23,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499701107] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:23,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 19:05:23,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 19:05:23,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945420430] [2021-12-17 19:05:23,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:23,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 19:05:23,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:23,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 19:05:23,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 19:05:23,258 INFO L87 Difference]: Start difference. First operand 2325 states and 4252 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 19:05:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:23,929 INFO L93 Difference]: Finished difference Result 2676 states and 4760 transitions. [2021-12-17 19:05:23,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 19:05:23,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-17 19:05:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:23,941 INFO L225 Difference]: With dead ends: 2676 [2021-12-17 19:05:23,941 INFO L226 Difference]: Without dead ends: 2481 [2021-12-17 19:05:23,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-17 19:05:23,944 INFO L933 BasicCegarLoop]: 4200 mSDtfsCounter, 4245 mSDsluCounter, 16416 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4253 SdHoareTripleChecker+Valid, 20616 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 19:05:23,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4253 Valid, 20616 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 19:05:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2021-12-17 19:05:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2415. [2021-12-17 19:05:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2415 states, 2356 states have (on average 1.8259762308998302) internal successors, (4302), 2361 states have internal predecessors, (4302), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2021-12-17 19:05:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 4379 transitions. [2021-12-17 19:05:24,009 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 4379 transitions. Word has length 58 [2021-12-17 19:05:24,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:24,010 INFO L470 AbstractCegarLoop]: Abstraction has 2415 states and 4379 transitions. [2021-12-17 19:05:24,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 19:05:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 4379 transitions. [2021-12-17 19:05:24,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 19:05:24,012 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:24,012 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] [2021-12-17 19:05:24,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 19:05:24,013 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:24,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:24,013 INFO L85 PathProgramCache]: Analyzing trace with hash -189256943, now seen corresponding path program 1 times [2021-12-17 19:05:24,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:24,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600175592] [2021-12-17 19:05:24,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:24,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:24,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:24,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:24,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:24,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:24,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:24,097 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-17 19:05:24,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:24,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600175592] [2021-12-17 19:05:24,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600175592] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:24,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 19:05:24,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 19:05:24,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265387749] [2021-12-17 19:05:24,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:24,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 19:05:24,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:24,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 19:05:24,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 19:05:24,100 INFO L87 Difference]: Start difference. First operand 2415 states and 4379 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 19:05:24,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:24,393 INFO L93 Difference]: Finished difference Result 2762 states and 4887 transitions. [2021-12-17 19:05:24,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 19:05:24,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-17 19:05:24,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:24,402 INFO L225 Difference]: With dead ends: 2762 [2021-12-17 19:05:24,402 INFO L226 Difference]: Without dead ends: 2477 [2021-12-17 19:05:24,404 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-17 19:05:24,405 INFO L933 BasicCegarLoop]: 4091 mSDtfsCounter, 4221 mSDsluCounter, 12078 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4230 SdHoareTripleChecker+Valid, 16169 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 19:05:24,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4230 Valid, 16169 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 19:05:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2021-12-17 19:05:24,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2415. [2021-12-17 19:05:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2415 states, 2356 states have (on average 1.8247028862478778) internal successors, (4299), 2361 states have internal predecessors, (4299), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2021-12-17 19:05:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 4376 transitions. [2021-12-17 19:05:24,457 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 4376 transitions. Word has length 58 [2021-12-17 19:05:24,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:24,458 INFO L470 AbstractCegarLoop]: Abstraction has 2415 states and 4376 transitions. [2021-12-17 19:05:24,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 19:05:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 4376 transitions. [2021-12-17 19:05:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 19:05:24,460 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:24,460 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] [2021-12-17 19:05:24,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 19:05:24,460 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:24,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:24,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2056322511, now seen corresponding path program 1 times [2021-12-17 19:05:24,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:24,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780977649] [2021-12-17 19:05:24,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:24,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:24,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:24,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:24,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:24,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:24,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:24,552 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-17 19:05:24,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:24,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780977649] [2021-12-17 19:05:24,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780977649] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:24,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 19:05:24,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 19:05:24,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141590211] [2021-12-17 19:05:24,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:24,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 19:05:24,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:24,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 19:05:24,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 19:05:24,555 INFO L87 Difference]: Start difference. First operand 2415 states and 4376 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 19:05:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:25,165 INFO L93 Difference]: Finished difference Result 2996 states and 5200 transitions. [2021-12-17 19:05:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 19:05:25,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-17 19:05:25,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:25,177 INFO L225 Difference]: With dead ends: 2996 [2021-12-17 19:05:25,179 INFO L226 Difference]: Without dead ends: 2711 [2021-12-17 19:05:25,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-17 19:05:25,189 INFO L933 BasicCegarLoop]: 4196 mSDtfsCounter, 4238 mSDsluCounter, 16401 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4245 SdHoareTripleChecker+Valid, 20597 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 19:05:25,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4245 Valid, 20597 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 19:05:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2021-12-17 19:05:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 2572. [2021-12-17 19:05:25,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 2481 states have (on average 1.8020959290608625) internal successors, (4471), 2488 states have internal predecessors, (4471), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2021-12-17 19:05:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 4592 transitions. [2021-12-17 19:05:25,313 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 4592 transitions. Word has length 58 [2021-12-17 19:05:25,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:25,313 INFO L470 AbstractCegarLoop]: Abstraction has 2572 states and 4592 transitions. [2021-12-17 19:05:25,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 19:05:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 4592 transitions. [2021-12-17 19:05:25,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-17 19:05:25,314 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:25,314 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] [2021-12-17 19:05:25,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 19:05:25,315 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:25,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1158929233, now seen corresponding path program 1 times [2021-12-17 19:05:25,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:25,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109648296] [2021-12-17 19:05:25,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:25,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:25,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:25,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:25,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:25,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:25,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:25,357 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-17 19:05:25,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:25,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109648296] [2021-12-17 19:05:25,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109648296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:25,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 19:05:25,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 19:05:25,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041988349] [2021-12-17 19:05:25,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:25,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 19:05:25,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:25,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 19:05:25,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 19:05:25,359 INFO L87 Difference]: Start difference. First operand 2572 states and 4592 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 19:05:25,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:25,779 INFO L93 Difference]: Finished difference Result 3391 states and 5757 transitions. [2021-12-17 19:05:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 19:05:25,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2021-12-17 19:05:25,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:25,789 INFO L225 Difference]: With dead ends: 3391 [2021-12-17 19:05:25,789 INFO L226 Difference]: Without dead ends: 2950 [2021-12-17 19:05:25,791 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-17 19:05:25,792 INFO L933 BasicCegarLoop]: 4223 mSDtfsCounter, 4350 mSDsluCounter, 12196 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4373 SdHoareTripleChecker+Valid, 16419 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 19:05:25,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4373 Valid, 16419 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 19:05:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2021-12-17 19:05:25,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2821. [2021-12-17 19:05:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 2679 states have (on average 1.7681970884658456) internal successors, (4737), 2691 states have internal predecessors, (4737), 86 states have call successors, (86), 49 states have call predecessors, (86), 54 states have return successors, (101), 84 states have call predecessors, (101), 84 states have call successors, (101) [2021-12-17 19:05:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 4924 transitions. [2021-12-17 19:05:25,849 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 4924 transitions. Word has length 58 [2021-12-17 19:05:25,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:25,849 INFO L470 AbstractCegarLoop]: Abstraction has 2821 states and 4924 transitions. [2021-12-17 19:05:25,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 19:05:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 4924 transitions. [2021-12-17 19:05:25,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-17 19:05:25,851 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:25,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:25,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 19:05:25,851 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:25,852 INFO L85 PathProgramCache]: Analyzing trace with hash 747002154, now seen corresponding path program 1 times [2021-12-17 19:05:25,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:25,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065836582] [2021-12-17 19:05:25,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:25,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:25,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:25,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:25,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:25,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:25,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:25,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-17 19:05:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:25,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:25,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-17 19:05:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 19:05:25,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:25,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065836582] [2021-12-17 19:05:25,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065836582] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 19:05:25,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310823074] [2021-12-17 19:05:25,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:25,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:05:25,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:05:25,932 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-17 19:05:25,971 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-17 19:05:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:26,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 19:05:26,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:05:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-17 19:05:26,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 19:05:26,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310823074] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:26,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 19:05:26,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 19:05:26,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590325981] [2021-12-17 19:05:26,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:26,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 19:05:26,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:26,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 19:05:26,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 19:05:26,126 INFO L87 Difference]: Start difference. First operand 2821 states and 4924 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 19:05:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:26,179 INFO L93 Difference]: Finished difference Result 4141 states and 6782 transitions. [2021-12-17 19:05:26,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 19:05:26,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2021-12-17 19:05:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:26,191 INFO L225 Difference]: With dead ends: 4141 [2021-12-17 19:05:26,192 INFO L226 Difference]: Without dead ends: 3452 [2021-12-17 19:05:26,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 19:05:26,195 INFO L933 BasicCegarLoop]: 4228 mSDtfsCounter, 113 mSDsluCounter, 4107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 8335 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 19:05:26,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 8335 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:05:26,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2021-12-17 19:05:26,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3452. [2021-12-17 19:05:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3179 states have (on average 1.7021075810003146) internal successors, (5411), 3198 states have internal predecessors, (5411), 163 states have call successors, (163), 97 states have call predecessors, (163), 108 states have return successors, (222), 164 states have call predecessors, (222), 161 states have call successors, (222) [2021-12-17 19:05:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 5796 transitions. [2021-12-17 19:05:26,270 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 5796 transitions. Word has length 93 [2021-12-17 19:05:26,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:26,271 INFO L470 AbstractCegarLoop]: Abstraction has 3452 states and 5796 transitions. [2021-12-17 19:05:26,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 19:05:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 5796 transitions. [2021-12-17 19:05:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-17 19:05:26,287 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:26,287 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:26,316 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-17 19:05:26,507 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,SelfDestructingSolverStorable5 [2021-12-17 19:05:26,508 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:26,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:26,508 INFO L85 PathProgramCache]: Analyzing trace with hash 385246456, now seen corresponding path program 1 times [2021-12-17 19:05:26,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:26,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109836229] [2021-12-17 19:05:26,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:26,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:26,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:26,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:26,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:26,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:26,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:26,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-17 19:05:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:26,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:26,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-17 19:05:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:26,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:26,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-17 19:05:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-17 19:05:26,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:26,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109836229] [2021-12-17 19:05:26,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109836229] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 19:05:26,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901495250] [2021-12-17 19:05:26,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:26,625 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:05:26,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:05:26,626 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-17 19:05:26,628 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-17 19:05:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:26,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 19:05:26,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:05:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-17 19:05:26,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 19:05:26,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901495250] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:26,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 19:05:26,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-17 19:05:26,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332124409] [2021-12-17 19:05:26,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:26,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 19:05:26,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:26,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 19:05:26,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 19:05:26,849 INFO L87 Difference]: Start difference. First operand 3452 states and 5796 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-17 19:05:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:26,918 INFO L93 Difference]: Finished difference Result 5974 states and 9303 transitions. [2021-12-17 19:05:26,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 19:05:26,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2021-12-17 19:05:26,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:26,932 INFO L225 Difference]: With dead ends: 5974 [2021-12-17 19:05:26,933 INFO L226 Difference]: Without dead ends: 4657 [2021-12-17 19:05:26,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 19:05:26,937 INFO L933 BasicCegarLoop]: 4140 mSDtfsCounter, 4037 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4037 SdHoareTripleChecker+Valid, 4271 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-17 19:05:26,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4037 Valid, 4271 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:05:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4657 states. [2021-12-17 19:05:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4657 to 4621. [2021-12-17 19:05:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4621 states, 4122 states have (on average 1.6246967491508977) internal successors, (6697), 4156 states have internal predecessors, (6697), 291 states have call successors, (291), 183 states have call predecessors, (291), 206 states have return successors, (388), 289 states have call predecessors, (388), 289 states have call successors, (388) [2021-12-17 19:05:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4621 states to 4621 states and 7376 transitions. [2021-12-17 19:05:27,043 INFO L78 Accepts]: Start accepts. Automaton has 4621 states and 7376 transitions. Word has length 119 [2021-12-17 19:05:27,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:27,059 INFO L470 AbstractCegarLoop]: Abstraction has 4621 states and 7376 transitions. [2021-12-17 19:05:27,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-17 19:05:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 4621 states and 7376 transitions. [2021-12-17 19:05:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-17 19:05:27,065 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:27,065 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:27,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-17 19:05:27,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-17 19:05:27,279 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1965387098, now seen corresponding path program 1 times [2021-12-17 19:05:27,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:27,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806247528] [2021-12-17 19:05:27,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:27,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:27,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:27,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:27,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:27,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:27,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:27,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-17 19:05:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:27,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 19:05:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:27,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:27,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-17 19:05:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:27,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:27,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-17 19:05:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-17 19:05:27,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:27,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806247528] [2021-12-17 19:05:27,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806247528] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 19:05:27,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766201513] [2021-12-17 19:05:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:27,354 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:05:27,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:05:27,355 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-17 19:05:27,356 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-17 19:05:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:27,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 19:05:27,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:05:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-17 19:05:27,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 19:05:27,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766201513] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:27,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 19:05:27,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 19:05:27,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444288543] [2021-12-17 19:05:27,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:27,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 19:05:27,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:27,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 19:05:27,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 19:05:27,585 INFO L87 Difference]: Start difference. First operand 4621 states and 7376 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 19:05:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:27,706 INFO L93 Difference]: Finished difference Result 6581 states and 10075 transitions. [2021-12-17 19:05:27,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 19:05:27,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 135 [2021-12-17 19:05:27,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:27,737 INFO L225 Difference]: With dead ends: 6581 [2021-12-17 19:05:27,737 INFO L226 Difference]: Without dead ends: 4821 [2021-12-17 19:05:27,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 19:05:27,742 INFO L933 BasicCegarLoop]: 4131 mSDtfsCounter, 4058 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4058 SdHoareTripleChecker+Valid, 4270 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 19:05:27,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4058 Valid, 4270 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:05:27,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4821 states. [2021-12-17 19:05:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4821 to 4803. [2021-12-17 19:05:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4803 states, 4280 states have (on average 1.6016355140186915) internal successors, (6855), 4314 states have internal predecessors, (6855), 297 states have call successors, (297), 201 states have call predecessors, (297), 224 states have return successors, (412), 295 states have call predecessors, (412), 295 states have call successors, (412) [2021-12-17 19:05:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4803 states to 4803 states and 7564 transitions. [2021-12-17 19:05:27,852 INFO L78 Accepts]: Start accepts. Automaton has 4803 states and 7564 transitions. Word has length 135 [2021-12-17 19:05:27,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:27,852 INFO L470 AbstractCegarLoop]: Abstraction has 4803 states and 7564 transitions. [2021-12-17 19:05:27,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-17 19:05:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4803 states and 7564 transitions. [2021-12-17 19:05:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-17 19:05:27,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:27,858 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:27,877 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-17 19:05:28,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:05:28,075 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:28,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:28,075 INFO L85 PathProgramCache]: Analyzing trace with hash 946429697, now seen corresponding path program 1 times [2021-12-17 19:05:28,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:28,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927845127] [2021-12-17 19:05:28,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:28,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 19:05:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 19:05:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 19:05:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 19:05:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-17 19:05:28,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:28,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927845127] [2021-12-17 19:05:28,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927845127] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 19:05:28,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109131709] [2021-12-17 19:05:28,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:28,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:05:28,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:05:28,174 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-17 19:05:28,203 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-17 19:05:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 19:05:28,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:05:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 19:05:28,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 19:05:28,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109131709] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:28,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 19:05:28,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 19:05:28,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167970339] [2021-12-17 19:05:28,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:28,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 19:05:28,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:28,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 19:05:28,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 19:05:28,424 INFO L87 Difference]: Start difference. First operand 4803 states and 7564 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 19:05:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:28,500 INFO L93 Difference]: Finished difference Result 6257 states and 9621 transitions. [2021-12-17 19:05:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 19:05:28,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136 [2021-12-17 19:05:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:28,519 INFO L225 Difference]: With dead ends: 6257 [2021-12-17 19:05:28,519 INFO L226 Difference]: Without dead ends: 4839 [2021-12-17 19:05:28,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 19:05:28,526 INFO L933 BasicCegarLoop]: 4215 mSDtfsCounter, 110 mSDsluCounter, 4098 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 8313 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-17 19:05:28,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 8313 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:05:28,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4839 states. [2021-12-17 19:05:28,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4839 to 4803. [2021-12-17 19:05:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4803 states, 4280 states have (on average 1.589018691588785) internal successors, (6801), 4314 states have internal predecessors, (6801), 297 states have call successors, (297), 201 states have call predecessors, (297), 224 states have return successors, (412), 295 states have call predecessors, (412), 295 states have call successors, (412) [2021-12-17 19:05:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4803 states to 4803 states and 7510 transitions. [2021-12-17 19:05:28,647 INFO L78 Accepts]: Start accepts. Automaton has 4803 states and 7510 transitions. Word has length 136 [2021-12-17 19:05:28,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:28,648 INFO L470 AbstractCegarLoop]: Abstraction has 4803 states and 7510 transitions. [2021-12-17 19:05:28,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-17 19:05:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 4803 states and 7510 transitions. [2021-12-17 19:05:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-17 19:05:28,653 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:28,653 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:28,669 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-17 19:05:28,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:05:28,867 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:28,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1815303137, now seen corresponding path program 1 times [2021-12-17 19:05:28,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:28,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651413751] [2021-12-17 19:05:28,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:28,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 19:05:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 19:05:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 19:05:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 19:05:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-17 19:05:28,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:28,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651413751] [2021-12-17 19:05:28,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651413751] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 19:05:28,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623381140] [2021-12-17 19:05:28,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:28,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:05:28,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:05:28,988 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-17 19:05:29,039 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-17 19:05:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:29,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 19:05:29,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:05:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 19:05:29,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 19:05:29,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623381140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:29,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 19:05:29,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 19:05:29,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372531200] [2021-12-17 19:05:29,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:29,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 19:05:29,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:29,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 19:05:29,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 19:05:29,316 INFO L87 Difference]: Start difference. First operand 4803 states and 7510 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 19:05:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:29,421 INFO L93 Difference]: Finished difference Result 7051 states and 10584 transitions. [2021-12-17 19:05:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 19:05:29,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 136 [2021-12-17 19:05:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:29,438 INFO L225 Difference]: With dead ends: 7051 [2021-12-17 19:05:29,439 INFO L226 Difference]: Without dead ends: 4641 [2021-12-17 19:05:29,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 19:05:29,448 INFO L933 BasicCegarLoop]: 4111 mSDtfsCounter, 4088 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4088 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 19:05:29,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4088 Valid, 4135 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:05:29,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4641 states. [2021-12-17 19:05:29,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4641 to 4487. [2021-12-17 19:05:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4487 states, 4026 states have (on average 1.5819672131147542) internal successors, (6369), 4052 states have internal predecessors, (6369), 265 states have call successors, (265), 179 states have call predecessors, (265), 194 states have return successors, (322), 259 states have call predecessors, (322), 263 states have call successors, (322) [2021-12-17 19:05:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4487 states to 4487 states and 6956 transitions. [2021-12-17 19:05:29,573 INFO L78 Accepts]: Start accepts. Automaton has 4487 states and 6956 transitions. Word has length 136 [2021-12-17 19:05:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:29,573 INFO L470 AbstractCegarLoop]: Abstraction has 4487 states and 6956 transitions. [2021-12-17 19:05:29,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-17 19:05:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 6956 transitions. [2021-12-17 19:05:29,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-17 19:05:29,578 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:29,578 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:29,618 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-17 19:05:29,787 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,SelfDestructingSolverStorable9 [2021-12-17 19:05:29,788 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:29,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash 874736092, now seen corresponding path program 1 times [2021-12-17 19:05:29,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:29,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601540577] [2021-12-17 19:05:29,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:29,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:29,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:29,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:29,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:29,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:29,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:29,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 19:05:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:29,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 19:05:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:29,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:29,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 19:05:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:29,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:29,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 19:05:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-17 19:05:29,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:29,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601540577] [2021-12-17 19:05:29,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601540577] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 19:05:29,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084467952] [2021-12-17 19:05:29,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:29,872 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:05:29,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:05:29,888 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-17 19:05:29,889 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-17 19:05:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:29,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 19:05:30,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:05:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-17 19:05:30,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 19:05:30,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084467952] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:30,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 19:05:30,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-17 19:05:30,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248669564] [2021-12-17 19:05:30,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:30,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 19:05:30,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:30,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 19:05:30,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 19:05:30,238 INFO L87 Difference]: Start difference. First operand 4487 states and 6956 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 19:05:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:30,416 INFO L93 Difference]: Finished difference Result 5915 states and 8819 transitions. [2021-12-17 19:05:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 19:05:30,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-17 19:05:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:30,427 INFO L225 Difference]: With dead ends: 5915 [2021-12-17 19:05:30,427 INFO L226 Difference]: Without dead ends: 4203 [2021-12-17 19:05:30,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-17 19:05:30,432 INFO L933 BasicCegarLoop]: 4089 mSDtfsCounter, 4105 mSDsluCounter, 8070 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4113 SdHoareTripleChecker+Valid, 12159 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 19:05:30,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4113 Valid, 12159 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 19:05:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2021-12-17 19:05:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3671. [2021-12-17 19:05:30,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 3372 states have (on average 1.6319691577698696) internal successors, (5503), 3388 states have internal predecessors, (5503), 175 states have call successors, (175), 115 states have call predecessors, (175), 122 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2021-12-17 19:05:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 5881 transitions. [2021-12-17 19:05:30,531 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 5881 transitions. Word has length 137 [2021-12-17 19:05:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:30,531 INFO L470 AbstractCegarLoop]: Abstraction has 3671 states and 5881 transitions. [2021-12-17 19:05:30,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 19:05:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 5881 transitions. [2021-12-17 19:05:30,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-17 19:05:30,534 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:30,534 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:30,553 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-17 19:05:30,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:05:30,747 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:30,748 INFO L85 PathProgramCache]: Analyzing trace with hash -991972582, now seen corresponding path program 1 times [2021-12-17 19:05:30,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:30,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646273810] [2021-12-17 19:05:30,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:30,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:30,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:30,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:30,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:30,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:30,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:30,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 19:05:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:30,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 19:05:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:30,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:30,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 19:05:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:30,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:30,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 19:05:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-17 19:05:30,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:30,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646273810] [2021-12-17 19:05:30,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646273810] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 19:05:30,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305051818] [2021-12-17 19:05:30,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:30,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:05:30,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:05:30,818 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 19:05:30,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 19:05:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:30,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 19:05:30,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:05:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-17 19:05:31,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 19:05:31,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305051818] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:31,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 19:05:31,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-17 19:05:31,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449571250] [2021-12-17 19:05:31,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:31,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 19:05:31,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:31,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 19:05:31,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 19:05:31,082 INFO L87 Difference]: Start difference. First operand 3671 states and 5881 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 19:05:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:31,322 INFO L93 Difference]: Finished difference Result 5385 states and 8039 transitions. [2021-12-17 19:05:31,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 19:05:31,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-17 19:05:31,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:31,330 INFO L225 Difference]: With dead ends: 5385 [2021-12-17 19:05:31,330 INFO L226 Difference]: Without dead ends: 3851 [2021-12-17 19:05:31,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-17 19:05:31,334 INFO L933 BasicCegarLoop]: 4102 mSDtfsCounter, 4128 mSDsluCounter, 8068 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 12170 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 19:05:31,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4136 Valid, 12170 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 19:05:31,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2021-12-17 19:05:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3795. [2021-12-17 19:05:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3795 states, 3488 states have (on average 1.6023509174311927) internal successors, (5589), 3504 states have internal predecessors, (5589), 175 states have call successors, (175), 123 states have call predecessors, (175), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2021-12-17 19:05:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3795 states to 3795 states and 5967 transitions. [2021-12-17 19:05:31,428 INFO L78 Accepts]: Start accepts. Automaton has 3795 states and 5967 transitions. Word has length 137 [2021-12-17 19:05:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:31,428 INFO L470 AbstractCegarLoop]: Abstraction has 3795 states and 5967 transitions. [2021-12-17 19:05:31,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 19:05:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3795 states and 5967 transitions. [2021-12-17 19:05:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-17 19:05:31,431 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:31,431 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:31,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 19:05:31,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:05:31,651 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:31,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:31,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1995852316, now seen corresponding path program 1 times [2021-12-17 19:05:31,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:31,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427946219] [2021-12-17 19:05:31,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:31,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:31,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:31,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:31,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:31,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:31,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 19:05:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:31,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 19:05:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:31,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:31,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 19:05:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:31,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 19:05:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-17 19:05:31,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:31,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427946219] [2021-12-17 19:05:31,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427946219] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 19:05:31,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377967524] [2021-12-17 19:05:31,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:31,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:05:31,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:05:31,758 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 19:05:31,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 19:05:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:31,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 19:05:31,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:05:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-17 19:05:31,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 19:05:31,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377967524] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:31,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 19:05:31,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-17 19:05:31,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49625489] [2021-12-17 19:05:31,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:31,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 19:05:31,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:31,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 19:05:31,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 19:05:31,994 INFO L87 Difference]: Start difference. First operand 3795 states and 5967 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 19:05:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:32,105 INFO L93 Difference]: Finished difference Result 4934 states and 7353 transitions. [2021-12-17 19:05:32,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 19:05:32,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-17 19:05:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:32,112 INFO L225 Difference]: With dead ends: 4934 [2021-12-17 19:05:32,113 INFO L226 Difference]: Without dead ends: 3270 [2021-12-17 19:05:32,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 19:05:32,117 INFO L933 BasicCegarLoop]: 4102 mSDtfsCounter, 48 mSDsluCounter, 12315 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 16417 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 19:05:32,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 16417 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:05:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2021-12-17 19:05:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3234. [2021-12-17 19:05:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 3034 states have (on average 1.654911008569545) internal successors, (5021), 3046 states have internal predecessors, (5021), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2021-12-17 19:05:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 5254 transitions. [2021-12-17 19:05:32,194 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 5254 transitions. Word has length 137 [2021-12-17 19:05:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:32,194 INFO L470 AbstractCegarLoop]: Abstraction has 3234 states and 5254 transitions. [2021-12-17 19:05:32,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 19:05:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 5254 transitions. [2021-12-17 19:05:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-17 19:05:32,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:32,196 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:32,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 19:05:32,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-17 19:05:32,407 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:32,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash 688947232, now seen corresponding path program 1 times [2021-12-17 19:05:32,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:32,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136181002] [2021-12-17 19:05:32,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:32,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:32,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:32,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:32,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:32,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:32,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:32,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 19:05:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:32,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 19:05:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:32,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:32,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 19:05:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:32,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:32,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 19:05:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-17 19:05:32,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:32,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136181002] [2021-12-17 19:05:32,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136181002] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 19:05:32,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355459083] [2021-12-17 19:05:32,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:32,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:05:32,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:05:32,490 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 19:05:32,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 19:05:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:32,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 19:05:32,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:05:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-17 19:05:32,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 19:05:32,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355459083] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:32,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 19:05:32,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-17 19:05:32,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478763236] [2021-12-17 19:05:32,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:32,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 19:05:32,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:32,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 19:05:32,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 19:05:32,750 INFO L87 Difference]: Start difference. First operand 3234 states and 5254 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 19:05:32,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:32,883 INFO L93 Difference]: Finished difference Result 4365 states and 6615 transitions. [2021-12-17 19:05:32,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 19:05:32,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2021-12-17 19:05:32,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:32,895 INFO L225 Difference]: With dead ends: 4365 [2021-12-17 19:05:32,895 INFO L226 Difference]: Without dead ends: 3262 [2021-12-17 19:05:32,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 19:05:32,898 INFO L933 BasicCegarLoop]: 4101 mSDtfsCounter, 10 mSDsluCounter, 12302 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16403 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 19:05:32,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 16403 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:05:32,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2021-12-17 19:05:32,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3246. [2021-12-17 19:05:32,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 3046 states have (on average 1.6454366382140513) internal successors, (5012), 3058 states have internal predecessors, (5012), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2021-12-17 19:05:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 5245 transitions. [2021-12-17 19:05:32,953 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 5245 transitions. Word has length 137 [2021-12-17 19:05:32,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:32,953 INFO L470 AbstractCegarLoop]: Abstraction has 3246 states and 5245 transitions. [2021-12-17 19:05:32,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 19:05:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 5245 transitions. [2021-12-17 19:05:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-17 19:05:32,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:32,956 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:32,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 19:05:33,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-17 19:05:33,173 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:33,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1312364636, now seen corresponding path program 1 times [2021-12-17 19:05:33,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:33,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714240234] [2021-12-17 19:05:33,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:33,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 19:05:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 19:05:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 19:05:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 19:05:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-17 19:05:33,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:33,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714240234] [2021-12-17 19:05:33,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714240234] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:33,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 19:05:33,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 19:05:33,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993521075] [2021-12-17 19:05:33,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:33,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 19:05:33,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:33,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 19:05:33,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 19:05:33,247 INFO L87 Difference]: Start difference. First operand 3246 states and 5245 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 19:05:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:33,628 INFO L93 Difference]: Finished difference Result 4206 states and 6319 transitions. [2021-12-17 19:05:33,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 19:05:33,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2021-12-17 19:05:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:33,636 INFO L225 Difference]: With dead ends: 4206 [2021-12-17 19:05:33,636 INFO L226 Difference]: Without dead ends: 4203 [2021-12-17 19:05:33,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-17 19:05:33,637 INFO L933 BasicCegarLoop]: 4172 mSDtfsCounter, 4444 mSDsluCounter, 12192 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4467 SdHoareTripleChecker+Valid, 16364 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 19:05:33,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4467 Valid, 16364 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 19:05:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4203 states. [2021-12-17 19:05:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4203 to 3622. [2021-12-17 19:05:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3356 states have (on average 1.598331346841478) internal successors, (5364), 3372 states have internal predecessors, (5364), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2021-12-17 19:05:33,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 5673 transitions. [2021-12-17 19:05:33,707 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 5673 transitions. Word has length 137 [2021-12-17 19:05:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:33,707 INFO L470 AbstractCegarLoop]: Abstraction has 3622 states and 5673 transitions. [2021-12-17 19:05:33,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 19:05:33,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 5673 transitions. [2021-12-17 19:05:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-17 19:05:33,709 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:33,709 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:33,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-17 19:05:33,709 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:33,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:33,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1384992052, now seen corresponding path program 1 times [2021-12-17 19:05:33,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:33,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664422614] [2021-12-17 19:05:33,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:33,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-17 19:05:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-17 19:05:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-17 19:05:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-17 19:05:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-17 19:05:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-17 19:05:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-17 19:05:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-17 19:05:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 19:05:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-17 19:05:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:05:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-17 19:05:33,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:05:33,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664422614] [2021-12-17 19:05:33,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664422614] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:05:33,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 19:05:33,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 19:05:33,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703096618] [2021-12-17 19:05:33,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:05:33,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 19:05:33,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:05:33,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 19:05:33,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 19:05:33,761 INFO L87 Difference]: Start difference. First operand 3622 states and 5673 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 19:05:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:05:34,003 INFO L93 Difference]: Finished difference Result 4845 states and 7161 transitions. [2021-12-17 19:05:34,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 19:05:34,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2021-12-17 19:05:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:05:34,011 INFO L225 Difference]: With dead ends: 4845 [2021-12-17 19:05:34,011 INFO L226 Difference]: Without dead ends: 3985 [2021-12-17 19:05:34,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 19:05:34,014 INFO L933 BasicCegarLoop]: 4150 mSDtfsCounter, 142 mSDsluCounter, 12165 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 16315 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 19:05:34,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 16315 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 19:05:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2021-12-17 19:05:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 3624. [2021-12-17 19:05:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 3358 states have (on average 1.5979749851101845) internal successors, (5366), 3374 states have internal predecessors, (5366), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2021-12-17 19:05:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 5675 transitions. [2021-12-17 19:05:34,089 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 5675 transitions. Word has length 141 [2021-12-17 19:05:34,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:05:34,090 INFO L470 AbstractCegarLoop]: Abstraction has 3624 states and 5675 transitions. [2021-12-17 19:05:34,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-17 19:05:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 5675 transitions. [2021-12-17 19:05:34,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-12-17 19:05:34,092 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:05:34,092 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 19:05:34,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 19:05:34,092 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:05:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:05:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1244161439, now seen corresponding path program 1 times [2021-12-17 19:05:34,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:05:34,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080442711] [2021-12-17 19:05:34,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:05:34,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:05:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 19:05:34,105 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 19:05:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 19:05:34,157 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 19:05:34,158 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 19:05:34,158 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-17 19:05:34,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-17 19:05:34,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-17 19:05:34,163 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:05:34,166 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 19:05:34,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 07:05:34 BoogieIcfgContainer [2021-12-17 19:05:34,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 19:05:34,268 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 19:05:34,268 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 19:05:34,268 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 19:05:34,268 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:05:21" (3/4) ... [2021-12-17 19:05:34,270 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 19:05:34,333 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 19:05:34,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 19:05:34,334 INFO L158 Benchmark]: Toolchain (without parser) took 20643.60ms. Allocated memory was 96.5MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 48.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 631.8MB. Max. memory is 16.1GB. [2021-12-17 19:05:34,334 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory was 52.5MB in the beginning and 52.5MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 19:05:34,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2243.48ms. Allocated memory was 96.5MB in the beginning and 241.2MB in the end (delta: 144.7MB). Free memory was 47.6MB in the beginning and 132.6MB in the end (delta: -84.9MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2021-12-17 19:05:34,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 350.72ms. Allocated memory is still 241.2MB. Free memory was 132.6MB in the beginning and 98.2MB in the end (delta: 34.4MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. [2021-12-17 19:05:34,334 INFO L158 Benchmark]: Boogie Preprocessor took 457.06ms. Allocated memory is still 241.2MB. Free memory was 98.2MB in the beginning and 84.7MB in the end (delta: 13.4MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2021-12-17 19:05:34,334 INFO L158 Benchmark]: RCFGBuilder took 5086.39ms. Allocated memory was 241.2MB in the beginning and 922.7MB in the end (delta: 681.6MB). Free memory was 84.2MB in the beginning and 466.4MB in the end (delta: -382.2MB). Peak memory consumption was 306.2MB. Max. memory is 16.1GB. [2021-12-17 19:05:34,335 INFO L158 Benchmark]: TraceAbstraction took 12432.71ms. Allocated memory was 922.7MB in the beginning and 1.8GB in the end (delta: 828.4MB). Free memory was 465.4MB in the beginning and 1.1GB in the end (delta: -624.8MB). Peak memory consumption was 203.5MB. Max. memory is 16.1GB. [2021-12-17 19:05:34,335 INFO L158 Benchmark]: Witness Printer took 65.24ms. Allocated memory is still 1.8GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-17 19:05:34,336 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.19ms. Allocated memory is still 96.5MB. Free memory was 52.5MB in the beginning and 52.5MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2243.48ms. Allocated memory was 96.5MB in the beginning and 241.2MB in the end (delta: 144.7MB). Free memory was 47.6MB in the beginning and 132.6MB in the end (delta: -84.9MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 350.72ms. Allocated memory is still 241.2MB. Free memory was 132.6MB in the beginning and 98.2MB in the end (delta: 34.4MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 457.06ms. Allocated memory is still 241.2MB. Free memory was 98.2MB in the beginning and 84.7MB in the end (delta: 13.4MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * RCFGBuilder took 5086.39ms. Allocated memory was 241.2MB in the beginning and 922.7MB in the end (delta: 681.6MB). Free memory was 84.2MB in the beginning and 466.4MB in the end (delta: -382.2MB). Peak memory consumption was 306.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12432.71ms. Allocated memory was 922.7MB in the beginning and 1.8GB in the end (delta: 828.4MB). Free memory was 465.4MB in the beginning and 1.1GB in the end (delta: -624.8MB). Peak memory consumption was 203.5MB. Max. memory is 16.1GB. * Witness Printer took 65.24ms. Allocated memory is still 1.8GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=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, token=0] [L11586] FCALL update_channels() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=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, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11424] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11434] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11588] RET fire_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=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, token=0] [L11589] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11301] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11318] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11320] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, tmp=0, tmp___0=0, token=0] [L11589] RET activate_threads() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=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, token=0] [L11590] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11452] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11462] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11590] RET reset_delta_events() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=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, token=0] [L11593] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=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, token=0] [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11366] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=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, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=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, tmp=1, tmp_ndt_1=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L11506] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11272] token += 1 [L11273] E_M = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L11506] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); VAL [\result=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11236] CALL error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11094]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2298 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46773 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46666 mSDsluCounter, 209561 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143111 mSDsCounter, 554 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3189 IncrementalHoareTripleChecker+Invalid, 3743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 554 mSolverCounterUnsat, 66450 mSDtfsCounter, 3189 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1596 GetRequests, 1457 SyntacticMatches, 4 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4803occurred in iteration=8, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 2265 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3044 NumberOfCodeBlocks, 3044 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2877 ConstructedInterpolants, 0 QuantifiedInterpolants, 4614 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3878 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 1302/1472 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-17 19:05:34,377 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