./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/xor5.i --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/array-crafted/xor5.i -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 a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 21:39:53,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 21:39:53,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 21:39:53,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 21:39:53,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 21:39:53,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 21:39:53,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 21:39:53,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 21:39:53,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 21:39:53,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 21:39:53,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 21:39:53,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 21:39:53,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 21:39:53,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 21:39:53,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 21:39:53,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 21:39:53,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 21:39:53,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 21:39:53,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 21:39:53,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 21:39:53,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 21:39:53,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 21:39:53,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 21:39:53,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 21:39:53,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 21:39:53,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 21:39:53,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 21:39:53,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 21:39:53,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 21:39:53,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 21:39:53,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 21:39:53,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 21:39:53,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 21:39:53,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 21:39:53,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 21:39:53,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 21:39:53,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 21:39:53,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 21:39:53,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 21:39:53,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 21:39:53,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 21:39:53,513 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 21:39:53,538 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 21:39:53,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 21:39:53,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 21:39:53,541 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 21:39:53,541 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 21:39:53,541 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 21:39:53,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 21:39:53,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 21:39:53,542 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 21:39:53,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 21:39:53,543 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 21:39:53,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 21:39:53,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 21:39:53,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 21:39:53,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 21:39:53,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 21:39:53,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 21:39:53,544 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 21:39:53,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 21:39:53,544 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 21:39:53,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 21:39:53,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 21:39:53,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 21:39:53,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 21:39:53,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:39:53,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 21:39:53,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 21:39:53,547 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 21:39:53,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 21:39:53,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 21:39:53,547 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 21:39:53,548 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 21:39:53,548 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 21:39:53,548 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 21:39:53,548 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 -> a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 [2021-12-15 21:39:53,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 21:39:53,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 21:39:53,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 21:39:53,740 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 21:39:53,740 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 21:39:53,741 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor5.i [2021-12-15 21:39:53,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb1600bc0/5ff870f3164e47738aa0717c0170804c/FLAG39883ccfa [2021-12-15 21:39:54,179 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 21:39:54,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i [2021-12-15 21:39:54,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb1600bc0/5ff870f3164e47738aa0717c0170804c/FLAG39883ccfa [2021-12-15 21:39:54,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb1600bc0/5ff870f3164e47738aa0717c0170804c [2021-12-15 21:39:54,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 21:39:54,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 21:39:54,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 21:39:54,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 21:39:54,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 21:39:54,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:39:54" (1/1) ... [2021-12-15 21:39:54,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d92822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:54, skipping insertion in model container [2021-12-15 21:39:54,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:39:54" (1/1) ... [2021-12-15 21:39:54,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 21:39:54,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 21:39:54,355 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/array-crafted/xor5.i[1364,1377] [2021-12-15 21:39:54,358 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:39:54,371 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 21:39:54,394 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/array-crafted/xor5.i[1364,1377] [2021-12-15 21:39:54,395 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:39:54,404 INFO L208 MainTranslator]: Completed translation [2021-12-15 21:39:54,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:54 WrapperNode [2021-12-15 21:39:54,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 21:39:54,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 21:39:54,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 21:39:54,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 21:39:54,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:54" (1/1) ... [2021-12-15 21:39:54,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:54" (1/1) ... [2021-12-15 21:39:54,428 INFO L137 Inliner]: procedures = 16, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2021-12-15 21:39:54,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 21:39:54,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 21:39:54,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 21:39:54,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 21:39:54,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:54" (1/1) ... [2021-12-15 21:39:54,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:54" (1/1) ... [2021-12-15 21:39:54,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:54" (1/1) ... [2021-12-15 21:39:54,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:54" (1/1) ... [2021-12-15 21:39:54,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:54" (1/1) ... [2021-12-15 21:39:54,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:54" (1/1) ... [2021-12-15 21:39:54,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:54" (1/1) ... [2021-12-15 21:39:54,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 21:39:54,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 21:39:54,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 21:39:54,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 21:39:54,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:54" (1/1) ... [2021-12-15 21:39:54,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:39:54,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:39:54,473 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-15 21:39:54,475 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-15 21:39:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 21:39:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 21:39:54,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 21:39:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 21:39:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 21:39:54,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 21:39:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 21:39:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2021-12-15 21:39:54,499 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2021-12-15 21:39:54,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 21:39:54,569 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 21:39:54,570 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 21:39:54,688 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 21:39:54,693 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 21:39:54,693 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-15 21:39:54,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:39:54 BoogieIcfgContainer [2021-12-15 21:39:54,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 21:39:54,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 21:39:54,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 21:39:54,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 21:39:54,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:39:54" (1/3) ... [2021-12-15 21:39:54,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4236ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:39:54, skipping insertion in model container [2021-12-15 21:39:54,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:54" (2/3) ... [2021-12-15 21:39:54,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4236ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:39:54, skipping insertion in model container [2021-12-15 21:39:54,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:39:54" (3/3) ... [2021-12-15 21:39:54,701 INFO L111 eAbstractionObserver]: Analyzing ICFG xor5.i [2021-12-15 21:39:54,704 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 21:39:54,704 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 21:39:54,774 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 21:39:54,782 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-15 21:39:54,782 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 21:39:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 21:39:54,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 21:39:54,808 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:39:54,809 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:39:54,809 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:39:54,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:39:54,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2030793856, now seen corresponding path program 1 times [2021-12-15 21:39:54,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:39:54,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501944676] [2021-12-15 21:39:54,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:39:54,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:39:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:54,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-15 21:39:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:55,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-15 21:39:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:55,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-15 21:39:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 21:39:55,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:39:55,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501944676] [2021-12-15 21:39:55,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501944676] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:39:55,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:39:55,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 21:39:55,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570480013] [2021-12-15 21:39:55,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:39:55,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 21:39:55,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:39:55,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 21:39:55,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 21:39:55,062 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-15 21:39:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:39:55,079 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2021-12-15 21:39:55,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 21:39:55,081 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2021-12-15 21:39:55,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:39:55,086 INFO L225 Difference]: With dead ends: 51 [2021-12-15 21:39:55,087 INFO L226 Difference]: Without dead ends: 23 [2021-12-15 21:39:55,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 21:39:55,093 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:39:55,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:39:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-15 21:39:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-15 21:39:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 21:39:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-15 21:39:55,136 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2021-12-15 21:39:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:39:55,137 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-15 21:39:55,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-15 21:39:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-15 21:39:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 21:39:55,140 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:39:55,140 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:39:55,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 21:39:55,141 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:39:55,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:39:55,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1398988038, now seen corresponding path program 1 times [2021-12-15 21:39:55,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:39:55,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002895442] [2021-12-15 21:39:55,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:39:55,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:39:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:55,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-15 21:39:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:55,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-15 21:39:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:55,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-15 21:39:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 21:39:55,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:39:55,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002895442] [2021-12-15 21:39:55,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002895442] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:39:55,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:39:55,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:39:55,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905922531] [2021-12-15 21:39:55,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:39:55,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:39:55,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:39:55,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:39:55,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:39:55,276 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-15 21:39:55,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:39:55,302 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-15 21:39:55,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:39:55,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2021-12-15 21:39:55,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:39:55,304 INFO L225 Difference]: With dead ends: 43 [2021-12-15 21:39:55,304 INFO L226 Difference]: Without dead ends: 25 [2021-12-15 21:39:55,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:39:55,308 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:39:55,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:39:55,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-15 21:39:55,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-15 21:39:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 21:39:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-15 21:39:55,319 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2021-12-15 21:39:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:39:55,320 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-15 21:39:55,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-15 21:39:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-15 21:39:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 21:39:55,322 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:39:55,322 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:39:55,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 21:39:55,323 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:39:55,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:39:55,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1708163684, now seen corresponding path program 1 times [2021-12-15 21:39:55,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:39:55,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415111650] [2021-12-15 21:39:55,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:39:55,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:39:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:55,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-15 21:39:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:55,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-15 21:39:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:55,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-15 21:39:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-15 21:39:55,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:39:55,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415111650] [2021-12-15 21:39:55,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415111650] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:39:55,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946361564] [2021-12-15 21:39:55,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:39:55,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:39:55,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:39:55,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:39:55,436 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-15 21:39:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:55,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 21:39:55,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:39:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 21:39:55,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:39:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 21:39:55,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946361564] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:39:55,689 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:39:55,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-12-15 21:39:55,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227296108] [2021-12-15 21:39:55,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:39:55,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 21:39:55,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:39:55,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 21:39:55,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-15 21:39:55,691 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-15 21:39:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:39:55,754 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2021-12-15 21:39:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 21:39:55,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 31 [2021-12-15 21:39:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:39:55,755 INFO L225 Difference]: With dead ends: 47 [2021-12-15 21:39:55,755 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 21:39:55,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-15 21:39:55,756 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:39:55,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:39:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 21:39:55,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-15 21:39:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 21:39:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-15 21:39:55,760 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 31 [2021-12-15 21:39:55,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:39:55,760 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-15 21:39:55,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-15 21:39:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-15 21:39:55,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 21:39:55,761 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:39:55,762 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:39:55,781 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-15 21:39:55,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:39:55,976 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:39:55,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:39:55,976 INFO L85 PathProgramCache]: Analyzing trace with hash 533240604, now seen corresponding path program 1 times [2021-12-15 21:39:55,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:39:55,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788595631] [2021-12-15 21:39:55,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:39:55,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:39:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:56,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-15 21:39:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:56,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-15 21:39:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:56,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-15 21:39:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 21:39:56,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:39:56,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788595631] [2021-12-15 21:39:56,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788595631] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:39:56,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485436324] [2021-12-15 21:39:56,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:39:56,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:39:56,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:39:56,076 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-15 21:39:56,079 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-15 21:39:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:39:56,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 21:39:56,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:39:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-15 21:39:56,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:39:56,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485436324] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:39:56,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 21:39:56,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-15 21:39:56,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071224601] [2021-12-15 21:39:56,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:39:56,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 21:39:56,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:39:56,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 21:39:56,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 21:39:56,228 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-15 21:39:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:39:56,256 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-12-15 21:39:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 21:39:56,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2021-12-15 21:39:56,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:39:56,257 INFO L225 Difference]: With dead ends: 42 [2021-12-15 21:39:56,257 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 21:39:56,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 21:39:56,258 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:39:56,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:39:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 21:39:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-12-15 21:39:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 21:39:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-15 21:39:56,262 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2021-12-15 21:39:56,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:39:56,263 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-15 21:39:56,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-15 21:39:56,263 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-15 21:39:56,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-15 21:39:56,264 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:39:56,264 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:39:56,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 21:39:56,480 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,SelfDestructingSolverStorable3 [2021-12-15 21:39:56,481 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:39:56,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:39:56,481 INFO L85 PathProgramCache]: Analyzing trace with hash 850880602, now seen corresponding path program 1 times [2021-12-15 21:39:56,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:39:56,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246345892] [2021-12-15 21:39:56,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:39:56,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:39:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 21:39:56,523 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 21:39:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 21:39:56,578 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 21:39:56,578 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-15 21:39:56,579 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 21:39:56,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 21:39:56,582 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2021-12-15 21:39:56,584 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 21:39:56,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:39:56 BoogieIcfgContainer [2021-12-15 21:39:56,634 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 21:39:56,635 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 21:39:56,635 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 21:39:56,635 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 21:39:56,635 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:39:54" (3/4) ... [2021-12-15 21:39:56,637 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 21:39:56,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 21:39:56,638 INFO L158 Benchmark]: Toolchain (without parser) took 2438.72ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 65.1MB in the beginning and 51.4MB in the end (delta: 13.7MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2021-12-15 21:39:56,638 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 21:39:56,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.69ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 64.8MB in the beginning and 96.6MB in the end (delta: -31.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 21:39:56,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.00ms. Allocated memory is still 121.6MB. Free memory was 96.6MB in the beginning and 95.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 21:39:56,642 INFO L158 Benchmark]: Boogie Preprocessor took 19.54ms. Allocated memory is still 121.6MB. Free memory was 95.0MB in the beginning and 93.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 21:39:56,642 INFO L158 Benchmark]: RCFGBuilder took 245.99ms. Allocated memory is still 121.6MB. Free memory was 93.4MB in the beginning and 82.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 21:39:56,642 INFO L158 Benchmark]: TraceAbstraction took 1938.24ms. Allocated memory is still 121.6MB. Free memory was 81.9MB in the beginning and 51.4MB in the end (delta: 30.5MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2021-12-15 21:39:56,642 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 121.6MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 21:39:56,644 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.69ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 64.8MB in the beginning and 96.6MB in the end (delta: -31.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.00ms. Allocated memory is still 121.6MB. Free memory was 96.6MB in the beginning and 95.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.54ms. Allocated memory is still 121.6MB. Free memory was 95.0MB in the beginning and 93.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 245.99ms. Allocated memory is still 121.6MB. Free memory was 93.4MB in the beginning and 82.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1938.24ms. Allocated memory is still 121.6MB. Free memory was 81.9MB in the beginning and 51.4MB in the end (delta: 30.5MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 121.6MB. Free memory is still 51.4MB. There was no memory consumed. 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 - UnprovableResult [Line: 57]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseXor at line 25. Possible FailurePath: [L17] int N; VAL [N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; [L35] int temp; [L36] int ret; [L37] int ret2; [L38] int ret5; [L40] int i = 0; VAL [i=0, N=2, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=1, N=2, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=2, N=2, x={9:0}] [L40] COND FALSE !(i < N) VAL [i=2, N=2, x={9:0}] [L45] CALL, EXPR xor(x) VAL [N=2, x={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=-2, x={9:0}, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res ^ x[i] [L24] i++ VAL [i=2, N=2, x={9:0}, x={9:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, x={9:0}, x={9:0}] [L27] return res; VAL [\result=-4, i=2, N=2, res=4294967292, x={9:0}, x={9:0}] [L45] RET, EXPR xor(x) VAL [i=2, N=2, x={9:0}, xor(x)=-4] [L45] ret = xor(x) [L47] EXPR x[0] [L47] temp=x[0] [L47] EXPR x[1] [L47] x[0] = x[1] [L47] x[1] = temp VAL [i=2, N=2, ret=-4, temp=-2, x={9:0}] [L48] CALL, EXPR xor(x) VAL [N=2, x={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=-3, x={9:0}, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res ^ x[i] [L24] i++ VAL [i=2, N=2, x={9:0}, x={9:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, x={9:0}, x={9:0}] [L27] return res; VAL [\result=0, i=2, N=2, res=0, x={9:0}, x={9:0}] [L48] RET, EXPR xor(x) VAL [i=2, N=2, ret=-4, temp=-2, x={9:0}, xor(x)=0] [L48] ret2 = xor(x) [L49] EXPR x[0] [L49] temp=x[0] [L50] int i =0 ; VAL [i=0, i=2, N=2, ret=-4, ret2=0, temp=-3, x={9:0}] [L50] COND TRUE i 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 -> a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 [2021-12-15 21:39:58,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 21:39:58,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 21:39:58,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 21:39:58,746 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 21:39:58,746 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 21:39:58,747 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor5.i [2021-12-15 21:39:58,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff308eaa1/49aa0b29b07e4b329f95a3457795acf7/FLAGa1a828c74 [2021-12-15 21:39:59,154 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 21:39:59,155 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i [2021-12-15 21:39:59,160 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff308eaa1/49aa0b29b07e4b329f95a3457795acf7/FLAGa1a828c74 [2021-12-15 21:39:59,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff308eaa1/49aa0b29b07e4b329f95a3457795acf7 [2021-12-15 21:39:59,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 21:39:59,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 21:39:59,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 21:39:59,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 21:39:59,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 21:39:59,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:39:59" (1/1) ... [2021-12-15 21:39:59,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c04fa53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:59, skipping insertion in model container [2021-12-15 21:39:59,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:39:59" (1/1) ... [2021-12-15 21:39:59,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 21:39:59,203 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 21:39:59,351 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/array-crafted/xor5.i[1364,1377] [2021-12-15 21:39:59,354 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:39:59,366 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 21:39:59,399 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/array-crafted/xor5.i[1364,1377] [2021-12-15 21:39:59,403 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:39:59,414 INFO L208 MainTranslator]: Completed translation [2021-12-15 21:39:59,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:59 WrapperNode [2021-12-15 21:39:59,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 21:39:59,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 21:39:59,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 21:39:59,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 21:39:59,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:59" (1/1) ... [2021-12-15 21:39:59,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:59" (1/1) ... [2021-12-15 21:39:59,452 INFO L137 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2021-12-15 21:39:59,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 21:39:59,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 21:39:59,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 21:39:59,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 21:39:59,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:59" (1/1) ... [2021-12-15 21:39:59,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:59" (1/1) ... [2021-12-15 21:39:59,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:59" (1/1) ... [2021-12-15 21:39:59,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:59" (1/1) ... [2021-12-15 21:39:59,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:59" (1/1) ... [2021-12-15 21:39:59,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:59" (1/1) ... [2021-12-15 21:39:59,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:59" (1/1) ... [2021-12-15 21:39:59,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 21:39:59,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 21:39:59,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 21:39:59,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 21:39:59,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:59" (1/1) ... [2021-12-15 21:39:59,502 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:39:59,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:39:59,540 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-15 21:39:59,558 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-15 21:39:59,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 21:39:59,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-15 21:39:59,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 21:39:59,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-15 21:39:59,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 21:39:59,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 21:39:59,572 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2021-12-15 21:39:59,572 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2021-12-15 21:39:59,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 21:39:59,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-15 21:39:59,644 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 21:39:59,646 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 21:39:59,851 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 21:39:59,856 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 21:39:59,857 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-15 21:39:59,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:39:59 BoogieIcfgContainer [2021-12-15 21:39:59,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 21:39:59,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 21:39:59,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 21:39:59,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 21:39:59,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:39:59" (1/3) ... [2021-12-15 21:39:59,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769ea6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:39:59, skipping insertion in model container [2021-12-15 21:39:59,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:39:59" (2/3) ... [2021-12-15 21:39:59,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769ea6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:39:59, skipping insertion in model container [2021-12-15 21:39:59,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:39:59" (3/3) ... [2021-12-15 21:39:59,866 INFO L111 eAbstractionObserver]: Analyzing ICFG xor5.i [2021-12-15 21:39:59,873 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 21:39:59,873 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 21:39:59,917 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 21:39:59,926 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-15 21:39:59,927 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 21:39:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 21:39:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 21:39:59,943 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:39:59,944 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:39:59,944 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:39:59,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:39:59,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2030793856, now seen corresponding path program 1 times [2021-12-15 21:39:59,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:39:59,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354971593] [2021-12-15 21:39:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:39:59,961 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:39:59,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:39:59,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 21:39:59,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-15 21:40:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:40:00,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-15 21:40:00,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:40:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 21:40:00,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:40:00,130 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:40:00,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354971593] [2021-12-15 21:40:00,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354971593] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:40:00,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:40:00,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 21:40:00,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958379926] [2021-12-15 21:40:00,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:40:00,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 21:40:00,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:40:00,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 21:40:00,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 21:40:00,160 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-15 21:40:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:40:00,173 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2021-12-15 21:40:00,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 21:40:00,174 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2021-12-15 21:40:00,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:40:00,181 INFO L225 Difference]: With dead ends: 51 [2021-12-15 21:40:00,181 INFO L226 Difference]: Without dead ends: 23 [2021-12-15 21:40:00,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 21:40:00,187 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:40:00,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:40:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-15 21:40:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-15 21:40:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 21:40:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-15 21:40:00,221 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2021-12-15 21:40:00,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:40:00,222 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-15 21:40:00,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-15 21:40:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-15 21:40:00,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 21:40:00,228 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:40:00,228 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:40:00,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-15 21:40:00,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 21:40:00,438 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:40:00,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:40:00,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1398988038, now seen corresponding path program 1 times [2021-12-15 21:40:00,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:40:00,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660425724] [2021-12-15 21:40:00,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:40:00,439 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:40:00,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:40:00,441 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 21:40:00,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-15 21:40:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:40:00,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 21:40:00,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:40:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 21:40:00,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:40:00,557 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:40:00,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660425724] [2021-12-15 21:40:00,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660425724] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:40:00,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:40:00,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 21:40:00,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308559425] [2021-12-15 21:40:00,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:40:00,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 21:40:00,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:40:00,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 21:40:00,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:40:00,560 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-15 21:40:00,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:40:00,591 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-15 21:40:00,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 21:40:00,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2021-12-15 21:40:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:40:00,593 INFO L225 Difference]: With dead ends: 43 [2021-12-15 21:40:00,593 INFO L226 Difference]: Without dead ends: 25 [2021-12-15 21:40:00,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 21:40:00,594 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:40:00,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:40:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-15 21:40:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-15 21:40:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 21:40:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-15 21:40:00,602 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2021-12-15 21:40:00,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:40:00,602 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-15 21:40:00,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-15 21:40:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-15 21:40:00,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 21:40:00,604 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:40:00,604 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:40:00,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-15 21:40:00,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 21:40:00,811 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:40:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:40:00,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1708163684, now seen corresponding path program 1 times [2021-12-15 21:40:00,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:40:00,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152541624] [2021-12-15 21:40:00,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:40:00,812 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:40:00,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:40:00,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 21:40:00,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-15 21:40:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:40:00,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 21:40:00,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:40:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 21:40:00,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:40:01,103 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 21:40:01,104 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:40:01,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152541624] [2021-12-15 21:40:01,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152541624] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:40:01,104 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:40:01,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-15 21:40:01,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011855055] [2021-12-15 21:40:01,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:40:01,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 21:40:01,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:40:01,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 21:40:01,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 21:40:01,108 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-15 21:40:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:40:01,182 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-12-15 21:40:01,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 21:40:01,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 31 [2021-12-15 21:40:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:40:01,184 INFO L225 Difference]: With dead ends: 45 [2021-12-15 21:40:01,184 INFO L226 Difference]: Without dead ends: 27 [2021-12-15 21:40:01,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 21:40:01,189 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:40:01,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:40:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-15 21:40:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-12-15 21:40:01,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 21:40:01,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-12-15 21:40:01,213 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 31 [2021-12-15 21:40:01,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:40:01,213 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-12-15 21:40:01,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-15 21:40:01,213 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-12-15 21:40:01,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-15 21:40:01,214 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:40:01,214 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:40:01,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-15 21:40:01,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 21:40:01,414 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:40:01,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:40:01,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1821751230, now seen corresponding path program 2 times [2021-12-15 21:40:01,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:40:01,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712456461] [2021-12-15 21:40:01,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 21:40:01,416 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:40:01,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:40:01,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 21:40:01,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-15 21:40:01,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-15 21:40:01,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:40:01,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 21:40:01,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:40:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-15 21:40:01,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 21:40:01,547 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:40:01,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712456461] [2021-12-15 21:40:01,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712456461] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:40:01,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:40:01,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 21:40:01,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867938571] [2021-12-15 21:40:01,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:40:01,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 21:40:01,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:40:01,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 21:40:01,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 21:40:01,549 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-15 21:40:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:40:01,598 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2021-12-15 21:40:01,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 21:40:01,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2021-12-15 21:40:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:40:01,600 INFO L225 Difference]: With dead ends: 45 [2021-12-15 21:40:01,601 INFO L226 Difference]: Without dead ends: 28 [2021-12-15 21:40:01,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 21:40:01,603 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:40:01,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:40:01,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-15 21:40:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-15 21:40:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 21:40:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-15 21:40:01,609 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2021-12-15 21:40:01,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:40:01,609 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-15 21:40:01,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-15 21:40:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-15 21:40:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 21:40:01,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:40:01,610 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:40:01,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-15 21:40:01,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 21:40:01,816 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:40:01,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:40:01,816 INFO L85 PathProgramCache]: Analyzing trace with hash 533240604, now seen corresponding path program 1 times [2021-12-15 21:40:01,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:40:01,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337464904] [2021-12-15 21:40:01,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:40:01,817 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:40:01,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:40:01,828 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 21:40:01,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-15 21:40:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:40:01,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 21:40:01,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:40:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 21:40:02,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:40:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-15 21:40:02,332 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:40:02,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337464904] [2021-12-15 21:40:02,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337464904] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:40:02,332 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:40:02,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-15 21:40:02,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568217512] [2021-12-15 21:40:02,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:40:02,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 21:40:02,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:40:02,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 21:40:02,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-15 21:40:02,333 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-15 21:40:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:40:02,539 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2021-12-15 21:40:02,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 21:40:02,539 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2021-12-15 21:40:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:40:02,540 INFO L225 Difference]: With dead ends: 65 [2021-12-15 21:40:02,540 INFO L226 Difference]: Without dead ends: 52 [2021-12-15 21:40:02,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2021-12-15 21:40:02,541 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:40:02,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 62 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:40:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-15 21:40:02,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2021-12-15 21:40:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 21:40:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-15 21:40:02,546 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2021-12-15 21:40:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:40:02,546 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-15 21:40:02,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-15 21:40:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-15 21:40:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-15 21:40:02,547 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:40:02,548 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:40:02,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-15 21:40:02,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 21:40:02,755 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:40:02,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:40:02,755 INFO L85 PathProgramCache]: Analyzing trace with hash 850880602, now seen corresponding path program 1 times [2021-12-15 21:40:02,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:40:02,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857030734] [2021-12-15 21:40:02,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:40:02,756 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:40:02,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:40:02,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 21:40:02,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-15 21:40:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:40:02,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-15 21:40:02,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:40:03,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:03,214 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:40:03,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2021-12-15 21:40:03,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:03,488 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:40:03,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 36 [2021-12-15 21:40:03,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:03,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 21:40:03,606 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:40:03,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 48 [2021-12-15 21:40:03,812 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:40:03,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 25 [2021-12-15 21:40:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 21:40:03,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:40:09,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 111 [2021-12-15 21:40:09,759 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-15 21:40:09,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 183 [2021-12-15 21:40:09,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2021-12-15 21:40:09,785 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-15 21:40:09,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 1 [2021-12-15 21:40:12,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2021-12-15 21:40:12,855 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-15 21:40:12,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 1 [2021-12-15 21:40:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 21:40:13,177 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:40:13,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857030734] [2021-12-15 21:40:13,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857030734] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:40:13,177 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:40:13,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2021-12-15 21:40:13,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896299539] [2021-12-15 21:40:13,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:40:13,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-15 21:40:13,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:40:13,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-15 21:40:13,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1455, Unknown=1, NotChecked=0, Total=1640 [2021-12-15 21:40:13,179 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 21:40:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:40:19,577 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2021-12-15 21:40:19,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-15 21:40:19,578 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2021-12-15 21:40:19,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:40:19,580 INFO L225 Difference]: With dead ends: 84 [2021-12-15 21:40:19,581 INFO L226 Difference]: Without dead ends: 80 [2021-12-15 21:40:19,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=396, Invalid=2795, Unknown=1, NotChecked=0, Total=3192 [2021-12-15 21:40:19,582 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 88 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:40:19,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 217 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 751 Invalid, 0 Unknown, 38 Unchecked, 2.0s Time] [2021-12-15 21:40:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-15 21:40:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2021-12-15 21:40:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.183673469387755) internal successors, (58), 51 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2021-12-15 21:40:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2021-12-15 21:40:19,592 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 41 [2021-12-15 21:40:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:40:19,592 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2021-12-15 21:40:19,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 21:40:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2021-12-15 21:40:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-15 21:40:19,594 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:40:19,594 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:40:19,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-15 21:40:19,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 21:40:19,796 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:40:19,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:40:19,797 INFO L85 PathProgramCache]: Analyzing trace with hash 88846840, now seen corresponding path program 2 times [2021-12-15 21:40:19,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:40:19,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643771558] [2021-12-15 21:40:19,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 21:40:19,798 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:40:19,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:40:19,799 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 21:40:19,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-15 21:40:19,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 21:40:19,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:40:19,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 21:40:19,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:40:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 21:40:20,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:40:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 21:40:20,418 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:40:20,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643771558] [2021-12-15 21:40:20,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643771558] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:40:20,418 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:40:20,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2021-12-15 21:40:20,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032563141] [2021-12-15 21:40:20,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:40:20,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 21:40:20,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:40:20,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 21:40:20,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-12-15 21:40:20,419 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-15 21:40:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:40:20,836 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2021-12-15 21:40:20,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 21:40:20,837 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2021-12-15 21:40:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:40:20,838 INFO L225 Difference]: With dead ends: 104 [2021-12-15 21:40:20,838 INFO L226 Difference]: Without dead ends: 78 [2021-12-15 21:40:20,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2021-12-15 21:40:20,839 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 114 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 21:40:20,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 173 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 21:40:20,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-15 21:40:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2021-12-15 21:40:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 21:40:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2021-12-15 21:40:20,845 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 43 [2021-12-15 21:40:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:40:20,846 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2021-12-15 21:40:20,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-15 21:40:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2021-12-15 21:40:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-15 21:40:20,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:40:20,847 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:40:20,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-15 21:40:21,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 21:40:21,058 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:40:21,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:40:21,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1417469948, now seen corresponding path program 3 times [2021-12-15 21:40:21,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:40:21,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454917939] [2021-12-15 21:40:21,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 21:40:21,059 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:40:21,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:40:21,060 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 21:40:21,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-15 21:40:21,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-15 21:40:21,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:40:21,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 21:40:21,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:40:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 21:40:21,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:40:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 21:40:21,450 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:40:21,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454917939] [2021-12-15 21:40:21,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454917939] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:40:21,450 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:40:21,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2021-12-15 21:40:21,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247461618] [2021-12-15 21:40:21,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:40:21,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 21:40:21,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:40:21,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 21:40:21,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-15 21:40:21,451 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-15 21:40:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:40:21,683 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2021-12-15 21:40:21,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 21:40:21,684 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2021-12-15 21:40:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:40:21,685 INFO L225 Difference]: With dead ends: 77 [2021-12-15 21:40:21,685 INFO L226 Difference]: Without dead ends: 58 [2021-12-15 21:40:21,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-15 21:40:21,686 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 128 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 21:40:21,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 113 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 21:40:21,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-15 21:40:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2021-12-15 21:40:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 21:40:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2021-12-15 21:40:21,691 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2021-12-15 21:40:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:40:21,692 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2021-12-15 21:40:21,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-15 21:40:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2021-12-15 21:40:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-15 21:40:21,693 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:40:21,693 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:40:21,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-15 21:40:21,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 21:40:21,900 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:40:21,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:40:21,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2102516822, now seen corresponding path program 4 times [2021-12-15 21:40:21,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:40:21,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537237404] [2021-12-15 21:40:21,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 21:40:21,902 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:40:21,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:40:21,903 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 21:40:21,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-15 21:40:21,974 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 21:40:21,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:40:21,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 21:40:21,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:40:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 21:40:22,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:40:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-15 21:40:22,381 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:40:22,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537237404] [2021-12-15 21:40:22,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537237404] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:40:22,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:40:22,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-15 21:40:22,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852736433] [2021-12-15 21:40:22,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:40:22,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 21:40:22,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:40:22,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 21:40:22,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-15 21:40:22,383 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-15 21:40:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:40:22,583 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-12-15 21:40:22,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 21:40:22,583 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2021-12-15 21:40:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:40:22,584 INFO L225 Difference]: With dead ends: 64 [2021-12-15 21:40:22,584 INFO L226 Difference]: Without dead ends: 33 [2021-12-15 21:40:22,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-12-15 21:40:22,585 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 21:40:22,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 94 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 21:40:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-15 21:40:22,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-12-15 21:40:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 21:40:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-12-15 21:40:22,595 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 45 [2021-12-15 21:40:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:40:22,596 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-12-15 21:40:22,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-15 21:40:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-12-15 21:40:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-15 21:40:22,596 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:40:22,596 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:40:22,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-15 21:40:22,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 21:40:22,799 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:40:22,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:40:22,800 INFO L85 PathProgramCache]: Analyzing trace with hash -457868326, now seen corresponding path program 5 times [2021-12-15 21:40:22,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:40:22,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74484960] [2021-12-15 21:40:22,800 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 21:40:22,800 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:40:22,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:40:22,801 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 21:40:22,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-15 21:40:22,881 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-15 21:40:22,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:40:22,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 21:40:22,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:40:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-15 21:40:23,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:40:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-15 21:40:23,493 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:40:23,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74484960] [2021-12-15 21:40:23,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74484960] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:40:23,493 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:40:23,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-12-15 21:40:23,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338094204] [2021-12-15 21:40:23,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:40:23,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-15 21:40:23,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:40:23,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-15 21:40:23,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2021-12-15 21:40:23,494 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 21:40:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:40:24,105 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2021-12-15 21:40:24,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-15 21:40:24,106 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 49 [2021-12-15 21:40:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:40:24,107 INFO L225 Difference]: With dead ends: 112 [2021-12-15 21:40:24,107 INFO L226 Difference]: Without dead ends: 93 [2021-12-15 21:40:24,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2021-12-15 21:40:24,108 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 96 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 21:40:24,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 154 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 224 Invalid, 0 Unknown, 76 Unchecked, 0.3s Time] [2021-12-15 21:40:24,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-15 21:40:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2021-12-15 21:40:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 62 states have internal predecessors, (69), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2021-12-15 21:40:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2021-12-15 21:40:24,119 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 49 [2021-12-15 21:40:24,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:40:24,119 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2021-12-15 21:40:24,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-15 21:40:24,119 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2021-12-15 21:40:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-15 21:40:24,120 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:40:24,120 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:40:24,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-15 21:40:24,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-15 21:40:24,330 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:40:24,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:40:24,330 INFO L85 PathProgramCache]: Analyzing trace with hash -376141416, now seen corresponding path program 6 times [2021-12-15 21:40:24,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-15 21:40:24,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175746911] [2021-12-15 21:40:24,330 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 21:40:24,330 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-15 21:40:24,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-15 21:40:24,331 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-15 21:40:24,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-15 21:40:24,572 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-12-15 21:40:24,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:40:24,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-15 21:40:24,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:40:24,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:24,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:24,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:24,929 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:40:24,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 37 [2021-12-15 21:40:25,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:25,226 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 21:40:25,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:25,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:25,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:25,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:25,230 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 21:40:25,234 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-15 21:40:25,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 74 [2021-12-15 21:40:25,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:25,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:25,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:25,441 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:40:25,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 51 [2021-12-15 21:40:25,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:25,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:25,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:25,599 INFO L354 Elim1Store]: treesize reduction 72, result has 37.9 percent of original size [2021-12-15 21:40:25,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 81 [2021-12-15 21:40:26,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:40:26,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 21:40:26,842 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:40:26,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 154 treesize of output 85 [2021-12-15 21:40:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-15 21:40:27,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:40:44,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 324 treesize of output 252 [2021-12-15 21:40:44,695 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-15 21:40:44,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 434458 treesize of output 1 [2021-12-15 21:40:45,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 138 [2021-12-15 21:40:45,614 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-15 21:40:45,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 10718 treesize of output 1 [2021-12-15 21:40:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-15 21:40:45,624 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-15 21:40:45,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175746911] [2021-12-15 21:40:45,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175746911] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:40:45,624 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:40:45,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 48 [2021-12-15 21:40:45,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549811548] [2021-12-15 21:40:45,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:40:45,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-15 21:40:45,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-15 21:40:45,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-15 21:40:45,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2062, Unknown=1, NotChecked=0, Total=2256 [2021-12-15 21:40:45,626 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 48 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-15 21:40:57,301 WARN L227 SmtUtils]: Spent 11.47s on a formula simplification. DAG size of input: 184 DAG size of output: 156 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)