./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/pthread/triangular-longer-2.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85b94be996486a7516ccc33e88e36127bb614ed5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:31:49,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:31:49,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:31:49,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:31:49,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:31:49,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:31:49,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:31:49,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:31:49,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:31:49,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:31:49,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:31:49,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:31:49,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:31:49,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:31:49,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:31:49,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:31:49,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:31:49,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:31:49,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:31:49,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:31:49,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:31:49,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:31:49,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:31:49,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:31:49,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:31:49,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:31:49,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:31:49,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:31:49,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:31:49,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:31:49,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:31:49,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:31:49,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:31:49,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:31:49,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:31:49,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:31:49,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:31:49,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:31:49,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:31:49,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:31:49,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:31:49,609 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:31:49,638 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:31:49,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:31:49,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:31:49,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:31:49,640 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:31:49,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:31:49,641 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:31:49,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:31:49,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:31:49,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:31:49,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:31:49,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:31:49,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:31:49,642 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:31:49,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:31:49,643 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:31:49,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:31:49,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:31:49,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:31:49,644 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:31:49,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:31:49,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:31:49,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:31:49,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:31:49,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:31:49,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:31:49,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:31:49,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:31:49,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 85b94be996486a7516ccc33e88e36127bb614ed5 [2019-11-19 21:31:49,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:31:49,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:31:49,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:31:49,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:31:49,963 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:31:49,964 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longer-2.i [2019-11-19 21:31:50,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac606bab4/2054c6b1d41346d6971c6ccfb3353ace/FLAGf65e6778d [2019-11-19 21:31:50,552 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:31:50,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i [2019-11-19 21:31:50,577 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac606bab4/2054c6b1d41346d6971c6ccfb3353ace/FLAGf65e6778d [2019-11-19 21:31:50,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac606bab4/2054c6b1d41346d6971c6ccfb3353ace [2019-11-19 21:31:50,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:31:50,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:31:50,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:31:50,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:31:50,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:31:50,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:31:50" (1/1) ... [2019-11-19 21:31:50,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3a3022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:31:50, skipping insertion in model container [2019-11-19 21:31:50,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:31:50" (1/1) ... [2019-11-19 21:31:50,933 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:31:50,998 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:31:51,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:31:51,455 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:31:51,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:31:51,595 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:31:51,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:31:51 WrapperNode [2019-11-19 21:31:51,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:31:51,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:31:51,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:31:51,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:31:51,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:31:51" (1/1) ... [2019-11-19 21:31:51,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:31:51" (1/1) ... [2019-11-19 21:31:51,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:31:51,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:31:51,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:31:51,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:31:51,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:31:51" (1/1) ... [2019-11-19 21:31:51,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:31:51" (1/1) ... [2019-11-19 21:31:51,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:31:51" (1/1) ... [2019-11-19 21:31:51,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:31:51" (1/1) ... [2019-11-19 21:31:51,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:31:51" (1/1) ... [2019-11-19 21:31:51,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:31:51" (1/1) ... [2019-11-19 21:31:51,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:31:51" (1/1) ... [2019-11-19 21:31:51,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:31:51,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:31:51,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:31:51,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:31:51,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:31:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:31:51,835 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-11-19 21:31:51,835 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-11-19 21:31:51,835 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-11-19 21:31:51,836 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-11-19 21:31:51,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 21:31:51,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-19 21:31:51,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:31:51,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:31:51,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-19 21:31:51,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:31:51,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:31:51,841 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-19 21:31:52,193 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:31:52,193 INFO L285 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-19 21:31:52,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:31:52 BoogieIcfgContainer [2019-11-19 21:31:52,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:31:52,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:31:52,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:31:52,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:31:52,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:31:50" (1/3) ... [2019-11-19 21:31:52,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d2be9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:31:52, skipping insertion in model container [2019-11-19 21:31:52,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:31:51" (2/3) ... [2019-11-19 21:31:52,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d2be9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:31:52, skipping insertion in model container [2019-11-19 21:31:52,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:31:52" (3/3) ... [2019-11-19 21:31:52,208 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2019-11-19 21:31:52,253 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,254 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,254 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,254 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,255 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,255 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,255 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,256 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,256 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,256 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,256 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,257 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,257 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,257 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,257 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,258 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,258 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,258 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,258 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork3_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,259 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork3_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,259 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork3_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,259 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,259 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,260 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork3_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,262 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork3_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,262 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork3_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,263 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork3_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,263 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork3_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,264 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,264 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,265 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,265 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,266 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork5_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,266 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork5_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,266 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork5_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,267 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,267 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,267 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork5_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,267 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork5_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,268 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork5_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,268 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork5_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,269 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork5_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,270 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,271 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,271 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,271 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,272 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork2_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,273 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork2_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,273 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork2_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,274 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,274 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,274 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork2_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,275 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,275 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,276 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork2_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,276 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork2_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,277 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,277 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,278 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,278 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,278 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork4_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,278 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork4_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,279 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork4_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,279 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,279 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,279 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork4_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,280 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork4_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,280 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork4_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,280 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork4_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,280 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork4_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,281 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,282 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,282 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,282 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,283 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,283 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,283 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,284 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,284 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,285 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,285 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,285 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,286 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,289 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 21:31:52,315 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-19 21:31:52,316 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:31:52,323 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:31:52,332 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:31:52,349 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:31:52,349 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:31:52,350 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:31:52,350 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:31:52,350 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:31:52,350 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:31:52,350 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:31:52,350 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:31:52,363 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 93 transitions [2019-11-19 21:31:53,300 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8843 states. [2019-11-19 21:31:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states. [2019-11-19 21:31:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 21:31:53,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:31:53,328 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:31:53,328 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:31:53,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:31:53,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1140660711, now seen corresponding path program 1 times [2019-11-19 21:31:53,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:31:53,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080630593] [2019-11-19 21:31:53,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:31:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:31:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:31:53,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080630593] [2019-11-19 21:31:53,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:31:53,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:31:53,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183786047] [2019-11-19 21:31:53,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:31:53,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:31:53,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:31:53,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:31:53,836 INFO L87 Difference]: Start difference. First operand 8843 states. Second operand 5 states. [2019-11-19 21:31:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:31:54,225 INFO L93 Difference]: Finished difference Result 15656 states and 45634 transitions. [2019-11-19 21:31:54,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:31:54,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-19 21:31:54,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:31:54,285 INFO L225 Difference]: With dead ends: 15656 [2019-11-19 21:31:54,285 INFO L226 Difference]: Without dead ends: 4154 [2019-11-19 21:31:54,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:31:54,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4154 states. [2019-11-19 21:31:54,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4154 to 3146. [2019-11-19 21:31:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2019-11-19 21:31:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 8437 transitions. [2019-11-19 21:31:54,655 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 8437 transitions. Word has length 20 [2019-11-19 21:31:54,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:31:54,657 INFO L462 AbstractCegarLoop]: Abstraction has 3146 states and 8437 transitions. [2019-11-19 21:31:54,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:31:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 8437 transitions. [2019-11-19 21:31:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 21:31:54,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:31:54,667 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:31:54,667 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:31:54,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:31:54,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1505025343, now seen corresponding path program 1 times [2019-11-19 21:31:54,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:31:54,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938152337] [2019-11-19 21:31:54,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:31:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:31:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:31:54,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938152337] [2019-11-19 21:31:54,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:31:54,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:31:54,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108747773] [2019-11-19 21:31:54,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:31:54,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:31:54,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:31:54,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:31:54,854 INFO L87 Difference]: Start difference. First operand 3146 states and 8437 transitions. Second operand 5 states. [2019-11-19 21:31:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:31:55,019 INFO L93 Difference]: Finished difference Result 3839 states and 9823 transitions. [2019-11-19 21:31:55,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:31:55,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-19 21:31:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:31:55,038 INFO L225 Difference]: With dead ends: 3839 [2019-11-19 21:31:55,038 INFO L226 Difference]: Without dead ends: 2723 [2019-11-19 21:31:55,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:31:55,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2019-11-19 21:31:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 2615. [2019-11-19 21:31:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2615 states. [2019-11-19 21:31:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 6979 transitions. [2019-11-19 21:31:55,131 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 6979 transitions. Word has length 23 [2019-11-19 21:31:55,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:31:55,132 INFO L462 AbstractCegarLoop]: Abstraction has 2615 states and 6979 transitions. [2019-11-19 21:31:55,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:31:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 6979 transitions. [2019-11-19 21:31:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 21:31:55,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:31:55,134 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:31:55,134 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:31:55,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:31:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash 617551453, now seen corresponding path program 1 times [2019-11-19 21:31:55,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:31:55,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424613959] [2019-11-19 21:31:55,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:31:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:31:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:31:55,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424613959] [2019-11-19 21:31:55,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:31:55,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:31:55,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122077054] [2019-11-19 21:31:55,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:31:55,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:31:55,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:31:55,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:31:55,260 INFO L87 Difference]: Start difference. First operand 2615 states and 6979 transitions. Second operand 5 states. [2019-11-19 21:31:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:31:55,434 INFO L93 Difference]: Finished difference Result 4298 states and 10786 transitions. [2019-11-19 21:31:55,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 21:31:55,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-19 21:31:55,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:31:55,449 INFO L225 Difference]: With dead ends: 4298 [2019-11-19 21:31:55,449 INFO L226 Difference]: Without dead ends: 2471 [2019-11-19 21:31:55,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:31:55,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2019-11-19 21:31:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2372. [2019-11-19 21:31:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2372 states. [2019-11-19 21:31:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 6091 transitions. [2019-11-19 21:31:55,515 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 6091 transitions. Word has length 23 [2019-11-19 21:31:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:31:55,515 INFO L462 AbstractCegarLoop]: Abstraction has 2372 states and 6091 transitions. [2019-11-19 21:31:55,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:31:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 6091 transitions. [2019-11-19 21:31:55,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 21:31:55,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:31:55,518 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:31:55,518 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:31:55,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:31:55,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2021946373, now seen corresponding path program 1 times [2019-11-19 21:31:55,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:31:55,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754049674] [2019-11-19 21:31:55,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:31:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:31:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:31:55,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754049674] [2019-11-19 21:31:55,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:31:55,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 21:31:55,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030671240] [2019-11-19 21:31:55,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:31:55,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:31:55,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:31:55,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:31:55,630 INFO L87 Difference]: Start difference. First operand 2372 states and 6091 transitions. Second operand 6 states. [2019-11-19 21:31:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:31:55,833 INFO L93 Difference]: Finished difference Result 4676 states and 11587 transitions. [2019-11-19 21:31:55,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 21:31:55,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-19 21:31:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:31:55,849 INFO L225 Difference]: With dead ends: 4676 [2019-11-19 21:31:55,849 INFO L226 Difference]: Without dead ends: 2786 [2019-11-19 21:31:55,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-19 21:31:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2019-11-19 21:31:55,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2471. [2019-11-19 21:31:55,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2019-11-19 21:31:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 6295 transitions. [2019-11-19 21:31:55,916 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 6295 transitions. Word has length 26 [2019-11-19 21:31:55,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:31:55,917 INFO L462 AbstractCegarLoop]: Abstraction has 2471 states and 6295 transitions. [2019-11-19 21:31:55,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:31:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 6295 transitions. [2019-11-19 21:31:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:31:55,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:31:55,919 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:31:55,920 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:31:55,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:31:55,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1691198314, now seen corresponding path program 1 times [2019-11-19 21:31:55,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:31:55,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637814753] [2019-11-19 21:31:55,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:31:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:31:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:31:56,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637814753] [2019-11-19 21:31:56,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88114581] [2019-11-19 21:31:56,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:31:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:31:56,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 21:31:56,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:31:56,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:31:56,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:31:56,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:31:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:31:56,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:31:56,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-19 21:31:56,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96025750] [2019-11-19 21:31:56,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 21:31:56,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:31:56,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 21:31:56,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:31:56,173 INFO L87 Difference]: Start difference. First operand 2471 states and 6295 transitions. Second operand 8 states. [2019-11-19 21:31:56,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:31:56,369 INFO L93 Difference]: Finished difference Result 5243 states and 12721 transitions. [2019-11-19 21:31:56,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 21:31:56,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-19 21:31:56,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:31:56,389 INFO L225 Difference]: With dead ends: 5243 [2019-11-19 21:31:56,389 INFO L226 Difference]: Without dead ends: 3542 [2019-11-19 21:31:56,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-19 21:31:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3542 states. [2019-11-19 21:31:56,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3542 to 3182. [2019-11-19 21:31:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3182 states. [2019-11-19 21:31:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 7753 transitions. [2019-11-19 21:31:56,487 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 7753 transitions. Word has length 30 [2019-11-19 21:31:56,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:31:56,488 INFO L462 AbstractCegarLoop]: Abstraction has 3182 states and 7753 transitions. [2019-11-19 21:31:56,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 21:31:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 7753 transitions. [2019-11-19 21:31:56,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 21:31:56,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:31:56,493 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:31:56,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:31:56,698 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:31:56,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:31:56,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1231088071, now seen corresponding path program 1 times [2019-11-19 21:31:56,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:31:56,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884750740] [2019-11-19 21:31:56,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:31:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:31:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:31:56,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884750740] [2019-11-19 21:31:56,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164921359] [2019-11-19 21:31:56,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:31:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:31:56,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 21:31:56,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:31:56,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:31:56,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:31:56,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:31:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:31:56,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:31:56,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-19 21:31:56,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951101229] [2019-11-19 21:31:56,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 21:31:56,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:31:56,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 21:31:56,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:31:56,914 INFO L87 Difference]: Start difference. First operand 3182 states and 7753 transitions. Second operand 9 states. [2019-11-19 21:31:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:31:57,199 INFO L93 Difference]: Finished difference Result 5639 states and 13513 transitions. [2019-11-19 21:31:57,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 21:31:57,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-11-19 21:31:57,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:31:57,239 INFO L225 Difference]: With dead ends: 5639 [2019-11-19 21:31:57,240 INFO L226 Difference]: Without dead ends: 3938 [2019-11-19 21:31:57,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-11-19 21:31:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2019-11-19 21:31:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 2975. [2019-11-19 21:31:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2019-11-19 21:31:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 7303 transitions. [2019-11-19 21:31:57,392 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 7303 transitions. Word has length 34 [2019-11-19 21:31:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:31:57,393 INFO L462 AbstractCegarLoop]: Abstraction has 2975 states and 7303 transitions. [2019-11-19 21:31:57,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 21:31:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 7303 transitions. [2019-11-19 21:31:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 21:31:57,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:31:57,397 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:31:57,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:31:57,603 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:31:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:31:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1788382872, now seen corresponding path program 2 times [2019-11-19 21:31:57,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:31:57,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798946970] [2019-11-19 21:31:57,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:31:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:31:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 21:31:57,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798946970] [2019-11-19 21:31:57,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613048721] [2019-11-19 21:31:57,701 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:31:57,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 21:31:57,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:31:57,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 21:31:57,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:31:57,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:31:57,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:31:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 21:31:57,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:31:57,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-19 21:31:57,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013601146] [2019-11-19 21:31:57,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 21:31:57,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:31:57,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 21:31:57,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:31:57,795 INFO L87 Difference]: Start difference. First operand 2975 states and 7303 transitions. Second operand 9 states. [2019-11-19 21:31:58,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:31:58,093 INFO L93 Difference]: Finished difference Result 6251 states and 14737 transitions. [2019-11-19 21:31:58,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 21:31:58,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-11-19 21:31:58,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:31:58,106 INFO L225 Difference]: With dead ends: 6251 [2019-11-19 21:31:58,106 INFO L226 Difference]: Without dead ends: 4442 [2019-11-19 21:31:58,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-11-19 21:31:58,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2019-11-19 21:31:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 3578. [2019-11-19 21:31:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3578 states. [2019-11-19 21:31:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 3578 states and 8509 transitions. [2019-11-19 21:31:58,203 INFO L78 Accepts]: Start accepts. Automaton has 3578 states and 8509 transitions. Word has length 38 [2019-11-19 21:31:58,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:31:58,203 INFO L462 AbstractCegarLoop]: Abstraction has 3578 states and 8509 transitions. [2019-11-19 21:31:58,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 21:31:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3578 states and 8509 transitions. [2019-11-19 21:31:58,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 21:31:58,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:31:58,209 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:31:58,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:31:58,414 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:31:58,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:31:58,414 INFO L82 PathProgramCache]: Analyzing trace with hash -902755643, now seen corresponding path program 3 times [2019-11-19 21:31:58,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:31:58,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689382445] [2019-11-19 21:31:58,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:31:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:31:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 21:31:58,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689382445] [2019-11-19 21:31:58,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402064935] [2019-11-19 21:31:58,576 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:31:58,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-19 21:31:58,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:31:58,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 21:31:58,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:31:58,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:31:58,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:31:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 21:31:58,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:31:58,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-19 21:31:58,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541371451] [2019-11-19 21:31:58,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:31:58,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:31:58,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:31:58,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:31:58,753 INFO L87 Difference]: Start difference. First operand 3578 states and 8509 transitions. Second operand 10 states. [2019-11-19 21:31:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:31:59,085 INFO L93 Difference]: Finished difference Result 5261 states and 12316 transitions. [2019-11-19 21:31:59,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 21:31:59,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2019-11-19 21:31:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:31:59,100 INFO L225 Difference]: With dead ends: 5261 [2019-11-19 21:31:59,100 INFO L226 Difference]: Without dead ends: 3974 [2019-11-19 21:31:59,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-19 21:31:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2019-11-19 21:31:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 3614. [2019-11-19 21:31:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3614 states. [2019-11-19 21:31:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 8617 transitions. [2019-11-19 21:31:59,193 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 8617 transitions. Word has length 42 [2019-11-19 21:31:59,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:31:59,194 INFO L462 AbstractCegarLoop]: Abstraction has 3614 states and 8617 transitions. [2019-11-19 21:31:59,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:31:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 8617 transitions. [2019-11-19 21:31:59,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 21:31:59,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:31:59,200 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:31:59,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:31:59,403 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:31:59,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:31:59,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1649431109, now seen corresponding path program 4 times [2019-11-19 21:31:59,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:31:59,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988839544] [2019-11-19 21:31:59,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:31:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:31:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:31:59,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988839544] [2019-11-19 21:31:59,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786560964] [2019-11-19 21:31:59,528 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:31:59,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 21:31:59,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:31:59,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 21:31:59,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:31:59,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:31:59,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:31:59,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:31:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:31:59,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:31:59,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-19 21:31:59,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027290791] [2019-11-19 21:31:59,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 21:31:59,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:31:59,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 21:31:59,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-19 21:31:59,633 INFO L87 Difference]: Start difference. First operand 3614 states and 8617 transitions. Second operand 11 states. [2019-11-19 21:31:59,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:31:59,988 INFO L93 Difference]: Finished difference Result 5927 states and 14089 transitions. [2019-11-19 21:31:59,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 21:31:59,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-11-19 21:31:59,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:00,000 INFO L225 Difference]: With dead ends: 5927 [2019-11-19 21:32:00,000 INFO L226 Difference]: Without dead ends: 4010 [2019-11-19 21:32:00,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-11-19 21:32:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4010 states. [2019-11-19 21:32:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 3902. [2019-11-19 21:32:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3902 states. [2019-11-19 21:32:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3902 states to 3902 states and 9193 transitions. [2019-11-19 21:32:00,095 INFO L78 Accepts]: Start accepts. Automaton has 3902 states and 9193 transitions. Word has length 42 [2019-11-19 21:32:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:00,096 INFO L462 AbstractCegarLoop]: Abstraction has 3902 states and 9193 transitions. [2019-11-19 21:32:00,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 21:32:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3902 states and 9193 transitions. [2019-11-19 21:32:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 21:32:00,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:00,101 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:00,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:00,305 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:00,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:00,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1914634915, now seen corresponding path program 5 times [2019-11-19 21:32:00,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:00,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226905815] [2019-11-19 21:32:00,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:00,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226905815] [2019-11-19 21:32:00,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221163268] [2019-11-19 21:32:00,427 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:00,488 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-11-19 21:32:00,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:00,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 21:32:00,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:00,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:00,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:00,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:00,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-19 21:32:00,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517004537] [2019-11-19 21:32:00,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 21:32:00,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:00,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 21:32:00,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-19 21:32:00,523 INFO L87 Difference]: Start difference. First operand 3902 states and 9193 transitions. Second operand 11 states. [2019-11-19 21:32:00,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:00,984 INFO L93 Difference]: Finished difference Result 7241 states and 17158 transitions. [2019-11-19 21:32:00,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 21:32:00,985 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-11-19 21:32:00,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:00,998 INFO L225 Difference]: With dead ends: 7241 [2019-11-19 21:32:00,998 INFO L226 Difference]: Without dead ends: 4586 [2019-11-19 21:32:00,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2019-11-19 21:32:01,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2019-11-19 21:32:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 4190. [2019-11-19 21:32:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-11-19 21:32:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 9769 transitions. [2019-11-19 21:32:01,088 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 9769 transitions. Word has length 42 [2019-11-19 21:32:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:01,088 INFO L462 AbstractCegarLoop]: Abstraction has 4190 states and 9769 transitions. [2019-11-19 21:32:01,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 21:32:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 9769 transitions. [2019-11-19 21:32:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 21:32:01,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:01,095 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1] [2019-11-19 21:32:01,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:01,304 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:01,304 INFO L82 PathProgramCache]: Analyzing trace with hash -486122301, now seen corresponding path program 6 times [2019-11-19 21:32:01,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:01,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827842783] [2019-11-19 21:32:01,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:01,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827842783] [2019-11-19 21:32:01,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21987629] [2019-11-19 21:32:01,470 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:01,541 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-19 21:32:01,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:01,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 21:32:01,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:01,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:01,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:01,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:01,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:01,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-19 21:32:01,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348163647] [2019-11-19 21:32:01,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 21:32:01,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:01,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 21:32:01,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-19 21:32:01,611 INFO L87 Difference]: Start difference. First operand 4190 states and 9769 transitions. Second operand 13 states. [2019-11-19 21:32:02,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:02,014 INFO L93 Difference]: Finished difference Result 6755 states and 15745 transitions. [2019-11-19 21:32:02,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 21:32:02,015 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2019-11-19 21:32:02,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:02,027 INFO L225 Difference]: With dead ends: 6755 [2019-11-19 21:32:02,028 INFO L226 Difference]: Without dead ends: 5054 [2019-11-19 21:32:02,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2019-11-19 21:32:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5054 states. [2019-11-19 21:32:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5054 to 4442. [2019-11-19 21:32:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4442 states. [2019-11-19 21:32:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4442 states to 4442 states and 10237 transitions. [2019-11-19 21:32:02,113 INFO L78 Accepts]: Start accepts. Automaton has 4442 states and 10237 transitions. Word has length 50 [2019-11-19 21:32:02,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:02,114 INFO L462 AbstractCegarLoop]: Abstraction has 4442 states and 10237 transitions. [2019-11-19 21:32:02,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 21:32:02,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4442 states and 10237 transitions. [2019-11-19 21:32:02,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 21:32:02,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:02,121 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1] [2019-11-19 21:32:02,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:02,326 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:02,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:02,327 INFO L82 PathProgramCache]: Analyzing trace with hash 291359521, now seen corresponding path program 7 times [2019-11-19 21:32:02,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:02,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984346412] [2019-11-19 21:32:02,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:02,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984346412] [2019-11-19 21:32:02,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887014189] [2019-11-19 21:32:02,483 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:02,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 21:32:02,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:02,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:02,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:02,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:02,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-19 21:32:02,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384151832] [2019-11-19 21:32:02,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 21:32:02,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:02,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 21:32:02,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-19 21:32:02,586 INFO L87 Difference]: Start difference. First operand 4442 states and 10237 transitions. Second operand 13 states. [2019-11-19 21:32:02,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:02,983 INFO L93 Difference]: Finished difference Result 7007 states and 16249 transitions. [2019-11-19 21:32:02,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 21:32:02,983 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2019-11-19 21:32:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:02,995 INFO L225 Difference]: With dead ends: 7007 [2019-11-19 21:32:02,995 INFO L226 Difference]: Without dead ends: 4874 [2019-11-19 21:32:02,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2019-11-19 21:32:03,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-11-19 21:32:03,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4622. [2019-11-19 21:32:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4622 states. [2019-11-19 21:32:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4622 states to 4622 states and 10633 transitions. [2019-11-19 21:32:03,091 INFO L78 Accepts]: Start accepts. Automaton has 4622 states and 10633 transitions. Word has length 50 [2019-11-19 21:32:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:03,091 INFO L462 AbstractCegarLoop]: Abstraction has 4622 states and 10633 transitions. [2019-11-19 21:32:03,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 21:32:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 4622 states and 10633 transitions. [2019-11-19 21:32:03,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-19 21:32:03,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:03,098 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:03,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:03,304 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:03,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:03,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1651258908, now seen corresponding path program 8 times [2019-11-19 21:32:03,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:03,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778081310] [2019-11-19 21:32:03,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:03,455 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:03,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778081310] [2019-11-19 21:32:03,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571364591] [2019-11-19 21:32:03,457 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:03,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 21:32:03,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:03,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 21:32:03,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:03,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:03,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:03,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:03,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:03,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-11-19 21:32:03,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180176654] [2019-11-19 21:32:03,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 21:32:03,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:03,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 21:32:03,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-19 21:32:03,562 INFO L87 Difference]: Start difference. First operand 4622 states and 10633 transitions. Second operand 14 states. [2019-11-19 21:32:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:04,108 INFO L93 Difference]: Finished difference Result 6935 states and 16105 transitions. [2019-11-19 21:32:04,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 21:32:04,109 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-11-19 21:32:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:04,117 INFO L225 Difference]: With dead ends: 6935 [2019-11-19 21:32:04,117 INFO L226 Difference]: Without dead ends: 5234 [2019-11-19 21:32:04,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-11-19 21:32:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5234 states. [2019-11-19 21:32:04,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5234 to 3686. [2019-11-19 21:32:04,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3686 states. [2019-11-19 21:32:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 8719 transitions. [2019-11-19 21:32:04,198 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 8719 transitions. Word has length 54 [2019-11-19 21:32:04,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:04,198 INFO L462 AbstractCegarLoop]: Abstraction has 3686 states and 8719 transitions. [2019-11-19 21:32:04,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 21:32:04,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 8719 transitions. [2019-11-19 21:32:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-19 21:32:04,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:04,203 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:04,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:04,414 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:04,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:04,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1537327553, now seen corresponding path program 9 times [2019-11-19 21:32:04,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:04,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105608779] [2019-11-19 21:32:04,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 21:32:04,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105608779] [2019-11-19 21:32:04,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486255799] [2019-11-19 21:32:04,556 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:04,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-19 21:32:04,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:04,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-19 21:32:04,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:04,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:04,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 21:32:04,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:04,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-11-19 21:32:04,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223168681] [2019-11-19 21:32:04,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 21:32:04,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:04,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 21:32:04,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-11-19 21:32:04,661 INFO L87 Difference]: Start difference. First operand 3686 states and 8719 transitions. Second operand 14 states. [2019-11-19 21:32:05,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:05,034 INFO L93 Difference]: Finished difference Result 6557 states and 14908 transitions. [2019-11-19 21:32:05,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 21:32:05,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-11-19 21:32:05,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:05,043 INFO L225 Difference]: With dead ends: 6557 [2019-11-19 21:32:05,043 INFO L226 Difference]: Without dead ends: 5270 [2019-11-19 21:32:05,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2019-11-19 21:32:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5270 states. [2019-11-19 21:32:05,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5270 to 4910. [2019-11-19 21:32:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4910 states. [2019-11-19 21:32:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 11209 transitions. [2019-11-19 21:32:05,128 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 11209 transitions. Word has length 58 [2019-11-19 21:32:05,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:05,129 INFO L462 AbstractCegarLoop]: Abstraction has 4910 states and 11209 transitions. [2019-11-19 21:32:05,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 21:32:05,129 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 11209 transitions. [2019-11-19 21:32:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-19 21:32:05,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:05,137 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:05,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:05,341 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:05,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:05,341 INFO L82 PathProgramCache]: Analyzing trace with hash -205452991, now seen corresponding path program 10 times [2019-11-19 21:32:05,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:05,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542425472] [2019-11-19 21:32:05,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:05,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542425472] [2019-11-19 21:32:05,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875107506] [2019-11-19 21:32:05,505 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:05,561 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 21:32:05,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:05,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 21:32:05,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:05,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:05,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:05,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:05,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:05,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-11-19 21:32:05,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796761231] [2019-11-19 21:32:05,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 21:32:05,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:05,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 21:32:05,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-19 21:32:05,600 INFO L87 Difference]: Start difference. First operand 4910 states and 11209 transitions. Second operand 15 states. [2019-11-19 21:32:06,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:06,066 INFO L93 Difference]: Finished difference Result 7223 states and 16681 transitions. [2019-11-19 21:32:06,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-19 21:32:06,072 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2019-11-19 21:32:06,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:06,079 INFO L225 Difference]: With dead ends: 7223 [2019-11-19 21:32:06,080 INFO L226 Difference]: Without dead ends: 5306 [2019-11-19 21:32:06,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2019-11-19 21:32:06,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5306 states. [2019-11-19 21:32:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5306 to 5198. [2019-11-19 21:32:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5198 states. [2019-11-19 21:32:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5198 states to 5198 states and 11785 transitions. [2019-11-19 21:32:06,166 INFO L78 Accepts]: Start accepts. Automaton has 5198 states and 11785 transitions. Word has length 58 [2019-11-19 21:32:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:06,167 INFO L462 AbstractCegarLoop]: Abstraction has 5198 states and 11785 transitions. [2019-11-19 21:32:06,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 21:32:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 5198 states and 11785 transitions. [2019-11-19 21:32:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-19 21:32:06,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:06,179 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:06,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:06,384 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:06,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:06,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2034531810, now seen corresponding path program 11 times [2019-11-19 21:32:06,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:06,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072251961] [2019-11-19 21:32:06,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 21:32:06,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072251961] [2019-11-19 21:32:06,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106803916] [2019-11-19 21:32:06,517 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:06,572 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-19 21:32:06,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:06,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 21:32:06,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:06,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:06,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 21:32:06,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:06,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-11-19 21:32:06,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505090522] [2019-11-19 21:32:06,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 21:32:06,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:06,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 21:32:06,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-19 21:32:06,617 INFO L87 Difference]: Start difference. First operand 5198 states and 11785 transitions. Second operand 15 states. [2019-11-19 21:32:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:07,083 INFO L93 Difference]: Finished difference Result 7655 states and 17545 transitions. [2019-11-19 21:32:07,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-19 21:32:07,084 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2019-11-19 21:32:07,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:07,092 INFO L225 Difference]: With dead ends: 7655 [2019-11-19 21:32:07,092 INFO L226 Difference]: Without dead ends: 5846 [2019-11-19 21:32:07,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2019-11-19 21:32:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5846 states. [2019-11-19 21:32:07,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5846 to 5342. [2019-11-19 21:32:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5342 states. [2019-11-19 21:32:07,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5342 states to 5342 states and 12073 transitions. [2019-11-19 21:32:07,210 INFO L78 Accepts]: Start accepts. Automaton has 5342 states and 12073 transitions. Word has length 62 [2019-11-19 21:32:07,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:07,211 INFO L462 AbstractCegarLoop]: Abstraction has 5342 states and 12073 transitions. [2019-11-19 21:32:07,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 21:32:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5342 states and 12073 transitions. [2019-11-19 21:32:07,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-19 21:32:07,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:07,223 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:07,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:07,427 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:07,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:07,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1631692865, now seen corresponding path program 12 times [2019-11-19 21:32:07,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:07,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387511124] [2019-11-19 21:32:07,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:07,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387511124] [2019-11-19 21:32:07,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173949362] [2019-11-19 21:32:07,727 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:07,788 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-11-19 21:32:07,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:07,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 21:32:07,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:07,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:07,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:07,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:07,829 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:07,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:07,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-11-19 21:32:07,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481922143] [2019-11-19 21:32:07,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 21:32:07,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:07,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 21:32:07,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-19 21:32:07,832 INFO L87 Difference]: Start difference. First operand 5342 states and 12073 transitions. Second operand 17 states. [2019-11-19 21:32:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:08,346 INFO L93 Difference]: Finished difference Result 7655 states and 17545 transitions. [2019-11-19 21:32:08,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-19 21:32:08,346 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-11-19 21:32:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:08,352 INFO L225 Difference]: With dead ends: 7655 [2019-11-19 21:32:08,352 INFO L226 Difference]: Without dead ends: 5738 [2019-11-19 21:32:08,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2019-11-19 21:32:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5738 states. [2019-11-19 21:32:08,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5738 to 5630. [2019-11-19 21:32:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5630 states. [2019-11-19 21:32:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5630 states to 5630 states and 12649 transitions. [2019-11-19 21:32:08,440 INFO L78 Accepts]: Start accepts. Automaton has 5630 states and 12649 transitions. Word has length 66 [2019-11-19 21:32:08,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:08,441 INFO L462 AbstractCegarLoop]: Abstraction has 5630 states and 12649 transitions. [2019-11-19 21:32:08,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 21:32:08,441 INFO L276 IsEmpty]: Start isEmpty. Operand 5630 states and 12649 transitions. [2019-11-19 21:32:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-19 21:32:08,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:08,448 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:08,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:08,652 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:08,653 INFO L82 PathProgramCache]: Analyzing trace with hash -817020387, now seen corresponding path program 13 times [2019-11-19 21:32:08,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:08,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625778014] [2019-11-19 21:32:08,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:08,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625778014] [2019-11-19 21:32:08,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606282785] [2019-11-19 21:32:08,818 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:08,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 21:32:08,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:08,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:08,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:08,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:08,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-11-19 21:32:08,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485198109] [2019-11-19 21:32:08,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 21:32:08,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:08,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 21:32:08,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-19 21:32:08,927 INFO L87 Difference]: Start difference. First operand 5630 states and 12649 transitions. Second operand 17 states. [2019-11-19 21:32:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:09,508 INFO L93 Difference]: Finished difference Result 8969 states and 20614 transitions. [2019-11-19 21:32:09,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 21:32:09,508 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-11-19 21:32:09,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:09,516 INFO L225 Difference]: With dead ends: 8969 [2019-11-19 21:32:09,516 INFO L226 Difference]: Without dead ends: 6314 [2019-11-19 21:32:09,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=716, Unknown=0, NotChecked=0, Total=992 [2019-11-19 21:32:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6314 states. [2019-11-19 21:32:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6314 to 5918. [2019-11-19 21:32:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5918 states. [2019-11-19 21:32:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5918 states to 5918 states and 13225 transitions. [2019-11-19 21:32:09,616 INFO L78 Accepts]: Start accepts. Automaton has 5918 states and 13225 transitions. Word has length 66 [2019-11-19 21:32:09,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:09,616 INFO L462 AbstractCegarLoop]: Abstraction has 5918 states and 13225 transitions. [2019-11-19 21:32:09,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 21:32:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 5918 states and 13225 transitions. [2019-11-19 21:32:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-19 21:32:09,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:09,625 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:09,828 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:09,828 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:09,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:09,829 INFO L82 PathProgramCache]: Analyzing trace with hash -801355715, now seen corresponding path program 14 times [2019-11-19 21:32:09,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:09,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562616424] [2019-11-19 21:32:09,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:10,029 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:10,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562616424] [2019-11-19 21:32:10,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274897616] [2019-11-19 21:32:10,029 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:10,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 21:32:10,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:10,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-19 21:32:10,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:10,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:10,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:10,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:10,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:10,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-11-19 21:32:10,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046132994] [2019-11-19 21:32:10,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-19 21:32:10,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:10,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 21:32:10,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-11-19 21:32:10,136 INFO L87 Difference]: Start difference. First operand 5918 states and 13225 transitions. Second operand 19 states. [2019-11-19 21:32:10,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:10,796 INFO L93 Difference]: Finished difference Result 8483 states and 19201 transitions. [2019-11-19 21:32:10,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 21:32:10,796 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 74 [2019-11-19 21:32:10,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:10,803 INFO L225 Difference]: With dead ends: 8483 [2019-11-19 21:32:10,803 INFO L226 Difference]: Without dead ends: 6782 [2019-11-19 21:32:10,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=319, Invalid=871, Unknown=0, NotChecked=0, Total=1190 [2019-11-19 21:32:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6782 states. [2019-11-19 21:32:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6782 to 6170. [2019-11-19 21:32:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6170 states. [2019-11-19 21:32:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6170 states to 6170 states and 13693 transitions. [2019-11-19 21:32:10,986 INFO L78 Accepts]: Start accepts. Automaton has 6170 states and 13693 transitions. Word has length 74 [2019-11-19 21:32:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:10,986 INFO L462 AbstractCegarLoop]: Abstraction has 6170 states and 13693 transitions. [2019-11-19 21:32:10,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-19 21:32:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 6170 states and 13693 transitions. [2019-11-19 21:32:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-19 21:32:10,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:10,996 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:11,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:11,197 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash -528879461, now seen corresponding path program 15 times [2019-11-19 21:32:11,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:11,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608420135] [2019-11-19 21:32:11,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:11,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608420135] [2019-11-19 21:32:11,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743000298] [2019-11-19 21:32:11,427 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:11,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-19 21:32:11,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:11,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-19 21:32:11,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:11,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:11,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:11,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:11,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-11-19 21:32:11,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053373649] [2019-11-19 21:32:11,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-19 21:32:11,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:11,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 21:32:11,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-11-19 21:32:11,577 INFO L87 Difference]: Start difference. First operand 6170 states and 13693 transitions. Second operand 19 states. [2019-11-19 21:32:12,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:12,269 INFO L93 Difference]: Finished difference Result 9869 states and 22414 transitions. [2019-11-19 21:32:12,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-19 21:32:12,270 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 74 [2019-11-19 21:32:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:12,277 INFO L225 Difference]: With dead ends: 9869 [2019-11-19 21:32:12,277 INFO L226 Difference]: Without dead ends: 7214 [2019-11-19 21:32:12,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=352, Invalid=908, Unknown=0, NotChecked=0, Total=1260 [2019-11-19 21:32:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7214 states. [2019-11-19 21:32:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7214 to 6458. [2019-11-19 21:32:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6458 states. [2019-11-19 21:32:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 14269 transitions. [2019-11-19 21:32:12,377 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 14269 transitions. Word has length 74 [2019-11-19 21:32:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:12,378 INFO L462 AbstractCegarLoop]: Abstraction has 6458 states and 14269 transitions. [2019-11-19 21:32:12,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-19 21:32:12,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 14269 transitions. [2019-11-19 21:32:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 21:32:12,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:12,386 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:12,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:12,590 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:12,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1101425861, now seen corresponding path program 16 times [2019-11-19 21:32:12,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:12,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672444935] [2019-11-19 21:32:12,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 21:32:12,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672444935] [2019-11-19 21:32:12,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751999471] [2019-11-19 21:32:12,801 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:12,867 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 21:32:12,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:12,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-19 21:32:12,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:12,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:12,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 21:32:12,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:12,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-11-19 21:32:12,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074396233] [2019-11-19 21:32:12,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-19 21:32:12,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:12,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-19 21:32:12,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-11-19 21:32:12,923 INFO L87 Difference]: Start difference. First operand 6458 states and 14269 transitions. Second operand 20 states. [2019-11-19 21:32:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:13,639 INFO L93 Difference]: Finished difference Result 8141 states and 18076 transitions. [2019-11-19 21:32:13,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 21:32:13,639 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2019-11-19 21:32:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:13,648 INFO L225 Difference]: With dead ends: 8141 [2019-11-19 21:32:13,648 INFO L226 Difference]: Without dead ends: 6854 [2019-11-19 21:32:13,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=379, Invalid=881, Unknown=0, NotChecked=0, Total=1260 [2019-11-19 21:32:13,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6854 states. [2019-11-19 21:32:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6854 to 6494. [2019-11-19 21:32:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6494 states. [2019-11-19 21:32:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6494 states to 6494 states and 14377 transitions. [2019-11-19 21:32:13,748 INFO L78 Accepts]: Start accepts. Automaton has 6494 states and 14377 transitions. Word has length 82 [2019-11-19 21:32:13,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:13,749 INFO L462 AbstractCegarLoop]: Abstraction has 6494 states and 14377 transitions. [2019-11-19 21:32:13,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-19 21:32:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6494 states and 14377 transitions. [2019-11-19 21:32:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 21:32:13,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:13,759 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:13,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:13,963 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:13,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:13,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1450760891, now seen corresponding path program 17 times [2019-11-19 21:32:13,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:13,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675301814] [2019-11-19 21:32:13,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:14,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675301814] [2019-11-19 21:32:14,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902439586] [2019-11-19 21:32:14,219 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:14,280 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-19 21:32:14,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:14,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 21:32:14,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:14,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:14,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:14,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:14,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:14,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-11-19 21:32:14,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725412841] [2019-11-19 21:32:14,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-19 21:32:14,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:14,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-19 21:32:14,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-11-19 21:32:14,313 INFO L87 Difference]: Start difference. First operand 6494 states and 14377 transitions. Second operand 21 states. [2019-11-19 21:32:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:15,072 INFO L93 Difference]: Finished difference Result 8807 states and 19849 transitions. [2019-11-19 21:32:15,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-19 21:32:15,073 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2019-11-19 21:32:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:15,082 INFO L225 Difference]: With dead ends: 8807 [2019-11-19 21:32:15,082 INFO L226 Difference]: Without dead ends: 6890 [2019-11-19 21:32:15,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=441, Invalid=1041, Unknown=0, NotChecked=0, Total=1482 [2019-11-19 21:32:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6890 states. [2019-11-19 21:32:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6890 to 6782. [2019-11-19 21:32:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6782 states. [2019-11-19 21:32:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6782 states to 6782 states and 14953 transitions. [2019-11-19 21:32:15,222 INFO L78 Accepts]: Start accepts. Automaton has 6782 states and 14953 transitions. Word has length 82 [2019-11-19 21:32:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:15,223 INFO L462 AbstractCegarLoop]: Abstraction has 6782 states and 14953 transitions. [2019-11-19 21:32:15,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-19 21:32:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6782 states and 14953 transitions. [2019-11-19 21:32:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 21:32:15,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:15,237 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:15,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:15,441 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:15,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:15,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2100870887, now seen corresponding path program 18 times [2019-11-19 21:32:15,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:15,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964001913] [2019-11-19 21:32:15,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:15,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964001913] [2019-11-19 21:32:15,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783673812] [2019-11-19 21:32:15,706 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:15,862 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-19 21:32:15,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:15,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 21:32:15,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:15,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:15,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:15,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:15,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-11-19 21:32:15,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705968811] [2019-11-19 21:32:15,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-19 21:32:15,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:15,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-19 21:32:15,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-11-19 21:32:15,905 INFO L87 Difference]: Start difference. First operand 6782 states and 14953 transitions. Second operand 21 states. [2019-11-19 21:32:16,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:16,697 INFO L93 Difference]: Finished difference Result 10121 states and 22918 transitions. [2019-11-19 21:32:16,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-19 21:32:16,697 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2019-11-19 21:32:16,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:16,706 INFO L225 Difference]: With dead ends: 10121 [2019-11-19 21:32:16,707 INFO L226 Difference]: Without dead ends: 7466 [2019-11-19 21:32:16,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2019-11-19 21:32:16,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2019-11-19 21:32:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7070. [2019-11-19 21:32:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7070 states. [2019-11-19 21:32:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7070 states to 7070 states and 15529 transitions. [2019-11-19 21:32:16,841 INFO L78 Accepts]: Start accepts. Automaton has 7070 states and 15529 transitions. Word has length 82 [2019-11-19 21:32:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:16,842 INFO L462 AbstractCegarLoop]: Abstraction has 7070 states and 15529 transitions. [2019-11-19 21:32:16,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-19 21:32:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 7070 states and 15529 transitions. [2019-11-19 21:32:16,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-19 21:32:16,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:16,861 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:17,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:17,066 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:17,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:17,066 INFO L82 PathProgramCache]: Analyzing trace with hash -508424391, now seen corresponding path program 19 times [2019-11-19 21:32:17,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:17,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089966053] [2019-11-19 21:32:17,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:17,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089966053] [2019-11-19 21:32:17,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803960104] [2019-11-19 21:32:17,467 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:17,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-19 21:32:17,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:17,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:17,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:17,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:17,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:17,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-11-19 21:32:17,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631269042] [2019-11-19 21:32:17,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-19 21:32:17,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:17,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-19 21:32:17,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-11-19 21:32:17,636 INFO L87 Difference]: Start difference. First operand 7070 states and 15529 transitions. Second operand 23 states. [2019-11-19 21:32:18,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:18,724 INFO L93 Difference]: Finished difference Result 9383 states and 21001 transitions. [2019-11-19 21:32:18,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-19 21:32:18,725 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 90 [2019-11-19 21:32:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:18,737 INFO L225 Difference]: With dead ends: 9383 [2019-11-19 21:32:18,737 INFO L226 Difference]: Without dead ends: 7466 [2019-11-19 21:32:18,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=539, Invalid=1267, Unknown=0, NotChecked=0, Total=1806 [2019-11-19 21:32:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2019-11-19 21:32:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7358. [2019-11-19 21:32:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7358 states. [2019-11-19 21:32:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7358 states to 7358 states and 16105 transitions. [2019-11-19 21:32:18,882 INFO L78 Accepts]: Start accepts. Automaton has 7358 states and 16105 transitions. Word has length 90 [2019-11-19 21:32:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:18,883 INFO L462 AbstractCegarLoop]: Abstraction has 7358 states and 16105 transitions. [2019-11-19 21:32:18,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-19 21:32:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 7358 states and 16105 transitions. [2019-11-19 21:32:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-19 21:32:18,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:18,895 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:19,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:19,102 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:19,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:19,102 INFO L82 PathProgramCache]: Analyzing trace with hash -462212201, now seen corresponding path program 20 times [2019-11-19 21:32:19,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:19,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470437501] [2019-11-19 21:32:19,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:19,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470437501] [2019-11-19 21:32:19,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488058195] [2019-11-19 21:32:19,345 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:19,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 21:32:19,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:19,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-19 21:32:19,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:19,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:19,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:19,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:19,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-11-19 21:32:19,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147350054] [2019-11-19 21:32:19,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-19 21:32:19,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:19,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-19 21:32:19,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-11-19 21:32:19,478 INFO L87 Difference]: Start difference. First operand 7358 states and 16105 transitions. Second operand 23 states. [2019-11-19 21:32:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:20,331 INFO L93 Difference]: Finished difference Result 9671 states and 21577 transitions. [2019-11-19 21:32:20,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-19 21:32:20,332 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 90 [2019-11-19 21:32:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:20,340 INFO L225 Difference]: With dead ends: 9671 [2019-11-19 21:32:20,340 INFO L226 Difference]: Without dead ends: 7538 [2019-11-19 21:32:20,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=529, Invalid=1277, Unknown=0, NotChecked=0, Total=1806 [2019-11-19 21:32:20,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7538 states. [2019-11-19 21:32:20,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7538 to 4775. [2019-11-19 21:32:20,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4775 states. [2019-11-19 21:32:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 10903 transitions. [2019-11-19 21:32:20,407 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 10903 transitions. Word has length 90 [2019-11-19 21:32:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:20,407 INFO L462 AbstractCegarLoop]: Abstraction has 4775 states and 10903 transitions. [2019-11-19 21:32:20,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-19 21:32:20,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 10903 transitions. [2019-11-19 21:32:20,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-19 21:32:20,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:20,410 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:20,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:20,611 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:20,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:20,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1640757414, now seen corresponding path program 21 times [2019-11-19 21:32:20,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:20,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514753492] [2019-11-19 21:32:20,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:20,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514753492] [2019-11-19 21:32:20,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103384846] [2019-11-19 21:32:20,957 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:21,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-19 21:32:21,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:21,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-19 21:32:21,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:21,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:21,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:21,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:21,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:21,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-11-19 21:32:21,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893489840] [2019-11-19 21:32:21,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-19 21:32:21,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:21,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-19 21:32:21,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2019-11-19 21:32:21,073 INFO L87 Difference]: Start difference. First operand 4775 states and 10903 transitions. Second operand 24 states. [2019-11-19 21:32:22,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:22,015 INFO L93 Difference]: Finished difference Result 8717 states and 19228 transitions. [2019-11-19 21:32:22,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-19 21:32:22,016 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 94 [2019-11-19 21:32:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:22,023 INFO L225 Difference]: With dead ends: 8717 [2019-11-19 21:32:22,023 INFO L226 Difference]: Without dead ends: 7538 [2019-11-19 21:32:22,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=535, Invalid=1357, Unknown=0, NotChecked=0, Total=1892 [2019-11-19 21:32:22,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7538 states. [2019-11-19 21:32:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7538 to 7538. [2019-11-19 21:32:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7538 states. [2019-11-19 21:32:22,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7538 states to 7538 states and 16429 transitions. [2019-11-19 21:32:22,103 INFO L78 Accepts]: Start accepts. Automaton has 7538 states and 16429 transitions. Word has length 94 [2019-11-19 21:32:22,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:22,104 INFO L462 AbstractCegarLoop]: Abstraction has 7538 states and 16429 transitions. [2019-11-19 21:32:22,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-19 21:32:22,104 INFO L276 IsEmpty]: Start isEmpty. Operand 7538 states and 16429 transitions. [2019-11-19 21:32:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 21:32:22,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:22,109 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:22,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:22,310 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:22,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:22,311 INFO L82 PathProgramCache]: Analyzing trace with hash 69592503, now seen corresponding path program 22 times [2019-11-19 21:32:22,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:22,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819220904] [2019-11-19 21:32:22,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:32:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:22,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819220904] [2019-11-19 21:32:22,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467710217] [2019-11-19 21:32:22,585 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:22,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 21:32:22,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:32:22,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-19 21:32:22,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:32:22,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:22,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:22,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:32:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:32:22,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:32:22,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-11-19 21:32:22,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554799139] [2019-11-19 21:32:22,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-19 21:32:22,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:32:22,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-19 21:32:22,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2019-11-19 21:32:22,692 INFO L87 Difference]: Start difference. First operand 7538 states and 16429 transitions. Second operand 25 states. [2019-11-19 21:32:23,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:32:23,955 INFO L93 Difference]: Finished difference Result 9887 states and 22009 transitions. [2019-11-19 21:32:23,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-19 21:32:23,956 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 98 [2019-11-19 21:32:23,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:32:23,966 INFO L225 Difference]: With dead ends: 9887 [2019-11-19 21:32:23,967 INFO L226 Difference]: Without dead ends: 8186 [2019-11-19 21:32:23,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=647, Invalid=1515, Unknown=0, NotChecked=0, Total=2162 [2019-11-19 21:32:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8186 states. [2019-11-19 21:32:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8186 to 7934. [2019-11-19 21:32:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7934 states. [2019-11-19 21:32:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7934 states to 7934 states and 17257 transitions. [2019-11-19 21:32:24,083 INFO L78 Accepts]: Start accepts. Automaton has 7934 states and 17257 transitions. Word has length 98 [2019-11-19 21:32:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:32:24,084 INFO L462 AbstractCegarLoop]: Abstraction has 7934 states and 17257 transitions. [2019-11-19 21:32:24,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-19 21:32:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 7934 states and 17257 transitions. [2019-11-19 21:32:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 21:32:24,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:32:24,093 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:32:24,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:32:24,298 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:32:24,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:32:24,299 INFO L82 PathProgramCache]: Analyzing trace with hash 364627989, now seen corresponding path program 23 times [2019-11-19 21:32:24,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:32:24,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164662427] [2019-11-19 21:32:24,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:32:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:32:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:32:24,406 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:32:24,407 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:32:24,563 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-19 21:32:24,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:32:24 BasicIcfg [2019-11-19 21:32:24,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:32:24,570 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:32:24,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:32:24,571 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:32:24,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:31:52" (3/4) ... [2019-11-19 21:32:24,574 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 21:32:24,725 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:32:24,725 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:32:24,728 INFO L168 Benchmark]: Toolchain (without parser) took 33812.18 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 975.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 787.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:32:24,728 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:32:24,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 680.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:32:24,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:32:24,730 INFO L168 Benchmark]: Boogie Preprocessor took 63.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:32:24,730 INFO L168 Benchmark]: RCFGBuilder took 445.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-11-19 21:32:24,731 INFO L168 Benchmark]: TraceAbstraction took 32373.67 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 837.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.6 MB). Peak memory consumption was 730.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:32:24,732 INFO L168 Benchmark]: Witness Printer took 155.06 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:32:24,734 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 680.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 445.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32373.67 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 837.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.6 MB). Peak memory consumption was 730.2 MB. Max. memory is 11.5 GB. * Witness Printer took 155.06 ms. Allocated memory is still 2.0 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 703]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L675] 0 int i = 3, j = 6; VAL [i=3, j=6] [L693] 0 pthread_t id1, id2; VAL [i=3, j=6] [L694] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L695] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=3, j=6] [L685] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L677] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=0] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=0, k++=0] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=0, k++=0, k++=0] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=1] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2, k++=1] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2, k++=1, k++=1] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=2] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=2, k++=2] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=2, k++=2, k++=2] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=3] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=3, k++=3] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=3, k++=3, k++=3] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=4, k++=4] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=4, k++=4, k++=4] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=5] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=5, k++=5] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6, k++=5, k++=5] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=6] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7, k++=6] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=6, k++=6, k++=6] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=7] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=7, k++=7] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8, k++=7, k++=7] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=8] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9, k++=8] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=8, k++=8, k++=8] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L697] 0 int condI = i >= (2*10 +6); [L700] 0 int condJ = j >= (2*10 +6); VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L702] COND TRUE 0 condI || condJ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L703] 0 __VERIFIER_error() VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 101 locations, 1 error locations. Result: UNSAFE, OverallTime: 32.2s, OverallIterations: 28, TraceHistogramMax: 10, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3722 SDtfs, 27256 SDslu, 22026 SDs, 0 SdLazy, 4450 SolverSat, 5946 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2116 GetRequests, 1466 SyntacticMatches, 0 SemanticMatches, 650 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3611 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8843occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 13824 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 3106 NumberOfCodeBlocks, 3106 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 2958 ConstructedInterpolants, 0 QuantifiedInterpolants, 600094 SizeOfPredicates, 325 NumberOfNonLiveVariables, 3583 ConjunctsInSsa, 397 ConjunctsInUnsatCore, 50 InterpolantComputations, 4 PerfectInterpolantSequences, 10/4790 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...