./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/hard.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5758efa3 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/nla-digbench/hard.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0f1c45558152fd199606f2551fe8da5ad92b45c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/nla-digbench/hard.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 e0f1c45558152fd199606f2551fe8da5ad92b45c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5758efa [2019-11-26 21:10:48,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 21:10:48,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 21:10:48,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 21:10:48,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 21:10:48,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 21:10:48,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 21:10:48,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 21:10:48,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 21:10:48,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 21:10:48,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 21:10:48,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 21:10:48,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 21:10:48,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 21:10:48,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 21:10:48,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 21:10:48,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 21:10:48,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 21:10:48,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 21:10:48,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 21:10:48,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 21:10:48,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 21:10:48,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 21:10:48,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 21:10:48,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 21:10:48,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 21:10:48,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 21:10:48,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 21:10:48,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 21:10:48,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 21:10:48,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 21:10:48,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 21:10:48,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 21:10:48,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 21:10:48,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 21:10:48,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 21:10:48,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 21:10:48,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 21:10:48,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 21:10:48,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 21:10:48,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 21:10:48,139 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-26 21:10:48,167 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 21:10:48,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 21:10:48,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 21:10:48,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 21:10:48,169 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 21:10:48,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 21:10:48,170 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 21:10:48,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 21:10:48,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 21:10:48,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 21:10:48,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 21:10:48,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 21:10:48,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 21:10:48,172 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 21:10:48,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 21:10:48,172 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 21:10:48,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 21:10:48,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 21:10:48,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 21:10:48,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 21:10:48,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 21:10:48,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 21:10:48,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 21:10:48,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 21:10:48,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 21:10:48,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-26 21:10:48,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 21:10:48,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 21:10:48,176 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 -> e0f1c45558152fd199606f2551fe8da5ad92b45c [2019-11-26 21:10:48,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 21:10:48,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 21:10:48,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 21:10:48,497 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 21:10:48,497 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 21:10:48,498 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/hard.c [2019-11-26 21:10:48,567 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797a4efb4/b325282c064e481da3a9a6d7723bb87b/FLAGf1b22b613 [2019-11-26 21:10:49,003 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 21:10:49,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/hard.c [2019-11-26 21:10:49,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797a4efb4/b325282c064e481da3a9a6d7723bb87b/FLAGf1b22b613 [2019-11-26 21:10:49,411 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797a4efb4/b325282c064e481da3a9a6d7723bb87b [2019-11-26 21:10:49,415 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 21:10:49,416 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 21:10:49,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 21:10:49,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 21:10:49,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 21:10:49,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:10:49" (1/1) ... [2019-11-26 21:10:49,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48cfb0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:10:49, skipping insertion in model container [2019-11-26 21:10:49,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:10:49" (1/1) ... [2019-11-26 21:10:49,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 21:10:49,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:10:49,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:10:49,701 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 21:10:49,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:10:49,750 INFO L208 MainTranslator]: Completed translation [2019-11-26 21:10:49,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:10:49 WrapperNode [2019-11-26 21:10:49,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 21:10:49,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 21:10:49,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 21:10:49,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 21:10:49,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:10:49" (1/1) ... [2019-11-26 21:10:49,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:10:49" (1/1) ... [2019-11-26 21:10:49,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 21:10:49,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 21:10:49,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 21:10:49,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 21:10:49,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:10:49" (1/1) ... [2019-11-26 21:10:49,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:10:49" (1/1) ... [2019-11-26 21:10:49,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:10:49" (1/1) ... [2019-11-26 21:10:49,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:10:49" (1/1) ... [2019-11-26 21:10:49,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:10:49" (1/1) ... [2019-11-26 21:10:49,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:10:49" (1/1) ... [2019-11-26 21:10:49,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:10:49" (1/1) ... [2019-11-26 21:10:49,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 21:10:49,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 21:10:49,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 21:10:49,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 21:10:49,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:10:49" (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-26 21:10:49,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 21:10:49,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 21:10:50,259 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 21:10:50,259 INFO L284 CfgBuilder]: Removed 20 assume(true) statements. [2019-11-26 21:10:50,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:10:50 BoogieIcfgContainer [2019-11-26 21:10:50,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 21:10:50,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 21:10:50,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 21:10:50,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 21:10:50,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 09:10:49" (1/3) ... [2019-11-26 21:10:50,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a9e1c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:10:50, skipping insertion in model container [2019-11-26 21:10:50,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:10:49" (2/3) ... [2019-11-26 21:10:50,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a9e1c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:10:50, skipping insertion in model container [2019-11-26 21:10:50,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:10:50" (3/3) ... [2019-11-26 21:10:50,270 INFO L109 eAbstractionObserver]: Analyzing ICFG hard.c [2019-11-26 21:10:50,279 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 21:10:50,284 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-26 21:10:50,295 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-26 21:10:50,321 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 21:10:50,321 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 21:10:50,321 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 21:10:50,321 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 21:10:50,321 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 21:10:50,322 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 21:10:50,322 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 21:10:50,322 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 21:10:50,339 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-26 21:10:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-26 21:10:50,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:10:50,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-26 21:10:50,345 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:10:50,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:10:50,350 INFO L82 PathProgramCache]: Analyzing trace with hash 963340, now seen corresponding path program 1 times [2019-11-26 21:10:50,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:10:50,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618199068] [2019-11-26 21:10:50,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:10:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:10:50,522 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-26 21:10:50,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618199068] [2019-11-26 21:10:50,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:10:50,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 21:10:50,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927638940] [2019-11-26 21:10:50,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 21:10:50,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:10:50,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 21:10:50,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 21:10:50,545 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2019-11-26 21:10:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:10:50,672 INFO L93 Difference]: Finished difference Result 92 states and 127 transitions. [2019-11-26 21:10:50,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:10:50,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-11-26 21:10:50,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:10:50,687 INFO L225 Difference]: With dead ends: 92 [2019-11-26 21:10:50,687 INFO L226 Difference]: Without dead ends: 49 [2019-11-26 21:10:50,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:10:50,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-26 21:10:50,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2019-11-26 21:10:50,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-26 21:10:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-26 21:10:50,731 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 4 [2019-11-26 21:10:50,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:10:50,731 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-26 21:10:50,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 21:10:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-26 21:10:50,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-26 21:10:50,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:10:50,732 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-26 21:10:50,732 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:10:50,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:10:50,733 INFO L82 PathProgramCache]: Analyzing trace with hash 925925231, now seen corresponding path program 1 times [2019-11-26 21:10:50,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:10:50,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406718445] [2019-11-26 21:10:50,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:10:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:10:50,783 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-26 21:10:50,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406718445] [2019-11-26 21:10:50,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:10:50,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 21:10:50,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081688694] [2019-11-26 21:10:50,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 21:10:50,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:10:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 21:10:50,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 21:10:50,788 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 4 states. [2019-11-26 21:10:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:10:50,897 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-11-26 21:10:50,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:10:50,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-26 21:10:50,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:10:50,899 INFO L225 Difference]: With dead ends: 49 [2019-11-26 21:10:50,899 INFO L226 Difference]: Without dead ends: 47 [2019-11-26 21:10:50,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:10:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-26 21:10:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2019-11-26 21:10:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-26 21:10:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-26 21:10:50,909 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 6 [2019-11-26 21:10:50,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:10:50,909 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-26 21:10:50,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 21:10:50,910 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-26 21:10:50,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 21:10:50,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:10:50,911 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:10:50,911 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:10:50,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:10:50,912 INFO L82 PathProgramCache]: Analyzing trace with hash 756072562, now seen corresponding path program 1 times [2019-11-26 21:10:50,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:10:50,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178778817] [2019-11-26 21:10:50,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:10:50,923 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-26 21:10:50,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66452979] [2019-11-26 21:10:50,924 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-26 21:10:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:10:50,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 21:10:50,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:10:51,012 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-26 21:10:51,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178778817] [2019-11-26 21:10:51,013 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 21:10:51,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66452979] [2019-11-26 21:10:51,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:10:51,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 21:10:51,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407902861] [2019-11-26 21:10:51,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 21:10:51,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:10:51,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 21:10:51,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 21:10:51,015 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 4 states. [2019-11-26 21:10:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:10:51,163 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-11-26 21:10:51,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:10:51,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-26 21:10:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:10:51,165 INFO L225 Difference]: With dead ends: 69 [2019-11-26 21:10:51,166 INFO L226 Difference]: Without dead ends: 47 [2019-11-26 21:10:51,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:10:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-26 21:10:51,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2019-11-26 21:10:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-26 21:10:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-26 21:10:51,186 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 8 [2019-11-26 21:10:51,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:10:51,186 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-26 21:10:51,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 21:10:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-26 21:10:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 21:10:51,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:10:51,188 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:10:51,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:10:51,393 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:10:51,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:10:51,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1354107943, now seen corresponding path program 1 times [2019-11-26 21:10:51,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:10:51,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807345228] [2019-11-26 21:10:51,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:10:51,409 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-26 21:10:51,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430275713] [2019-11-26 21:10:51,410 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-26 21:10:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:10:51,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 21:10:51,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:10:51,471 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-26 21:10:51,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807345228] [2019-11-26 21:10:51,471 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 21:10:51,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430275713] [2019-11-26 21:10:51,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:10:51,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 21:10:51,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751647848] [2019-11-26 21:10:51,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 21:10:51,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:10:51,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 21:10:51,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 21:10:51,476 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-11-26 21:10:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:10:51,579 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-11-26 21:10:51,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 21:10:51,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-26 21:10:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:10:51,581 INFO L225 Difference]: With dead ends: 60 [2019-11-26 21:10:51,581 INFO L226 Difference]: Without dead ends: 49 [2019-11-26 21:10:51,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:10:51,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-26 21:10:51,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-11-26 21:10:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-26 21:10:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-11-26 21:10:51,598 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2019-11-26 21:10:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:10:51,600 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-11-26 21:10:51,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 21:10:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-11-26 21:10:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 21:10:51,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:10:51,602 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-26 21:10:51,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:10:51,805 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:10:51,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:10:51,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1240091547, now seen corresponding path program 1 times [2019-11-26 21:10:51,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:10:51,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467186495] [2019-11-26 21:10:51,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:10:51,822 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-26 21:10:51,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1421147509] [2019-11-26 21:10:51,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-26 21:10:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:10:51,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-26 21:10:51,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:10:51,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:10:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:10:51,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467186495] [2019-11-26 21:10:51,938 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 21:10:51,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421147509] [2019-11-26 21:10:51,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-26 21:10:51,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-11-26 21:10:51,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388044014] [2019-11-26 21:10:51,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:10:51,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:10:51,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:10:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:10:51,943 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 5 states. [2019-11-26 21:10:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:10:52,131 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2019-11-26 21:10:52,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 21:10:52,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-26 21:10:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:10:52,133 INFO L225 Difference]: With dead ends: 105 [2019-11-26 21:10:52,134 INFO L226 Difference]: Without dead ends: 68 [2019-11-26 21:10:52,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:10:52,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-26 21:10:52,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2019-11-26 21:10:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-26 21:10:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-11-26 21:10:52,160 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 15 [2019-11-26 21:10:52,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:10:52,161 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-11-26 21:10:52,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:10:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-11-26 21:10:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-26 21:10:52,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:10:52,164 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2019-11-26 21:10:52,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:10:52,376 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:10:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:10:52,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1654747054, now seen corresponding path program 2 times [2019-11-26 21:10:52,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:10:52,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587687833] [2019-11-26 21:10:52,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:10:52,391 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-26 21:10:52,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459191347] [2019-11-26 21:10:52,393 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 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-26 21:10:52,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 21:10:52,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:10:52,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-26 21:10:52,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:10:52,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:10:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:10:52,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587687833] [2019-11-26 21:10:52,516 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 21:10:52,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459191347] [2019-11-26 21:10:52,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-26 21:10:52,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-11-26 21:10:52,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641568308] [2019-11-26 21:10:52,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 21:10:52,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:10:52,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 21:10:52,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 21:10:52,518 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 6 states. [2019-11-26 21:10:52,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:10:52,759 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2019-11-26 21:10:52,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:10:52,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-26 21:10:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:10:52,761 INFO L225 Difference]: With dead ends: 139 [2019-11-26 21:10:52,761 INFO L226 Difference]: Without dead ends: 102 [2019-11-26 21:10:52,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:10:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-26 21:10:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2019-11-26 21:10:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-26 21:10:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2019-11-26 21:10:52,775 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 22 [2019-11-26 21:10:52,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:10:52,775 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2019-11-26 21:10:52,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 21:10:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2019-11-26 21:10:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 21:10:52,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:10:52,776 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:10:52,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:10:52,980 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:10:52,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:10:52,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1585354123, now seen corresponding path program 1 times [2019-11-26 21:10:52,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:10:52,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885287564] [2019-11-26 21:10:52,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:10:52,990 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-26 21:10:52,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [493547448] [2019-11-26 21:10:52,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-26 21:10:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:10:53,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-26 21:10:53,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:10:53,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:10:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:10:53,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885287564] [2019-11-26 21:10:53,105 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 21:10:53,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493547448] [2019-11-26 21:10:53,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-26 21:10:53,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-11-26 21:10:53,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076002909] [2019-11-26 21:10:53,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 21:10:53,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:10:53,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 21:10:53,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 21:10:53,107 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 6 states. [2019-11-26 21:10:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:10:53,281 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-11-26 21:10:53,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 21:10:53,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-26 21:10:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:10:53,282 INFO L225 Difference]: With dead ends: 99 [2019-11-26 21:10:53,283 INFO L226 Difference]: Without dead ends: 97 [2019-11-26 21:10:53,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:10:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-26 21:10:53,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2019-11-26 21:10:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-26 21:10:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2019-11-26 21:10:53,301 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 24 [2019-11-26 21:10:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:10:53,301 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2019-11-26 21:10:53,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 21:10:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2019-11-26 21:10:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-26 21:10:53,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:10:53,303 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:10:53,514 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:10:53,515 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:10:53,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:10:53,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1185426063, now seen corresponding path program 1 times [2019-11-26 21:10:53,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:10:53,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023961821] [2019-11-26 21:10:53,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:10:53,525 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-26 21:10:53,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1431089501] [2019-11-26 21:10:53,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-26 21:10:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:10:53,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 21:10:53,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:10:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 21:10:53,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023961821] [2019-11-26 21:10:53,605 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 21:10:53,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431089501] [2019-11-26 21:10:53,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-26 21:10:53,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-11-26 21:10:53,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856802340] [2019-11-26 21:10:53,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 21:10:53,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:10:53,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 21:10:53,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 21:10:53,610 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 6 states. [2019-11-26 21:10:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:10:53,748 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2019-11-26 21:10:53,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 21:10:53,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-26 21:10:53,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:10:53,750 INFO L225 Difference]: With dead ends: 120 [2019-11-26 21:10:53,750 INFO L226 Difference]: Without dead ends: 105 [2019-11-26 21:10:53,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:10:53,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-26 21:10:53,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2019-11-26 21:10:53,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-26 21:10:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2019-11-26 21:10:53,764 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 29 [2019-11-26 21:10:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:10:53,765 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2019-11-26 21:10:53,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 21:10:53,765 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2019-11-26 21:10:53,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-26 21:10:53,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:10:53,767 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1] [2019-11-26 21:10:53,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:10:53,971 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:10:53,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:10:53,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1363992507, now seen corresponding path program 3 times [2019-11-26 21:10:53,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:10:53,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793412600] [2019-11-26 21:10:53,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:10:53,981 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-26 21:10:53,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [928373435] [2019-11-26 21:10:53,981 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 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-26 21:10:54,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-26 21:10:54,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:10:54,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-26 21:10:54,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:10:54,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:10:54,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:10:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-26 21:10:54,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793412600] [2019-11-26 21:10:54,151 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 21:10:54,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928373435] [2019-11-26 21:10:54,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-26 21:10:54,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-11-26 21:10:54,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151241463] [2019-11-26 21:10:54,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 21:10:54,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:10:54,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 21:10:54,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:10:54,154 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 7 states. [2019-11-26 21:10:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:10:54,490 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2019-11-26 21:10:54,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:10:54,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-11-26 21:10:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:10:54,494 INFO L225 Difference]: With dead ends: 113 [2019-11-26 21:10:54,494 INFO L226 Difference]: Without dead ends: 103 [2019-11-26 21:10:54,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-26 21:10:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-26 21:10:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-11-26 21:10:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-26 21:10:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2019-11-26 21:10:54,507 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 29 [2019-11-26 21:10:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:10:54,508 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2019-11-26 21:10:54,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 21:10:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2019-11-26 21:10:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-26 21:10:54,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:10:54,509 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:10:54,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:10:54,713 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:10:54,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:10:54,714 INFO L82 PathProgramCache]: Analyzing trace with hash -803819852, now seen corresponding path program 2 times [2019-11-26 21:10:54,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:10:54,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086090383] [2019-11-26 21:10:54,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:10:54,722 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-26 21:10:54,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1458078088] [2019-11-26 21:10:54,723 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 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-26 21:10:54,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 21:10:54,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:10:54,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-26 21:10:54,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:10:54,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:10:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:10:54,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086090383] [2019-11-26 21:10:54,850 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 21:10:54,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458078088] [2019-11-26 21:10:54,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-26 21:10:54,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-11-26 21:10:54,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638497698] [2019-11-26 21:10:54,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 21:10:54,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:10:54,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 21:10:54,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:10:54,856 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 7 states. [2019-11-26 21:10:55,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:10:55,122 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2019-11-26 21:10:55,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:10:55,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-11-26 21:10:55,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:10:55,124 INFO L225 Difference]: With dead ends: 113 [2019-11-26 21:10:55,124 INFO L226 Difference]: Without dead ends: 111 [2019-11-26 21:10:55,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:10:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-26 21:10:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2019-11-26 21:10:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-26 21:10:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2019-11-26 21:10:55,134 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 31 [2019-11-26 21:10:55,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:10:55,134 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2019-11-26 21:10:55,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 21:10:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2019-11-26 21:10:55,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 21:10:55,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:10:55,136 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-26 21:10:55,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:10:55,339 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:10:55,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:10:55,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1656121185, now seen corresponding path program 3 times [2019-11-26 21:10:55,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:10:55,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051741332] [2019-11-26 21:10:55,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:10:55,348 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-26 21:10:55,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2043665552] [2019-11-26 21:10:55,348 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 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-26 21:10:55,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-26 21:10:55,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:10:55,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-26 21:10:55,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:10:55,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:10:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:10:55,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051741332] [2019-11-26 21:10:55,748 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 21:10:55,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043665552] [2019-11-26 21:10:55,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-26 21:10:55,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-11-26 21:10:55,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944856133] [2019-11-26 21:10:55,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 21:10:55,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:10:55,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 21:10:55,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:10:55,750 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 9 states. [2019-11-26 21:10:56,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:10:56,169 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2019-11-26 21:10:56,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 21:10:56,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-11-26 21:10:56,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:10:56,173 INFO L225 Difference]: With dead ends: 115 [2019-11-26 21:10:56,173 INFO L226 Difference]: Without dead ends: 104 [2019-11-26 21:10:56,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-26 21:10:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-26 21:10:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-11-26 21:10:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-26 21:10:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-11-26 21:10:56,185 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 37 [2019-11-26 21:10:56,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:10:56,188 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-11-26 21:10:56,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 21:10:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-11-26 21:10:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 21:10:56,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:10:56,196 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-26 21:10:56,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:10:56,402 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:10:56,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:10:56,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1263094175, now seen corresponding path program 1 times [2019-11-26 21:10:56,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:10:56,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721638343] [2019-11-26 21:10:56,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:10:56,410 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-26 21:10:56,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1438017062] [2019-11-26 21:10:56,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-26 21:10:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:10:56,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 21:10:56,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:10:56,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:10:56,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:10:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 21:10:56,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721638343] [2019-11-26 21:10:56,564 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 21:10:56,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438017062] [2019-11-26 21:10:56,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:10:56,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 21:10:56,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929745238] [2019-11-26 21:10:56,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 21:10:56,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:10:56,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 21:10:56,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 21:10:56,566 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 6 states. [2019-11-26 21:11:03,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:11:03,311 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2019-11-26 21:11:03,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 21:11:03,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-26 21:11:03,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:11:03,312 INFO L225 Difference]: With dead ends: 146 [2019-11-26 21:11:03,313 INFO L226 Difference]: Without dead ends: 103 [2019-11-26 21:11:03,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:11:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-26 21:11:03,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 79. [2019-11-26 21:11:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-26 21:11:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-11-26 21:11:03,322 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 37 [2019-11-26 21:11:03,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:11:03,323 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-11-26 21:11:03,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 21:11:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-11-26 21:11:03,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 21:11:03,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:11:03,324 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:11:03,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:11:03,525 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:11:03,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:11:03,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2081381013, now seen corresponding path program 4 times [2019-11-26 21:11:03,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 21:11:03,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974746717] [2019-11-26 21:11:03,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 21:11:03,534 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-26 21:11:03,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [108023825] [2019-11-26 21:11:03,535 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-26 21:11:03,567 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-26 21:11:03,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:11:03,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-26 21:11:03,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:11:03,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:11:03,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:11:03,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:11:04,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:11:04,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:11:04,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:11:04,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:11:04,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:11:04,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:11:04,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:11:04,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:11:21,465 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-11-26 21:11:30,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:11:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 33 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:11:30,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974746717] [2019-11-26 21:11:30,194 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 21:11:30,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108023825] [2019-11-26 21:11:30,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-26 21:11:30,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-11-26 21:11:30,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291756773] [2019-11-26 21:11:30,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 21:11:30,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 21:11:30,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 21:11:30,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=144, Unknown=13, NotChecked=0, Total=210 [2019-11-26 21:11:30,197 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 15 states. [2019-11-26 21:11:41,698 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 18 [2019-11-26 21:12:10,873 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2019-11-26 21:12:51,523 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2019-11-26 21:13:35,314 WARN L192 SmtUtils]: Spent 7.72 s on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-11-26 21:13:53,564 WARN L192 SmtUtils]: Spent 4.96 s on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-11-26 21:14:15,289 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-26 21:14:15,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 21:14:15,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 21:14:15,492 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2019-11-26 21:14:15,497 INFO L168 Benchmark]: Toolchain (without parser) took 206081.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -216.9 MB). Peak memory consumption was 368.9 MB. Max. memory is 11.5 GB. [2019-11-26 21:14:15,498 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:14:15,498 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.21 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-26 21:14:15,499 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -156.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-26 21:14:15,499 INFO L168 Benchmark]: Boogie Preprocessor took 45.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:14:15,500 INFO L168 Benchmark]: RCFGBuilder took 353.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-11-26 21:14:15,501 INFO L168 Benchmark]: TraceAbstraction took 205234.03 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.8 MB). Peak memory consumption was 375.2 MB. Max. memory is 11.5 GB. [2019-11-26 21:14:15,504 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.21 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -156.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 353.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 205234.03 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -96.8 MB). Peak memory consumption was 375.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-5758efa [2019-11-26 21:14:17,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 21:14:17,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 21:14:17,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 21:14:17,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 21:14:17,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 21:14:17,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 21:14:17,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 21:14:17,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 21:14:17,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 21:14:17,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 21:14:17,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 21:14:17,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 21:14:17,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 21:14:17,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 21:14:17,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 21:14:17,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 21:14:17,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 21:14:17,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 21:14:17,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 21:14:17,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 21:14:17,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 21:14:17,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 21:14:17,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 21:14:17,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 21:14:17,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 21:14:17,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 21:14:17,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 21:14:17,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 21:14:17,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 21:14:17,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 21:14:17,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 21:14:17,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 21:14:17,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 21:14:17,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 21:14:17,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 21:14:17,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 21:14:17,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 21:14:17,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 21:14:17,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 21:14:17,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 21:14:17,340 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-26 21:14:17,359 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 21:14:17,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 21:14:17,364 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 21:14:17,364 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 21:14:17,365 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 21:14:17,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 21:14:17,365 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 21:14:17,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 21:14:17,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 21:14:17,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 21:14:17,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 21:14:17,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 21:14:17,368 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 21:14:17,369 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 21:14:17,369 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 21:14:17,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 21:14:17,370 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 21:14:17,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 21:14:17,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 21:14:17,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 21:14:17,371 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 21:14:17,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 21:14:17,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 21:14:17,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 21:14:17,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 21:14:17,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 21:14:17,373 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-26 21:14:17,373 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 21:14:17,374 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 21:14:17,374 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 21:14:17,374 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> e0f1c45558152fd199606f2551fe8da5ad92b45c [2019-11-26 21:14:17,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 21:14:17,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 21:14:17,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 21:14:17,718 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 21:14:17,718 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 21:14:17,720 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/hard.c [2019-11-26 21:14:17,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ddbaf7a/ffb1d15ea77e46c7bb0ee5530295eb84/FLAG1af507e2a [2019-11-26 21:14:18,187 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 21:14:18,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/hard.c [2019-11-26 21:14:18,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ddbaf7a/ffb1d15ea77e46c7bb0ee5530295eb84/FLAG1af507e2a [2019-11-26 21:14:18,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ddbaf7a/ffb1d15ea77e46c7bb0ee5530295eb84 [2019-11-26 21:14:18,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 21:14:18,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 21:14:18,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 21:14:18,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 21:14:18,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 21:14:18,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:14:18" (1/1) ... [2019-11-26 21:14:18,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33bbc6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:14:18, skipping insertion in model container [2019-11-26 21:14:18,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:14:18" (1/1) ... [2019-11-26 21:14:18,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 21:14:18,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:14:18,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:14:18,883 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 21:14:18,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:14:18,938 INFO L208 MainTranslator]: Completed translation [2019-11-26 21:14:18,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:14:18 WrapperNode [2019-11-26 21:14:18,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 21:14:18,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 21:14:18,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 21:14:18,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 21:14:18,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:14:18" (1/1) ... [2019-11-26 21:14:18,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:14:18" (1/1) ... [2019-11-26 21:14:19,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 21:14:19,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 21:14:19,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 21:14:19,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 21:14:19,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:14:18" (1/1) ... [2019-11-26 21:14:19,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:14:18" (1/1) ... [2019-11-26 21:14:19,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:14:18" (1/1) ... [2019-11-26 21:14:19,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:14:18" (1/1) ... [2019-11-26 21:14:19,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:14:18" (1/1) ... [2019-11-26 21:14:19,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:14:18" (1/1) ... [2019-11-26 21:14:19,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:14:18" (1/1) ... [2019-11-26 21:14:19,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 21:14:19,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 21:14:19,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 21:14:19,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 21:14:19,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:14:18" (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-26 21:14:19,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 21:14:19,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 21:14:19,544 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 21:14:19,545 INFO L284 CfgBuilder]: Removed 20 assume(true) statements. [2019-11-26 21:14:19,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:14:19 BoogieIcfgContainer [2019-11-26 21:14:19,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 21:14:19,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 21:14:19,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 21:14:19,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 21:14:19,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 09:14:18" (1/3) ... [2019-11-26 21:14:19,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11356260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:14:19, skipping insertion in model container [2019-11-26 21:14:19,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:14:18" (2/3) ... [2019-11-26 21:14:19,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11356260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:14:19, skipping insertion in model container [2019-11-26 21:14:19,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:14:19" (3/3) ... [2019-11-26 21:14:19,555 INFO L109 eAbstractionObserver]: Analyzing ICFG hard.c [2019-11-26 21:14:19,565 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 21:14:19,573 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-26 21:14:19,585 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-26 21:14:19,613 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 21:14:19,613 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 21:14:19,613 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 21:14:19,613 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 21:14:19,614 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 21:14:19,614 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 21:14:19,614 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 21:14:19,614 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 21:14:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-26 21:14:19,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-26 21:14:19,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:14:19,641 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-26 21:14:19,641 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:14:19,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:14:19,648 INFO L82 PathProgramCache]: Analyzing trace with hash 963340, now seen corresponding path program 1 times [2019-11-26 21:14:19,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:14:19,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447960419] [2019-11-26 21:14:19,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-26 21:14:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:14:19,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 21:14:19,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:14:19,779 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-26 21:14:19,779 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:14:19,799 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-26 21:14:19,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447960419] [2019-11-26 21:14:19,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:14:19,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-26 21:14:19,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965315518] [2019-11-26 21:14:19,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:14:19,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:14:19,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:14:19,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:14:19,828 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 5 states. [2019-11-26 21:14:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:14:20,115 INFO L93 Difference]: Finished difference Result 92 states and 127 transitions. [2019-11-26 21:14:20,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 21:14:20,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-11-26 21:14:20,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:14:20,132 INFO L225 Difference]: With dead ends: 92 [2019-11-26 21:14:20,133 INFO L226 Difference]: Without dead ends: 49 [2019-11-26 21:14:20,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:14:20,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-26 21:14:20,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2019-11-26 21:14:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-26 21:14:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-26 21:14:20,203 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 4 [2019-11-26 21:14:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:14:20,205 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-26 21:14:20,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:14:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-26 21:14:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-26 21:14:20,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:14:20,206 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-26 21:14:20,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-26 21:14:20,413 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:14:20,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:14:20,415 INFO L82 PathProgramCache]: Analyzing trace with hash 925925231, now seen corresponding path program 1 times [2019-11-26 21:14:20,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:14:20,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880689690] [2019-11-26 21:14:20,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2019-11-26 21:14:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:14:20,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 21:14:20,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-26 21:14:20,473 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-26 21:14:20,473 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:14:20,489 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-26 21:14:20,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880689690] [2019-11-26 21:14:20,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:14:20,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-26 21:14:20,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131721362] [2019-11-26 21:14:20,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:14:20,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:14:20,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:14:20,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:14:20,493 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 5 states. [2019-11-26 21:14:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:14:20,692 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-11-26 21:14:20,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 21:14:20,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-11-26 21:14:20,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:14:20,695 INFO L225 Difference]: With dead ends: 49 [2019-11-26 21:14:20,695 INFO L226 Difference]: Without dead ends: 47 [2019-11-26 21:14:20,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:14:20,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-26 21:14:20,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2019-11-26 21:14:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-26 21:14:20,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-26 21:14:20,705 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 6 [2019-11-26 21:14:20,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:14:20,706 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-26 21:14:20,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:14:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-26 21:14:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 21:14:20,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:14:20,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:14:20,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-26 21:14:20,918 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:14:20,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:14:20,918 INFO L82 PathProgramCache]: Analyzing trace with hash 756072562, now seen corresponding path program 1 times [2019-11-26 21:14:20,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:14:20,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719254067] [2019-11-26 21:14:20,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-26 21:14:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:14:20,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 21:14:20,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:14:21,015 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-26 21:14:21,016 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:14:21,113 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-26 21:14:21,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719254067] [2019-11-26 21:14:21,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:14:21,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-26 21:14:21,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846152677] [2019-11-26 21:14:21,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 21:14:21,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:14:21,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 21:14:21,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 21:14:21,115 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2019-11-26 21:14:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:14:23,987 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-11-26 21:14:23,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 21:14:23,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-11-26 21:14:23,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:14:23,992 INFO L225 Difference]: With dead ends: 93 [2019-11-26 21:14:23,992 INFO L226 Difference]: Without dead ends: 71 [2019-11-26 21:14:23,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-26 21:14:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-26 21:14:24,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2019-11-26 21:14:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-26 21:14:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-11-26 21:14:24,008 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 8 [2019-11-26 21:14:24,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:14:24,009 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-11-26 21:14:24,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 21:14:24,009 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-11-26 21:14:24,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 21:14:24,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:14:24,010 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:14:24,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-26 21:14:24,214 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:14:24,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:14:24,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1354107943, now seen corresponding path program 1 times [2019-11-26 21:14:24,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:14:24,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382299140] [2019-11-26 21:14:24,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-26 21:14:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:14:24,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 21:14:24,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:14:24,296 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-26 21:14:24,296 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:14:24,359 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-26 21:14:24,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382299140] [2019-11-26 21:14:24,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:14:24,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-26 21:14:24,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761472518] [2019-11-26 21:14:24,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:14:24,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:14:24,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:14:24,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:14:24,362 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 5 states. [2019-11-26 21:14:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:14:24,621 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2019-11-26 21:14:24,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 21:14:24,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-26 21:14:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:14:24,624 INFO L225 Difference]: With dead ends: 71 [2019-11-26 21:14:24,625 INFO L226 Difference]: Without dead ends: 60 [2019-11-26 21:14:24,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:14:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-26 21:14:24,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-11-26 21:14:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-26 21:14:24,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-11-26 21:14:24,638 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 11 [2019-11-26 21:14:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:14:24,638 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-11-26 21:14:24,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:14:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-11-26 21:14:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-26 21:14:24,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:14:24,640 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2019-11-26 21:14:24,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-26 21:14:24,852 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:14:24,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:14:24,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1654747054, now seen corresponding path program 1 times [2019-11-26 21:14:24,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:14:24,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590298161] [2019-11-26 21:14:24,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-26 21:14:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:14:24,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 21:14:24,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:14:25,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:14:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:14:25,057 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:14:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 2 refuted. 7 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:14:27,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590298161] [2019-11-26 21:14:27,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:14:27,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-26 21:14:27,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512437982] [2019-11-26 21:14:27,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 21:14:27,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:14:27,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 21:14:27,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=60, Unknown=1, NotChecked=0, Total=90 [2019-11-26 21:14:27,491 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 10 states. [2019-11-26 21:14:31,256 WARN L192 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 19 [2019-11-26 21:14:33,578 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 14 [2019-11-26 21:14:35,964 WARN L192 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 18 [2019-11-26 21:14:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:14:40,443 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2019-11-26 21:14:40,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-26 21:14:40,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-26 21:14:40,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:14:40,448 INFO L225 Difference]: With dead ends: 114 [2019-11-26 21:14:40,448 INFO L226 Difference]: Without dead ends: 104 [2019-11-26 21:14:40,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=142, Invalid=277, Unknown=1, NotChecked=0, Total=420 [2019-11-26 21:14:40,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-26 21:14:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 64. [2019-11-26 21:14:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-26 21:14:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2019-11-26 21:14:40,465 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 22 [2019-11-26 21:14:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:14:40,465 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2019-11-26 21:14:40,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 21:14:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2019-11-26 21:14:40,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 21:14:40,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:14:40,467 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:14:40,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-26 21:14:40,669 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:14:40,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:14:40,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1585354123, now seen corresponding path program 1 times [2019-11-26 21:14:40,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:14:40,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867455257] [2019-11-26 21:14:40,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-26 21:14:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:14:40,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 21:14:40,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:14:41,423 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-11-26 21:14:41,977 WARN L192 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-11-26 21:14:41,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:14:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:14:42,269 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:14:43,606 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-26 21:14:45,241 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-26 21:14:46,906 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-11-26 21:14:49,316 WARN L192 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-11-26 21:14:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:14:49,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867455257] [2019-11-26 21:14:49,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:14:49,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2019-11-26 21:14:49,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983259675] [2019-11-26 21:14:49,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 21:14:49,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:14:49,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 21:14:49,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-26 21:14:49,335 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 14 states. [2019-11-26 21:14:52,253 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-11-26 21:14:53,389 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-11-26 21:14:54,409 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-26 21:14:55,698 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-26 21:15:00,043 WARN L192 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 46 [2019-11-26 21:15:07,508 WARN L192 SmtUtils]: Spent 793.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-26 21:15:14,441 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 37 [2019-11-26 21:15:23,560 WARN L192 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-26 21:15:28,996 WARN L192 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 45 [2019-11-26 21:15:34,434 WARN L192 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-26 21:15:37,082 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-26 21:15:43,518 WARN L192 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-26 21:15:47,258 WARN L192 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-26 21:15:51,271 WARN L192 SmtUtils]: Spent 949.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-26 21:15:53,827 WARN L192 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-26 21:15:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:15:56,022 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2019-11-26 21:15:56,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-26 21:15:56,041 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-26 21:15:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:15:56,042 INFO L225 Difference]: With dead ends: 136 [2019-11-26 21:15:56,042 INFO L226 Difference]: Without dead ends: 110 [2019-11-26 21:15:56,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 46.2s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-11-26 21:15:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-26 21:15:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2019-11-26 21:15:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-26 21:15:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-11-26 21:15:56,058 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 24 [2019-11-26 21:15:56,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:15:56,059 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-11-26 21:15:56,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 21:15:56,059 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-11-26 21:15:56,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 21:15:56,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:15:56,060 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:15:56,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-26 21:15:56,274 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:15:56,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:15:56,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1187920850, now seen corresponding path program 1 times [2019-11-26 21:15:56,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:15:56,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234339685] [2019-11-26 21:15:56,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-26 21:15:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:15:56,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 21:15:56,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:15:57,026 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-26 21:15:57,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:15:57,410 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:15:57,410 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:16:00,058 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-26 21:16:02,116 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-26 21:16:02,126 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:16:02,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234339685] [2019-11-26 21:16:02,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:16:02,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-11-26 21:16:02,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445739195] [2019-11-26 21:16:02,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 21:16:02,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:16:02,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 21:16:02,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:16:02,129 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 12 states. [2019-11-26 21:16:10,541 WARN L192 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-26 21:16:11,458 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-26 21:16:14,418 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-11-26 21:16:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:16:17,445 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2019-11-26 21:16:17,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-26 21:16:17,445 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-26 21:16:17,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:16:17,446 INFO L225 Difference]: With dead ends: 109 [2019-11-26 21:16:17,446 INFO L226 Difference]: Without dead ends: 83 [2019-11-26 21:16:17,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2019-11-26 21:16:17,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-26 21:16:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2019-11-26 21:16:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-26 21:16:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-11-26 21:16:17,459 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 26 [2019-11-26 21:16:17,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:16:17,459 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-11-26 21:16:17,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 21:16:17,460 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-11-26 21:16:17,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-26 21:16:17,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:16:17,461 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:16:17,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-26 21:16:17,673 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:16:17,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:16:17,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1185426063, now seen corresponding path program 1 times [2019-11-26 21:16:17,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:16:17,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410965000] [2019-11-26 21:16:17,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-26 21:16:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:16:18,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-26 21:16:18,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:16:18,602 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-11-26 21:16:19,184 WARN L192 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-11-26 21:16:21,692 WARN L192 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-11-26 21:16:21,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:16:24,616 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2019-11-26 21:16:25,967 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-11-26 21:16:25,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:16:26,133 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-26 21:16:26,133 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:16:26,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:16:27,512 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-26 21:16:28,184 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-26 21:16:28,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:16:29,316 WARN L192 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-26 21:16:31,473 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-26 21:16:34,581 WARN L192 SmtUtils]: Spent 764.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-11-26 21:16:38,118 WARN L192 SmtUtils]: Spent 889.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-26 21:16:44,869 WARN L192 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-11-26 21:16:44,879 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-26 21:16:44,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410965000] [2019-11-26 21:16:44,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:16:44,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2019-11-26 21:16:44,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009944583] [2019-11-26 21:16:44,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-26 21:16:44,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:16:44,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-26 21:16:44,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-11-26 21:16:44,885 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 21 states. [2019-11-26 21:16:48,411 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-26 21:16:51,393 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-26 21:16:52,909 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-26 21:17:16,214 WARN L192 SmtUtils]: Spent 10.29 s on a formula simplification that was a NOOP. DAG size: 54 [2019-11-26 21:17:37,201 WARN L192 SmtUtils]: Spent 3.73 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-26 21:17:43,928 WARN L192 SmtUtils]: Spent 859.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-26 21:18:00,772 WARN L192 SmtUtils]: Spent 8.67 s on a formula simplification that was a NOOP. DAG size: 59 [2019-11-26 21:18:09,050 WARN L192 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-26 21:18:16,411 WARN L192 SmtUtils]: Spent 635.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-26 21:18:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:18:16,437 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-11-26 21:18:16,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-26 21:18:16,441 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-11-26 21:18:16,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:18:16,441 INFO L225 Difference]: With dead ends: 84 [2019-11-26 21:18:16,442 INFO L226 Difference]: Without dead ends: 69 [2019-11-26 21:18:16,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 81.4s TimeCoverageRelationStatistics Valid=295, Invalid=757, Unknown=4, NotChecked=0, Total=1056 [2019-11-26 21:18:16,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-26 21:18:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2019-11-26 21:18:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-26 21:18:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-11-26 21:18:16,452 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 29 [2019-11-26 21:18:16,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:18:16,453 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-11-26 21:18:16,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-26 21:18:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-11-26 21:18:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-26 21:18:16,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:18:16,454 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:18:16,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-26 21:18:16,658 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 21:18:16,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:18:16,658 INFO L82 PathProgramCache]: Analyzing trace with hash -803819852, now seen corresponding path program 2 times [2019-11-26 21:18:16,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:18:16,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822020870] [2019-11-26 21:18:16,659 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-26 21:18:16,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 21:18:16,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-26 21:18:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 21:18:16,876 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-26 21:18:16,877 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 21:18:17,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-26 21:18:17,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 09:18:17 BoogieIcfgContainer [2019-11-26 21:18:17,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 21:18:17,102 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 21:18:17,102 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 21:18:17,102 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 21:18:17,103 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:14:19" (3/4) ... [2019-11-26 21:18:17,105 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 21:18:17,160 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-26 21:18:17,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 21:18:17,162 INFO L168 Benchmark]: Toolchain (without parser) took 238545.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -195.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:18:17,163 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:18:17,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.92 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-26 21:18:17,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-26 21:18:17,165 INFO L168 Benchmark]: Boogie Preprocessor took 37.16 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-26 21:18:17,166 INFO L168 Benchmark]: RCFGBuilder took 458.15 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-26 21:18:17,166 INFO L168 Benchmark]: TraceAbstraction took 237554.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -60.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:18:17,167 INFO L168 Benchmark]: Witness Printer took 58.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:18:17,170 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.92 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.16 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. * RCFGBuilder took 458.15 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 237554.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -60.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 58.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L18] int A, B; [L19] int r, d, p, q; [L20] A = __VERIFIER_nondet_int() [L21] B = __VERIFIER_nondet_int() [L24] r = A [L25] d = B [L26] p = 1 [L27] q = 0 [L29] COND TRUE 1 [L10] COND FALSE !(!(cond)) [L10] COND FALSE !(!(cond)) [L10] COND FALSE !(!(cond)) [L33] COND FALSE !(!(r >= d)) [L35] d = 2 * d [L36] p = 2 * p [L29] COND TRUE 1 [L10] COND FALSE !(!(cond)) [L10] COND FALSE !(!(cond)) [L10] COND FALSE !(!(cond)) [L33] COND FALSE !(!(r >= d)) [L35] d = 2 * d [L36] p = 2 * p [L29] COND TRUE 1 [L10] COND FALSE !(!(cond)) [L10] COND FALSE !(!(cond)) [L10] COND FALSE !(!(cond)) [L33] COND TRUE !(r >= d) [L39] COND TRUE 1 [L10] COND FALSE !(!(cond)) [L10] COND FALSE !(!(cond)) [L43] COND FALSE !(!(p != 1)) [L45] d = d / 2 [L46] p = p / 2 [L47] COND TRUE r >= d [L48] r = r - d [L49] q = q + p [L39] COND TRUE 1 [L10] COND TRUE !(cond) [L12] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 7 error locations. Result: UNSAFE, OverallTime: 237.4s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 190.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 170 SDtfs, 544 SDslu, 542 SDs, 0 SdLazy, 984 SolverSat, 450 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 80.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 148.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 147 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 43.9s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 244 ConstructedInterpolants, 16 QuantifiedInterpolants, 110500 SizeOfPredicates, 51 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 10/102 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...