./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 839c364b 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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 11:24:57,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 11:24:57,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 11:24:57,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 11:24:57,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 11:24:57,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 11:24:57,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 11:24:57,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 11:24:57,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 11:24:57,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 11:24:57,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 11:24:57,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 11:24:57,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 11:24:57,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 11:24:57,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 11:24:57,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 11:24:57,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 11:24:57,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 11:24:57,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 11:24:57,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 11:24:57,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 11:24:57,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 11:24:57,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 11:24:57,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 11:24:57,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 11:24:57,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 11:24:57,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 11:24:57,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 11:24:57,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 11:24:57,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 11:24:57,559 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 11:24:57,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 11:24:57,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 11:24:57,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 11:24:57,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 11:24:57,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 11:24:57,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 11:24:57,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 11:24:57,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 11:24:57,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 11:24:57,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 11:24:57,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 11:24:57,585 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 11:24:57,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 11:24:57,585 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 11:24:57,585 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 11:24:57,586 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 11:24:57,586 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 11:24:57,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 11:24:57,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 11:24:57,587 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 11:24:57,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 11:24:57,588 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 11:24:57,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 11:24:57,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 11:24:57,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 11:24:57,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 11:24:57,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 11:24:57,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 11:24:57,589 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 11:24:57,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 11:24:57,589 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 11:24:57,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 11:24:57,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 11:24:57,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 11:24:57,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 11:24:57,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:24:57,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 11:24:57,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 11:24:57,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 11:24:57,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 11:24:57,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 11:24:57,592 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 11:24:57,592 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 11:24:57,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 11:24:57,592 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 11:24:57,592 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-14 11:24:57,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:24:57,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:24:57,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:24:57,819 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:24:57,829 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:24:57,830 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-14 11:24:57,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58dfe3b4/628e91294ec24724be1bd253865614e5/FLAG0cdd25ce9 [2021-12-14 11:24:58,376 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:24:58,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i [2021-12-14 11:24:58,384 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58dfe3b4/628e91294ec24724be1bd253865614e5/FLAG0cdd25ce9 [2021-12-14 11:24:58,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58dfe3b4/628e91294ec24724be1bd253865614e5 [2021-12-14 11:24:58,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:24:58,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:24:58,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:24:58,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:24:58,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:24:58,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:24:58" (1/1) ... [2021-12-14 11:24:58,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69be72b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:58, skipping insertion in model container [2021-12-14 11:24:58,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:24:58" (1/1) ... [2021-12-14 11:24:58,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:24:58,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:24:59,138 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-14 11:24:59,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:24:59,156 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:24:59,194 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-14 11:24:59,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:24:59,205 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:24:59,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:59 WrapperNode [2021-12-14 11:24:59,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:24:59,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:24:59,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:24:59,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:24:59,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:59" (1/1) ... [2021-12-14 11:24:59,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:59" (1/1) ... [2021-12-14 11:24:59,253 INFO L137 Inliner]: procedures = 16, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2021-12-14 11:24:59,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:24:59,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:24:59,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:24:59,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:24:59,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:59" (1/1) ... [2021-12-14 11:24:59,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:59" (1/1) ... [2021-12-14 11:24:59,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:59" (1/1) ... [2021-12-14 11:24:59,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:59" (1/1) ... [2021-12-14 11:24:59,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:59" (1/1) ... [2021-12-14 11:24:59,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:59" (1/1) ... [2021-12-14 11:24:59,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:59" (1/1) ... [2021-12-14 11:24:59,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:24:59,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:24:59,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:24:59,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:24:59,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:59" (1/1) ... [2021-12-14 11:24:59,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:24:59,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:24:59,333 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-14 11:24:59,339 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-14 11:24:59,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:24:59,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 11:24:59,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 11:24:59,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 11:24:59,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:24:59,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:24:59,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 11:24:59,362 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2021-12-14 11:24:59,362 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2021-12-14 11:24:59,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 11:24:59,441 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:24:59,443 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:24:59,552 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:24:59,556 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:24:59,557 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 11:24:59,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:24:59 BoogieIcfgContainer [2021-12-14 11:24:59,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:24:59,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:24:59,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:24:59,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:24:59,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:24:58" (1/3) ... [2021-12-14 11:24:59,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13cf1fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:24:59, skipping insertion in model container [2021-12-14 11:24:59,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:59" (2/3) ... [2021-12-14 11:24:59,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13cf1fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:24:59, skipping insertion in model container [2021-12-14 11:24:59,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:24:59" (3/3) ... [2021-12-14 11:24:59,566 INFO L111 eAbstractionObserver]: Analyzing ICFG xor5.i [2021-12-14 11:24:59,570 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:24:59,570 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:24:59,614 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:24:59,634 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-14 11:24:59,647 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:24:59,661 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-14 11:24:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 11:24:59,665 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:24:59,666 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-14 11:24:59,666 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:24:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:24:59,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2030793856, now seen corresponding path program 1 times [2021-12-14 11:24:59,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:24:59,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114299877] [2021-12-14 11:24:59,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:24:59,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:24:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:24:59,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:24:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:24:59,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:24:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:24:59,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:24:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:24:59,866 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-14 11:24:59,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:24:59,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114299877] [2021-12-14 11:24:59,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114299877] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:24:59,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:24:59,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 11:24:59,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334573510] [2021-12-14 11:24:59,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:24:59,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 11:24:59,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:24:59,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 11:24:59,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:24:59,910 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-14 11:24:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:24:59,930 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2021-12-14 11:24:59,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 11:24:59,932 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-14 11:24:59,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:24:59,944 INFO L225 Difference]: With dead ends: 51 [2021-12-14 11:24:59,944 INFO L226 Difference]: Without dead ends: 23 [2021-12-14 11:24:59,948 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-14 11:24:59,952 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-14 11:24:59,953 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-14 11:24:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-14 11:24:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-14 11:24:59,984 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-14 11:24:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-14 11:24:59,987 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2021-12-14 11:24:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:24:59,987 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-14 11:24:59,988 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-14 11:24:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-14 11:24:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 11:24:59,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:24:59,991 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-14 11:24:59,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 11:24:59,993 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:24:59,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:24:59,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1398988038, now seen corresponding path program 1 times [2021-12-14 11:24:59,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:24:59,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365971573] [2021-12-14 11:24:59,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:24:59,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:25:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:00,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:25:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:00,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:25:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:00,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:25:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:00,141 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-14 11:25:00,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:25:00,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365971573] [2021-12-14 11:25:00,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365971573] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:25:00,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:25:00,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:25:00,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490203363] [2021-12-14 11:25:00,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:25:00,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:25:00,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:25:00,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:25:00,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:25:00,147 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-14 11:25:00,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:25:00,177 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-14 11:25:00,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:25:00,178 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-14 11:25:00,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:25:00,188 INFO L225 Difference]: With dead ends: 43 [2021-12-14 11:25:00,188 INFO L226 Difference]: Without dead ends: 25 [2021-12-14 11:25:00,188 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-14 11:25:00,189 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-14 11:25:00,190 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-14 11:25:00,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-14 11:25:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-14 11:25:00,194 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-14 11:25:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-14 11:25:00,195 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2021-12-14 11:25:00,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:25:00,195 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-14 11:25:00,195 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-14 11:25:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-14 11:25:00,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 11:25:00,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:25:00,196 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-14 11:25:00,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 11:25:00,197 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:25:00,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:25:00,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1708163684, now seen corresponding path program 1 times [2021-12-14 11:25:00,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:25:00,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176284442] [2021-12-14 11:25:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:25:00,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:25:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:00,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 11:25:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:00,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 11:25:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:00,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 11:25:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:00,289 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-14 11:25:00,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:25:00,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176284442] [2021-12-14 11:25:00,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176284442] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:25:00,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001142481] [2021-12-14 11:25:00,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:25:00,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:25:00,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:25:00,291 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-14 11:25:00,292 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-14 11:25:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:00,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 11:25:00,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:25:00,486 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-14 11:25:00,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:25:00,575 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-14 11:25:00,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001142481] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:25:00,575 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:25:00,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-12-14 11:25:00,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210190479] [2021-12-14 11:25:00,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:25:00,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:25:00,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:25:00,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:25:00,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:25:00,581 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-14 11:25:00,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:25:00,648 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2021-12-14 11:25:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 11:25:00,649 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-14 11:25:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:25:00,649 INFO L225 Difference]: With dead ends: 47 [2021-12-14 11:25:00,649 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 11:25:00,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:25:00,651 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-14 11:25:00,651 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-14 11:25:00,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 11:25:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-12-14 11:25:00,654 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-14 11:25:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-14 11:25:00,655 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 31 [2021-12-14 11:25:00,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:25:00,655 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-14 11:25:00,655 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-14 11:25:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-14 11:25:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 11:25:00,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:25:00,656 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-14 11:25:00,674 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-14 11:25:00,872 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-14 11:25:00,872 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:25:00,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:25:00,873 INFO L85 PathProgramCache]: Analyzing trace with hash 533240604, now seen corresponding path program 1 times [2021-12-14 11:25:00,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:25:00,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335248555] [2021-12-14 11:25:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:25:00,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:25:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:00,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-14 11:25:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:00,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 11:25:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:00,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-14 11:25:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:00,981 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-14 11:25:00,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:25:00,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335248555] [2021-12-14 11:25:00,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335248555] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:25:00,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437518355] [2021-12-14 11:25:00,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:25:00,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:25:00,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:25:00,992 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-14 11:25:00,994 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-14 11:25:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:01,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 11:25:01,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:25:01,138 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-14 11:25:01,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:25:01,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437518355] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:25:01,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 11:25:01,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-14 11:25:01,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072757177] [2021-12-14 11:25:01,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:25:01,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:25:01,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:25:01,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:25:01,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:25:01,142 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-14 11:25:01,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:25:01,169 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-12-14 11:25:01,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:25:01,170 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-14 11:25:01,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:25:01,170 INFO L225 Difference]: With dead ends: 42 [2021-12-14 11:25:01,170 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 11:25:01,171 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-14 11:25:01,172 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-14 11:25:01,172 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-14 11:25:01,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 11:25:01,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-12-14 11:25:01,175 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-14 11:25:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-14 11:25:01,175 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2021-12-14 11:25:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:25:01,176 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-14 11:25:01,176 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-14 11:25:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-14 11:25:01,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 11:25:01,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:25:01,177 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-14 11:25:01,196 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-14 11:25:01,393 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-14 11:25:01,393 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:25:01,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:25:01,394 INFO L85 PathProgramCache]: Analyzing trace with hash 850880602, now seen corresponding path program 1 times [2021-12-14 11:25:01,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:25:01,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433656487] [2021-12-14 11:25:01,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:25:01,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:25:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 11:25:01,422 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 11:25:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 11:25:01,469 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 11:25:01,469 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 11:25:01,470 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 11:25:01,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 11:25:01,473 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2021-12-14 11:25:01,475 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 11:25:01,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:25:01 BoogieIcfgContainer [2021-12-14 11:25:01,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 11:25:01,501 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 11:25:01,501 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 11:25:01,501 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 11:25:01,501 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:24:59" (3/4) ... [2021-12-14 11:25:01,503 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 11:25:01,503 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 11:25:01,504 INFO L158 Benchmark]: Toolchain (without parser) took 2634.34ms. Allocated memory was 104.9MB in the beginning and 136.3MB in the end (delta: 31.5MB). Free memory was 78.7MB in the beginning and 70.7MB in the end (delta: 8.1MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2021-12-14 11:25:01,504 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory was 65.9MB in the beginning and 65.8MB in the end (delta: 49.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:25:01,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.19ms. Allocated memory was 104.9MB in the beginning and 136.3MB in the end (delta: 31.5MB). Free memory was 78.5MB in the beginning and 112.0MB in the end (delta: -33.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 11:25:01,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.63ms. Allocated memory is still 136.3MB. Free memory was 112.0MB in the beginning and 110.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:25:01,505 INFO L158 Benchmark]: Boogie Preprocessor took 23.41ms. Allocated memory is still 136.3MB. Free memory was 110.4MB in the beginning and 109.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 11:25:01,505 INFO L158 Benchmark]: RCFGBuilder took 280.25ms. Allocated memory is still 136.3MB. Free memory was 109.1MB in the beginning and 97.8MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 11:25:01,505 INFO L158 Benchmark]: TraceAbstraction took 1940.95ms. Allocated memory is still 136.3MB. Free memory was 97.3MB in the beginning and 71.4MB in the end (delta: 25.9MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2021-12-14 11:25:01,505 INFO L158 Benchmark]: Witness Printer took 2.43ms. Allocated memory is still 136.3MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:25:01,506 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 104.9MB. Free memory was 65.9MB in the beginning and 65.8MB in the end (delta: 49.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.19ms. Allocated memory was 104.9MB in the beginning and 136.3MB in the end (delta: 31.5MB). Free memory was 78.5MB in the beginning and 112.0MB in the end (delta: -33.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.63ms. Allocated memory is still 136.3MB. Free memory was 112.0MB in the beginning and 110.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.41ms. Allocated memory is still 136.3MB. Free memory was 110.4MB in the beginning and 109.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 280.25ms. Allocated memory is still 136.3MB. Free memory was 109.1MB in the beginning and 97.8MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1940.95ms. Allocated memory is still 136.3MB. Free memory was 97.3MB in the beginning and 71.4MB in the end (delta: 25.9MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Witness Printer took 2.43ms. Allocated memory is still 136.3MB. Free memory is still 70.7MB. 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=2, i=0, 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-14 11:25:03,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:25:03,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:25:03,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:25:03,813 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:25:03,814 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:25:03,815 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-14 11:25:03,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/037212e56/d83525333c344a6bab6f67066f9de531/FLAG85f696e74 [2021-12-14 11:25:04,260 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:25:04,260 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i [2021-12-14 11:25:04,266 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/037212e56/d83525333c344a6bab6f67066f9de531/FLAG85f696e74 [2021-12-14 11:25:04,274 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/037212e56/d83525333c344a6bab6f67066f9de531 [2021-12-14 11:25:04,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:25:04,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:25:04,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:25:04,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:25:04,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:25:04,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:25:04" (1/1) ... [2021-12-14 11:25:04,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52bd5421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:04, skipping insertion in model container [2021-12-14 11:25:04,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:25:04" (1/1) ... [2021-12-14 11:25:04,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:25:04,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:25:04,408 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-14 11:25:04,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:25:04,416 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:25:04,480 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-14 11:25:04,484 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:25:04,494 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:25:04,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:04 WrapperNode [2021-12-14 11:25:04,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:25:04,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:25:04,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:25:04,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:25:04,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:04" (1/1) ... [2021-12-14 11:25:04,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:04" (1/1) ... [2021-12-14 11:25:04,531 INFO L137 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2021-12-14 11:25:04,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:25:04,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:25:04,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:25:04,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:25:04,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:04" (1/1) ... [2021-12-14 11:25:04,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:04" (1/1) ... [2021-12-14 11:25:04,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:04" (1/1) ... [2021-12-14 11:25:04,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:04" (1/1) ... [2021-12-14 11:25:04,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:04" (1/1) ... [2021-12-14 11:25:04,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:04" (1/1) ... [2021-12-14 11:25:04,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:04" (1/1) ... [2021-12-14 11:25:04,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:25:04,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:25:04,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:25:04,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:25:04,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:04" (1/1) ... [2021-12-14 11:25:04,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:25:04,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:25:04,621 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-14 11:25:04,635 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-14 11:25:04,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:25:04,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 11:25:04,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 11:25:04,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 11:25:04,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:25:04,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:25:04,646 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2021-12-14 11:25:04,647 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2021-12-14 11:25:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 11:25:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-14 11:25:04,695 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:25:04,696 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:25:04,826 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:25:04,830 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:25:04,830 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 11:25:04,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:25:04 BoogieIcfgContainer [2021-12-14 11:25:04,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:25:04,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:25:04,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:25:04,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:25:04,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:25:04" (1/3) ... [2021-12-14 11:25:04,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1b9cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:25:04, skipping insertion in model container [2021-12-14 11:25:04,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:25:04" (2/3) ... [2021-12-14 11:25:04,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1b9cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:25:04, skipping insertion in model container [2021-12-14 11:25:04,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:25:04" (3/3) ... [2021-12-14 11:25:04,836 INFO L111 eAbstractionObserver]: Analyzing ICFG xor5.i [2021-12-14 11:25:04,839 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:25:04,839 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:25:04,865 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:25:04,875 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-14 11:25:04,875 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:25:04,894 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-14 11:25:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 11:25:04,898 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:25:04,899 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-14 11:25:04,900 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:25:04,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:25:04,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2030793856, now seen corresponding path program 1 times [2021-12-14 11:25:04,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:25:04,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547699641] [2021-12-14 11:25:04,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:25:04,918 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:25:04,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:25:04,933 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-14 11:25:04,934 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-14 11:25:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:05,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-14 11:25:05,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:25:05,138 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-14 11:25:05,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:25:05,139 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:25:05,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547699641] [2021-12-14 11:25:05,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547699641] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:25:05,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:25:05,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 11:25:05,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110531760] [2021-12-14 11:25:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:25:05,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 11:25:05,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:25:05,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 11:25:05,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:25:05,197 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-14 11:25:05,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:25:05,227 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2021-12-14 11:25:05,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 11:25:05,229 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-14 11:25:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:25:05,234 INFO L225 Difference]: With dead ends: 51 [2021-12-14 11:25:05,234 INFO L226 Difference]: Without dead ends: 23 [2021-12-14 11:25:05,236 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-14 11:25:05,238 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-14 11:25:05,252 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-14 11:25:05,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-14 11:25:05,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-14 11:25:05,282 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-14 11:25:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-14 11:25:05,283 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2021-12-14 11:25:05,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:25:05,283 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-14 11:25:05,283 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-14 11:25:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-14 11:25:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 11:25:05,285 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:25:05,285 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-14 11:25:05,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-14 11:25:05,485 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-14 11:25:05,486 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:25:05,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:25:05,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1398988038, now seen corresponding path program 1 times [2021-12-14 11:25:05,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:25:05,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687680034] [2021-12-14 11:25:05,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:25:05,487 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:25:05,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:25:05,489 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-14 11:25:05,495 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-14 11:25:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:05,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 11:25:05,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:25:05,632 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-14 11:25:05,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:25:05,632 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:25:05,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687680034] [2021-12-14 11:25:05,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687680034] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:25:05,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:25:05,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:25:05,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628813631] [2021-12-14 11:25:05,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:25:05,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:25:05,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:25:05,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:25:05,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:25:05,634 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-14 11:25:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:25:05,658 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-12-14 11:25:05,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:25:05,658 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-14 11:25:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:25:05,659 INFO L225 Difference]: With dead ends: 43 [2021-12-14 11:25:05,659 INFO L226 Difference]: Without dead ends: 25 [2021-12-14 11:25:05,659 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-14 11:25:05,660 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-14 11:25:05,660 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-14 11:25:05,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-14 11:25:05,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-14 11:25:05,664 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-14 11:25:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-14 11:25:05,664 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2021-12-14 11:25:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:25:05,665 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-14 11:25:05,665 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-14 11:25:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-14 11:25:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 11:25:05,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:25:05,688 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-14 11:25:05,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-14 11:25:05,894 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-14 11:25:05,894 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:25:05,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:25:05,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1708163684, now seen corresponding path program 1 times [2021-12-14 11:25:05,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:25:05,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678672124] [2021-12-14 11:25:05,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:25:05,895 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:25:05,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:25:05,896 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-14 11:25:05,898 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-14 11:25:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:05,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 11:25:05,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:25:06,053 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-14 11:25:06,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:25:06,144 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-14 11:25:06,145 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:25:06,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678672124] [2021-12-14 11:25:06,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678672124] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:25:06,145 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:25:06,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-14 11:25:06,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049367067] [2021-12-14 11:25:06,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:25:06,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:25:06,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:25:06,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:25:06,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:25:06,147 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-14 11:25:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:25:06,197 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-12-14 11:25:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:25:06,198 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-14 11:25:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:25:06,198 INFO L225 Difference]: With dead ends: 45 [2021-12-14 11:25:06,199 INFO L226 Difference]: Without dead ends: 27 [2021-12-14 11:25:06,199 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-14 11:25:06,200 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.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:25:06,200 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.0s Time] [2021-12-14 11:25:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-14 11:25:06,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-12-14 11:25:06,203 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-14 11:25:06,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-12-14 11:25:06,204 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 31 [2021-12-14 11:25:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:25:06,205 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-12-14 11:25:06,205 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-14 11:25:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-12-14 11:25:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 11:25:06,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:25:06,206 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-14 11:25:06,223 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-14 11:25:06,413 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-14 11:25:06,413 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:25:06,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:25:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1821751230, now seen corresponding path program 2 times [2021-12-14 11:25:06,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:25:06,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974239148] [2021-12-14 11:25:06,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:25:06,415 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:25:06,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:25:06,418 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-14 11:25:06,419 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-14 11:25:06,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-14 11:25:06,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:25:06,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 11:25:06,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:25:06,543 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-14 11:25:06,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:25:06,544 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:25:06,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974239148] [2021-12-14 11:25:06,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974239148] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:25:06,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:25:06,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:25:06,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847822788] [2021-12-14 11:25:06,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:25:06,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:25:06,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:25:06,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:25:06,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:25:06,546 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-14 11:25:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:25:06,580 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2021-12-14 11:25:06,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:25:06,580 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-14 11:25:06,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:25:06,581 INFO L225 Difference]: With dead ends: 45 [2021-12-14 11:25:06,581 INFO L226 Difference]: Without dead ends: 28 [2021-12-14 11:25:06,582 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-14 11:25:06,582 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-14 11:25:06,583 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-14 11:25:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-14 11:25:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-14 11:25:06,587 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-14 11:25:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-14 11:25:06,588 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2021-12-14 11:25:06,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:25:06,588 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-14 11:25:06,588 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-14 11:25:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-14 11:25:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 11:25:06,589 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:25:06,589 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-14 11:25:06,612 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-14 11:25:06,795 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-14 11:25:06,796 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:25:06,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:25:06,797 INFO L85 PathProgramCache]: Analyzing trace with hash 533240604, now seen corresponding path program 1 times [2021-12-14 11:25:06,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:25:06,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567404263] [2021-12-14 11:25:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:25:06,798 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:25:06,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:25:06,798 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-14 11:25:06,801 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-14 11:25:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:06,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 11:25:06,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:25:07,031 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-14 11:25:07,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:25:07,204 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-14 11:25:07,204 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:25:07,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567404263] [2021-12-14 11:25:07,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567404263] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:25:07,204 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:25:07,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-14 11:25:07,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939501158] [2021-12-14 11:25:07,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:25:07,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 11:25:07,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:25:07,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 11:25:07,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:25:07,205 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-14 11:25:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:25:07,378 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2021-12-14 11:25:07,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 11:25:07,379 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-14 11:25:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:25:07,379 INFO L225 Difference]: With dead ends: 65 [2021-12-14 11:25:07,379 INFO L226 Difference]: Without dead ends: 52 [2021-12-14 11:25:07,380 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-14 11:25:07,381 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-14 11:25:07,382 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-14 11:25:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-14 11:25:07,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2021-12-14 11:25:07,391 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-14 11:25:07,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-14 11:25:07,391 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2021-12-14 11:25:07,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:25:07,392 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-14 11:25:07,392 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-14 11:25:07,392 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-14 11:25:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 11:25:07,393 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:25:07,393 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-14 11:25:07,400 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-14 11:25:07,600 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-14 11:25:07,600 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:25:07,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:25:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash 850880602, now seen corresponding path program 1 times [2021-12-14 11:25:07,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:25:07,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406727319] [2021-12-14 11:25:07,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:25:07,601 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:25:07,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:25:07,611 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-14 11:25:07,613 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-14 11:25:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:25:07,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-14 11:25:07,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:25:08,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:08,040 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:25:08,041 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-14 11:25:08,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:08,393 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:25:08,393 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-14 11:25:08,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:08,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:25:08,511 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:25:08,511 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-14 11:25:08,714 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:25:08,716 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-14 11:25:08,830 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-14 11:25:08,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:25:17,365 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-14 11:25:17,369 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 11:25:17,369 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-14 11:25:17,372 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-14 11:25:17,377 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 11:25:17,377 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-14 11:25:24,865 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-14 11:25:24,871 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 11:25:24,871 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-14 11:25:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 14 refuted. 3 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 11:25:25,244 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:25:25,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406727319] [2021-12-14 11:25:25,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406727319] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:25:25,244 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:25:25,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2021-12-14 11:25:25,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754444009] [2021-12-14 11:25:25,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:25:25,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-14 11:25:25,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:25:25,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-14 11:25:25,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1455, Unknown=1, NotChecked=0, Total=1640 [2021-12-14 11:25:25,248 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-14 11:25:31,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:25:31,263 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2021-12-14 11:25:31,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-14 11:25:31,263 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-14 11:25:31,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:25:31,265 INFO L225 Difference]: With dead ends: 78 [2021-12-14 11:25:31,265 INFO L226 Difference]: Without dead ends: 74 [2021-12-14 11:25:31,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=366, Invalid=2602, Unknown=2, NotChecked=0, Total=2970 [2021-12-14 11:25:31,267 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 64 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-14 11:25:31,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 166 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 683 Invalid, 0 Unknown, 39 Unchecked, 2.4s Time] [2021-12-14 11:25:31,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-14 11:25:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2021-12-14 11:25:31,276 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-14 11:25:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2021-12-14 11:25:31,277 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 41 [2021-12-14 11:25:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:25:31,277 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2021-12-14 11:25:31,277 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-14 11:25:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2021-12-14 11:25:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 11:25:31,278 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:25:31,278 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-14 11:25:31,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-14 11:25:31,485 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-14 11:25:31,486 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:25:31,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:25:31,487 INFO L85 PathProgramCache]: Analyzing trace with hash 88846840, now seen corresponding path program 2 times [2021-12-14 11:25:31,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:25:31,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765660274] [2021-12-14 11:25:31,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:25:31,493 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:25:31,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:25:31,494 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-14 11:25:31,495 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-14 11:25:31,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 11:25:31,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:25:31,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 11:25:31,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:25:31,793 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-14 11:25:31,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:25:32,224 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-14 11:25:32,224 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:25:32,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765660274] [2021-12-14 11:25:32,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765660274] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:25:32,224 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:25:32,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2021-12-14 11:25:32,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203331155] [2021-12-14 11:25:32,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:25:32,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 11:25:32,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:25:32,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 11:25:32,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:25:32,226 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-14 11:25:32,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:25:32,718 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2021-12-14 11:25:32,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 11:25:32,719 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-14 11:25:32,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:25:32,720 INFO L225 Difference]: With dead ends: 104 [2021-12-14 11:25:32,720 INFO L226 Difference]: Without dead ends: 78 [2021-12-14 11:25:32,720 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-14 11:25:32,721 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 126 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 11:25:32,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 155 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 11:25:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-14 11:25:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2021-12-14 11:25:32,728 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-14 11:25:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2021-12-14 11:25:32,728 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 43 [2021-12-14 11:25:32,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:25:32,729 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2021-12-14 11:25:32,729 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-14 11:25:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2021-12-14 11:25:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 11:25:32,730 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:25:32,730 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-14 11:25:32,739 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-14 11:25:32,939 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-14 11:25:32,939 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:25:32,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:25:32,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1417469948, now seen corresponding path program 3 times [2021-12-14 11:25:32,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:25:32,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273509873] [2021-12-14 11:25:32,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 11:25:32,951 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:25:32,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:25:32,952 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-14 11:25:32,953 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-14 11:25:33,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 11:25:33,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:25:33,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 11:25:33,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:25:33,167 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-14 11:25:33,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:25:33,338 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-14 11:25:33,338 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:25:33,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273509873] [2021-12-14 11:25:33,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273509873] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:25:33,338 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:25:33,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2021-12-14 11:25:33,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798874607] [2021-12-14 11:25:33,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:25:33,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 11:25:33,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:25:33,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 11:25:33,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:25:33,339 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-14 11:25:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:25:33,565 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2021-12-14 11:25:33,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 11:25:33,566 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-14 11:25:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:25:33,566 INFO L225 Difference]: With dead ends: 77 [2021-12-14 11:25:33,566 INFO L226 Difference]: Without dead ends: 58 [2021-12-14 11:25:33,566 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-14 11:25:33,567 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 109 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:25:33,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 117 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:25:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-14 11:25:33,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2021-12-14 11:25:33,572 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-14 11:25:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2021-12-14 11:25:33,572 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2021-12-14 11:25:33,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:25:33,573 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2021-12-14 11:25:33,573 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-14 11:25:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2021-12-14 11:25:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 11:25:33,573 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:25:33,574 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-14 11:25:33,583 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-14 11:25:33,782 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-14 11:25:33,782 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:25:33,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:25:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2102516822, now seen corresponding path program 4 times [2021-12-14 11:25:33,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:25:33,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499864828] [2021-12-14 11:25:33,783 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 11:25:33,783 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:25:33,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:25:33,785 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-14 11:25:33,786 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-14 11:25:33,867 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 11:25:33,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:25:33,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 11:25:33,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:25:34,083 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-14 11:25:34,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:25:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-14 11:25:34,371 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:25:34,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499864828] [2021-12-14 11:25:34,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499864828] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:25:34,372 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:25:34,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2021-12-14 11:25:34,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887992381] [2021-12-14 11:25:34,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:25:34,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 11:25:34,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:25:34,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 11:25:34,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-12-14 11:25:34,373 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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-14 11:25:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:25:34,563 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-12-14 11:25:34,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 11:25:34,564 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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-14 11:25:34,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:25:34,564 INFO L225 Difference]: With dead ends: 64 [2021-12-14 11:25:34,564 INFO L226 Difference]: Without dead ends: 33 [2021-12-14 11:25:34,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-12-14 11:25:34,565 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:25:34,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 87 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:25:34,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-14 11:25:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-12-14 11:25:34,568 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-14 11:25:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-12-14 11:25:34,569 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 45 [2021-12-14 11:25:34,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:25:34,569 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-12-14 11:25:34,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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-14 11:25:34,569 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-12-14 11:25:34,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 11:25:34,570 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:25:34,570 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-14 11:25:34,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-14 11:25:34,776 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-14 11:25:34,777 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:25:34,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:25:34,777 INFO L85 PathProgramCache]: Analyzing trace with hash -457868326, now seen corresponding path program 5 times [2021-12-14 11:25:34,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:25:34,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416194160] [2021-12-14 11:25:34,778 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 11:25:34,778 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:25:34,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:25:34,779 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-14 11:25:34,780 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-14 11:25:34,863 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-14 11:25:34,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:25:34,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 11:25:34,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:25:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 11:25:35,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:25:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-14 11:25:35,418 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:25:35,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416194160] [2021-12-14 11:25:35,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416194160] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:25:35,419 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:25:35,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2021-12-14 11:25:35,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908500091] [2021-12-14 11:25:35,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:25:35,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 11:25:35,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:25:35,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 11:25:35,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-12-14 11:25:35,420 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-14 11:25:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:25:35,989 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2021-12-14 11:25:35,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-14 11:25:35,989 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2021-12-14 11:25:35,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:25:35,990 INFO L225 Difference]: With dead ends: 101 [2021-12-14 11:25:35,990 INFO L226 Difference]: Without dead ends: 82 [2021-12-14 11:25:35,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2021-12-14 11:25:35,991 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 115 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:25:35,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 173 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:25:35,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-14 11:25:35,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2021-12-14 11:25:35,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 50 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-14 11:25:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2021-12-14 11:25:35,996 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 49 [2021-12-14 11:25:35,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:25:35,997 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2021-12-14 11:25:35,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-14 11:25:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2021-12-14 11:25:35,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 11:25:35,997 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:25:35,997 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-14 11:25:36,006 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-14 11:25:36,204 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-14 11:25:36,205 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:25:36,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:25:36,205 INFO L85 PathProgramCache]: Analyzing trace with hash -376141416, now seen corresponding path program 6 times [2021-12-14 11:25:36,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:25:36,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540567604] [2021-12-14 11:25:36,206 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-14 11:25:36,206 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:25:36,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:25:36,207 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-14 11:25:36,208 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-14 11:25:36,470 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-12-14 11:25:36,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:25:36,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-14 11:25:36,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:25:36,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:36,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:36,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:36,872 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:25:36,872 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-14 11:25:37,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:25:37,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:37,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:37,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:37,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:37,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:37,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:25:37,165 INFO L354 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2021-12-14 11:25:37,165 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-14 11:25:37,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:37,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:37,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:37,330 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:25:37,331 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-14 11:25:37,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:37,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:37,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:37,533 INFO L354 Elim1Store]: treesize reduction 72, result has 37.9 percent of original size [2021-12-14 11:25:37,534 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-14 11:25:39,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:25:39,004 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:25:39,012 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:25:39,012 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-14 11:25:39,393 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-14 11:25:39,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:26:05,494 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-14 11:26:05,589 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-14 11:26:05,589 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 982604 treesize of output 1 [2021-12-14 11:26:06,012 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-14 11:26:06,038 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-14 11:26:06,038 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 8858 treesize of output 1 [2021-12-14 11:26:06,053 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-14 11:26:06,053 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:26:06,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540567604] [2021-12-14 11:26:06,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540567604] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:26:06,054 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:26:06,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 48 [2021-12-14 11:26:06,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932291122] [2021-12-14 11:26:06,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:26:06,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-14 11:26:06,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:26:06,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-14 11:26:06,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2062, Unknown=6, NotChecked=0, Total=2256 [2021-12-14 11:26:06,057 INFO L87 Difference]: Start difference. First operand 58 states and 67 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)