./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/test23_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/ldv-regression/test23_true-unreach-call.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 308e43cca528a064aecd41d099b341627e43bb71 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: 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 /storage/repos/svcomp/c/ldv-regression/test23_true-unreach-call.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 308e43cca528a064aecd41d099b341627e43bb71 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:33:56,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:33:56,163 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:33:56,183 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:33:56,183 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:33:56,184 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:33:56,185 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:33:56,187 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:33:56,189 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:33:56,190 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:33:56,191 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:33:56,191 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:33:56,192 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:33:56,193 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:33:56,194 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:33:56,195 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:33:56,196 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:33:56,198 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:33:56,200 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:33:56,202 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:33:56,203 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:33:56,204 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:33:56,207 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:33:56,207 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:33:56,207 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:33:56,212 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:33:56,214 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:33:56,214 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:33:56,218 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:33:56,219 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:33:56,221 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:33:56,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:33:56,222 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:33:56,222 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:33:56,225 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:33:56,225 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:33:56,226 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:33:56,250 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:33:56,251 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:33:56,253 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:33:56,254 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:33:56,254 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:33:56,254 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:33:56,254 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:33:56,255 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:33:56,256 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:33:56,256 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:33:56,256 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:33:56,256 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:33:56,256 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:33:56,256 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:33:56,257 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:33:56,257 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:33:56,258 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:33:56,258 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:33:56,258 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:33:56,258 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:33:56,258 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:33:56,259 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:33:56,261 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:33:56,261 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:33:56,261 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:33:56,261 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:33:56,261 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:33:56,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:33:56,263 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 308e43cca528a064aecd41d099b341627e43bb71 [2019-01-12 09:33:56,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:33:56,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:33:56,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:33:56,318 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:33:56,319 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:33:56,319 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test23_true-unreach-call.c [2019-01-12 09:33:56,382 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/395f83b0e/0b3b852faa0f4caf9e4624f6f2a1c4ba/FLAG4bf70db2c [2019-01-12 09:33:56,850 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:33:56,851 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test23_true-unreach-call.c [2019-01-12 09:33:56,858 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/395f83b0e/0b3b852faa0f4caf9e4624f6f2a1c4ba/FLAG4bf70db2c [2019-01-12 09:33:57,193 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/395f83b0e/0b3b852faa0f4caf9e4624f6f2a1c4ba [2019-01-12 09:33:57,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:33:57,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:33:57,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:33:57,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:33:57,208 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:33:57,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:33:57" (1/1) ... [2019-01-12 09:33:57,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c23552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:57, skipping insertion in model container [2019-01-12 09:33:57,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:33:57" (1/1) ... [2019-01-12 09:33:57,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:33:57,246 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:33:57,511 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:33:57,548 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:33:57,576 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:33:57,609 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:33:57,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:57 WrapperNode [2019-01-12 09:33:57,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:33:57,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:33:57,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:33:57,611 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:33:57,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:57" (1/1) ... [2019-01-12 09:33:57,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:57" (1/1) ... [2019-01-12 09:33:57,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:33:57,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:33:57,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:33:57,669 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:33:57,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:57" (1/1) ... [2019-01-12 09:33:57,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:57" (1/1) ... [2019-01-12 09:33:57,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:57" (1/1) ... [2019-01-12 09:33:57,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:57" (1/1) ... [2019-01-12 09:33:57,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:57" (1/1) ... [2019-01-12 09:33:57,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:57" (1/1) ... [2019-01-12 09:33:57,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:57" (1/1) ... [2019-01-12 09:33:57,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:33:57,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:33:57,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:33:57,812 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:33:57,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:57" (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-01-12 09:33:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:33:57,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:33:57,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:33:57,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:33:57,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:33:58,326 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:33:58,327 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-12 09:33:58,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:33:58 BoogieIcfgContainer [2019-01-12 09:33:58,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:33:58,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:33:58,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:33:58,333 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:33:58,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:33:57" (1/3) ... [2019-01-12 09:33:58,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278aa1d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:33:58, skipping insertion in model container [2019-01-12 09:33:58,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:33:57" (2/3) ... [2019-01-12 09:33:58,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278aa1d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:33:58, skipping insertion in model container [2019-01-12 09:33:58,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:33:58" (3/3) ... [2019-01-12 09:33:58,339 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_true-unreach-call.c [2019-01-12 09:33:58,349 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:33:58,358 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:33:58,378 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:33:58,413 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:33:58,413 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:33:58,414 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:33:58,414 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:33:58,414 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:33:58,415 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:33:58,415 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:33:58,415 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:33:58,415 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:33:58,432 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-01-12 09:33:58,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:33:58,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:58,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:58,443 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:58,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:58,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2100293056, now seen corresponding path program 1 times [2019-01-12 09:33:58,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:58,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:58,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:58,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:58,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:33:58,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:33:58,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:33:58,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:33:58,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:33:58,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:33:58,654 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-01-12 09:33:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:33:58,671 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-01-12 09:33:58,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:33:58,673 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-01-12 09:33:58,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:33:58,683 INFO L225 Difference]: With dead ends: 30 [2019-01-12 09:33:58,683 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 09:33:58,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:33:58,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 09:33:58,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 09:33:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 09:33:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-12 09:33:58,717 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2019-01-12 09:33:58,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:33:58,718 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-12 09:33:58,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:33:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-01-12 09:33:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:33:58,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:33:58,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:33:58,719 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:33:58,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:33:58,719 INFO L82 PathProgramCache]: Analyzing trace with hash 478567452, now seen corresponding path program 1 times [2019-01-12 09:33:58,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:33:58,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:33:58,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:58,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:33:58,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:33:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:33:59,548 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-01-12 09:33:59,863 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-01-12 09:34:00,142 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-01-12 09:34:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:00,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:34:00,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-12 09:34:00,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 09:34:00,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 09:34:00,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-01-12 09:34:00,829 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 14 states. [2019-01-12 09:34:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:34:01,576 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-01-12 09:34:01,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 09:34:01,577 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2019-01-12 09:34:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:34:01,580 INFO L225 Difference]: With dead ends: 36 [2019-01-12 09:34:01,581 INFO L226 Difference]: Without dead ends: 31 [2019-01-12 09:34:01,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-01-12 09:34:01,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-12 09:34:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2019-01-12 09:34:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 09:34:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-01-12 09:34:01,590 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2019-01-12 09:34:01,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:34:01,590 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-01-12 09:34:01,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 09:34:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-01-12 09:34:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:34:01,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:34:01,591 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:34:01,592 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:34:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:34:01,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1851619425, now seen corresponding path program 1 times [2019-01-12 09:34:01,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:34:01,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:34:01,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:34:01,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:34:01,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:34:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:34:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:02,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:34:02,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:34:02,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:34:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:34:02,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:34:02,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-12 09:34:02,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-12 09:34:02,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:02,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:02,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:34:02,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2019-01-12 09:34:02,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2019-01-12 09:34:02,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2019-01-12 09:34:02,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:02,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:02,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:02,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2019-01-12 09:34:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:02,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:34:02,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2019-01-12 09:34:02,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 09:34:02,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 09:34:02,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-01-12 09:34:02,830 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 22 states. [2019-01-12 09:34:04,232 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-12 09:34:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:34:05,130 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-01-12 09:34:05,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 09:34:05,131 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 18 [2019-01-12 09:34:05,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:34:05,133 INFO L225 Difference]: With dead ends: 75 [2019-01-12 09:34:05,135 INFO L226 Difference]: Without dead ends: 70 [2019-01-12 09:34:05,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=470, Invalid=1786, Unknown=0, NotChecked=0, Total=2256 [2019-01-12 09:34:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-12 09:34:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 29. [2019-01-12 09:34:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 09:34:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-01-12 09:34:05,146 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2019-01-12 09:34:05,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:34:05,147 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-01-12 09:34:05,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 09:34:05,147 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-01-12 09:34:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:34:05,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:34:05,148 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:34:05,148 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:34:05,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:34:05,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1211257704, now seen corresponding path program 1 times [2019-01-12 09:34:05,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:34:05,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:34:05,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:34:05,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:34:05,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:34:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:34:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 09:34:05,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:34:05,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 09:34:05,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 09:34:05,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 09:34:05,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:34:05,249 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 9 states. [2019-01-12 09:34:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:34:05,615 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-12 09:34:05,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 09:34:05,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-01-12 09:34:05,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:34:05,617 INFO L225 Difference]: With dead ends: 70 [2019-01-12 09:34:05,617 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 09:34:05,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-12 09:34:05,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 09:34:05,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 29. [2019-01-12 09:34:05,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 09:34:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-01-12 09:34:05,628 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2019-01-12 09:34:05,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:34:05,628 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-01-12 09:34:05,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 09:34:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-01-12 09:34:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:34:05,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:34:05,630 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:34:05,631 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:34:05,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:34:05,631 INFO L82 PathProgramCache]: Analyzing trace with hash 200140454, now seen corresponding path program 1 times [2019-01-12 09:34:05,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:34:05,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:34:05,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:34:05,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:34:05,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:34:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:34:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:06,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:34:06,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:34:06,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:34:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:34:06,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:34:06,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-12 09:34:06,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-12 09:34:06,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:06,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:06,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:34:06,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2019-01-12 09:34:06,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2019-01-12 09:34:06,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2019-01-12 09:34:06,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:06,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:06,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:06,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2019-01-12 09:34:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:06,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:34:06,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 17 [2019-01-12 09:34:06,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 09:34:06,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 09:34:06,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-01-12 09:34:06,386 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 18 states. [2019-01-12 09:34:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:34:07,803 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-01-12 09:34:07,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 09:34:07,804 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2019-01-12 09:34:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:34:07,805 INFO L225 Difference]: With dead ends: 67 [2019-01-12 09:34:07,806 INFO L226 Difference]: Without dead ends: 62 [2019-01-12 09:34:07,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2019-01-12 09:34:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-12 09:34:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 33. [2019-01-12 09:34:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-12 09:34:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-01-12 09:34:07,820 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2019-01-12 09:34:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:34:07,821 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-01-12 09:34:07,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 09:34:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-01-12 09:34:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:34:07,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:34:07,823 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:34:07,823 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:34:07,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:34:07,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1013708501, now seen corresponding path program 2 times [2019-01-12 09:34:07,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:34:07,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:34:07,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:34:07,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:34:07,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:34:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:34:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:08,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:34:08,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:34:08,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 09:34:08,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 09:34:08,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:34:08,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:34:08,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-12 09:34:08,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-12 09:34:08,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:08,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:08,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 09:34:08,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-12 09:34:08,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-01-12 09:34:08,738 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:34:08,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2019-01-12 09:34:08,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:08,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:08,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:08,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:5 [2019-01-12 09:34:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:08,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:34:08,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-01-12 09:34:08,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-12 09:34:08,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-12 09:34:08,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2019-01-12 09:34:08,917 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 26 states. [2019-01-12 09:34:12,962 WARN L181 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-12 09:34:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:34:13,584 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-01-12 09:34:13,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-12 09:34:13,585 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 22 [2019-01-12 09:34:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:34:13,586 INFO L225 Difference]: With dead ends: 83 [2019-01-12 09:34:13,586 INFO L226 Difference]: Without dead ends: 78 [2019-01-12 09:34:13,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1097, Invalid=3733, Unknown=0, NotChecked=0, Total=4830 [2019-01-12 09:34:13,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-12 09:34:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 37. [2019-01-12 09:34:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-12 09:34:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-01-12 09:34:13,603 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 22 [2019-01-12 09:34:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:34:13,604 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-01-12 09:34:13,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-12 09:34:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-01-12 09:34:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 09:34:13,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:34:13,606 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:34:13,607 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:34:13,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:34:13,607 INFO L82 PathProgramCache]: Analyzing trace with hash -372767691, now seen corresponding path program 2 times [2019-01-12 09:34:13,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:34:13,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:34:13,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:34:13,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:34:13,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:34:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:34:14,024 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 09:34:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:14,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:34:14,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:34:14,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 09:34:14,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 09:34:14,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:34:14,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:34:14,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-12 09:34:14,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-12 09:34:14,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:14,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:14,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:34:14,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2019-01-12 09:34:14,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2019-01-12 09:34:14,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2019-01-12 09:34:14,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:14,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:14,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:14,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2019-01-12 09:34:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:15,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:34:15,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2019-01-12 09:34:15,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-12 09:34:15,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-12 09:34:15,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2019-01-12 09:34:15,033 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 30 states. [2019-01-12 09:34:15,804 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-12 09:34:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:34:17,465 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2019-01-12 09:34:17,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 09:34:17,466 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 26 [2019-01-12 09:34:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:34:17,468 INFO L225 Difference]: With dead ends: 93 [2019-01-12 09:34:17,468 INFO L226 Difference]: Without dead ends: 88 [2019-01-12 09:34:17,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=686, Invalid=2070, Unknown=0, NotChecked=0, Total=2756 [2019-01-12 09:34:17,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-12 09:34:17,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 43. [2019-01-12 09:34:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-12 09:34:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-01-12 09:34:17,488 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 26 [2019-01-12 09:34:17,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:34:17,489 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-01-12 09:34:17,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-12 09:34:17,489 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-01-12 09:34:17,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 09:34:17,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:34:17,490 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:34:17,490 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:34:17,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:34:17,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1043903553, now seen corresponding path program 3 times [2019-01-12 09:34:17,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:34:17,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:34:17,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:34:17,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:34:17,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:34:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:34:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:17,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:34:17,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:34:17,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 09:34:17,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-12 09:34:17,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:34:17,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:34:18,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-12 09:34:18,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-12 09:34:18,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:18,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:18,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:34:18,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2019-01-12 09:34:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-12 09:34:18,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:34:18,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2019-01-12 09:34:18,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-12 09:34:18,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-12 09:34:18,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2019-01-12 09:34:18,759 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 32 states. [2019-01-12 09:34:20,366 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-01-12 09:34:20,870 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-01-12 09:34:21,433 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-01-12 09:34:22,084 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-01-12 09:34:22,724 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-01-12 09:34:23,409 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-01-12 09:34:24,655 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-01-12 09:34:26,512 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-01-12 09:34:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:34:26,529 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2019-01-12 09:34:26,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-12 09:34:26,530 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 30 [2019-01-12 09:34:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:34:26,530 INFO L225 Difference]: With dead ends: 93 [2019-01-12 09:34:26,530 INFO L226 Difference]: Without dead ends: 37 [2019-01-12 09:34:26,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2388 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1836, Invalid=7434, Unknown=42, NotChecked=0, Total=9312 [2019-01-12 09:34:26,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-12 09:34:26,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-12 09:34:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-12 09:34:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-12 09:34:26,550 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 30 [2019-01-12 09:34:26,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:34:26,551 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-12 09:34:26,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-12 09:34:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-12 09:34:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 09:34:26,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:34:26,553 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:34:26,554 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:34:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:34:26,554 INFO L82 PathProgramCache]: Analyzing trace with hash 365314510, now seen corresponding path program 3 times [2019-01-12 09:34:26,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:34:26,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:34:26,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:34:26,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 09:34:26,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:34:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:34:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:27,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 09:34:27,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 09:34:27,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 09:34:27,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-12 09:34:27,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:34:27,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:34:27,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-12 09:34:27,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-12 09:34:27,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:27,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:27,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:27,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-12 09:34:27,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-12 09:34:27,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-12 09:34:27,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:27,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:27,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:34:27,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2019-01-12 09:34:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-12 09:34:27,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:34:27,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 28 [2019-01-12 09:34:27,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-12 09:34:27,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-12 09:34:27,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2019-01-12 09:34:27,933 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 29 states. [2019-01-12 09:34:31,300 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-01-12 09:34:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:34:32,032 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-12 09:34:32,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-12 09:34:32,033 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2019-01-12 09:34:32,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:34:32,034 INFO L225 Difference]: With dead ends: 39 [2019-01-12 09:34:32,034 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:34:32,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=577, Invalid=2951, Unknown=12, NotChecked=0, Total=3540 [2019-01-12 09:34:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:34:32,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:34:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:34:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:34:32,038 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-01-12 09:34:32,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:34:32,038 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:34:32,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-12 09:34:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:34:32,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:34:32,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:34:32,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:34:32,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:34:32,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:34:32,708 WARN L181 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 367 DAG size of output: 258 [2019-01-12 09:34:32,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:34:32,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:34:35,777 WARN L181 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 254 DAG size of output: 60 [2019-01-12 09:34:35,954 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-01-12 09:34:36,252 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-01-12 09:34:36,328 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2019-01-12 09:34:36,329 INFO L448 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2019-01-12 09:34:36,329 INFO L444 ceAbstractionStarter]: At program point L23-3(lines 21 24) the Hoare annotation is: (let ((.cse0 (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| |~#d1~0.base|) (+ |~#d1~0.offset| 4) 0) |~#d1~0.offset| 0))) (.cse1 (= 0 |~#d2~0.offset|)) (.cse2 (= 0 |~#d1~0.offset|))) (or (and .cse0 .cse1 (= |~#d2~0.base| |ULTIMATE.start_get_dummy_#res.base|) (= 0 |ULTIMATE.start_get_dummy_#res.offset|) .cse2 (not (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|))) (and .cse0 .cse1 (not (= |~#d1~0.base| |~#d2~0.base|)) (= |~#d1~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) .cse2 (= |ULTIMATE.start_get_dummy_#res.base| |~#d1~0.base|)))) [2019-01-12 09:34:36,329 INFO L448 ceAbstractionStarter]: For program point L23-4(line 23) no Hoare annotation was computed. [2019-01-12 09:34:36,330 INFO L448 ceAbstractionStarter]: For program point L23-6(line 23) no Hoare annotation was computed. [2019-01-12 09:34:36,330 INFO L444 ceAbstractionStarter]: At program point L23-7(lines 21 24) the Hoare annotation is: (let ((.cse1 (= 0 |~#d2~0.offset|)) (.cse0 (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| |~#d1~0.base|) (+ |~#d1~0.offset| 4) 0) |~#d1~0.offset| 0))) (.cse2 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse3 (= 0 |~#d1~0.offset|))) (or (and (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) (and (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse0) .cse1 .cse2) .cse3) (and .cse0 .cse1 (= |~#d2~0.base| |ULTIMATE.start_get_dummy_#res.base|) (= 0 |ULTIMATE.start_get_dummy_#res.offset|) (= ULTIMATE.start_main_~pd1~0.offset 0) .cse3 (not (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|))) (and (not (= |~#d1~0.base| ULTIMATE.start_main_~pd1~0.base)) .cse0 .cse2 .cse3 (not (= |ULTIMATE.start_get_dummy_#res.base| ULTIMATE.start_main_~pd1~0.base))))) [2019-01-12 09:34:36,330 INFO L444 ceAbstractionStarter]: At program point L44(lines 32 52) the Hoare annotation is: false [2019-01-12 09:34:36,330 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2019-01-12 09:34:36,330 INFO L444 ceAbstractionStarter]: At program point L40-3(lines 40 42) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))) (.cse1 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse2 (and (= 0 |~#d2~0.offset|) (and (not (= |~#d1~0.base| |~#d2~0.base|)) (and (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pd1~0.base) (<= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset) (= 0 |~#d1~0.offset|))))) (.cse5 (<= ULTIMATE.start_main_~pd1~0.offset ULTIMATE.start_main_~pd2~0.offset))) (or (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse0 (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse1 .cse2 (exists ((v_ULTIMATE.start_main_~i~0_25 Int)) (let ((.cse4 (* 4 v_ULTIMATE.start_main_~i~0_25))) (let ((.cse3 (+ .cse4 ULTIMATE.start_main_~pd2~0.offset 8))) (and (= v_ULTIMATE.start_main_~i~0_25 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) .cse3)) (<= .cse3 ULTIMATE.start_main_~pa~0.offset) (<= ULTIMATE.start_main_~pa~0.offset (+ .cse4 8)))))) .cse5) (and .cse0 (= ULTIMATE.start_main_~pd1~0.base |ULTIMATE.start_get_dummy_#res.base|) (exists ((v_ULTIMATE.start_main_~i~0_27 Int)) (let ((.cse7 (* 4 v_ULTIMATE.start_main_~i~0_27))) (let ((.cse6 (+ .cse7 ULTIMATE.start_main_~pd2~0.offset 8))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) .cse6) v_ULTIMATE.start_main_~i~0_27) (<= ULTIMATE.start_main_~pa~0.offset (+ .cse7 8)) (<= .cse6 ULTIMATE.start_main_~pa~0.offset))))) (= 0 |ULTIMATE.start_get_dummy_#res.offset|) .cse1 (<= 0 ULTIMATE.start_main_~pd2~0.offset) .cse2 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) .cse5))) [2019-01-12 09:34:36,330 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 46) no Hoare annotation was computed. [2019-01-12 09:34:36,330 INFO L448 ceAbstractionStarter]: For program point L40-4(lines 40 42) no Hoare annotation was computed. [2019-01-12 09:34:36,331 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 46) no Hoare annotation was computed. [2019-01-12 09:34:36,331 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:34:36,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:34:36,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:34:36,331 INFO L444 ceAbstractionStarter]: At program point L28(lines 26 29) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))) (.cse2 (= 0 |~#d2~0.offset|)) (.cse7 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse0 (and (not (= |~#d1~0.base| |~#d2~0.base|)) (and (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pd1~0.base) (<= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset) (= 0 |~#d1~0.offset|)))) (.cse8 (= 1 |ULTIMATE.start_check_#res|)) (.cse11 (<= ULTIMATE.start_main_~pd1~0.offset ULTIMATE.start_main_~pd2~0.offset))) (or (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse0 .cse1 .cse2 (exists ((v_ULTIMATE.start_main_~i~0_25 Int) (ULTIMATE.start_main_~pa~0.offset Int)) (let ((.cse4 (select |#memory_int| ULTIMATE.start_main_~pd2~0.base)) (.cse5 (* 4 v_ULTIMATE.start_main_~i~0_25))) (let ((.cse3 (+ .cse5 ULTIMATE.start_main_~pd2~0.offset 8)) (.cse6 (select .cse4 ULTIMATE.start_main_~pa~0.offset))) (and (<= .cse3 ULTIMATE.start_main_~pa~0.offset) (= (select .cse4 .cse3) v_ULTIMATE.start_main_~i~0_25) (<= ULTIMATE.start_main_~pa~0.offset (+ .cse5 8)) (<= .cse6 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 .cse6))))) (= |~#d1~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse7 .cse8 (exists ((v_ULTIMATE.start_main_~i~0_25 Int)) (let ((.cse10 (* 4 v_ULTIMATE.start_main_~i~0_25))) (let ((.cse9 (+ .cse10 ULTIMATE.start_main_~pd2~0.offset 8))) (and (= v_ULTIMATE.start_main_~i~0_25 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) .cse9)) (<= .cse9 ULTIMATE.start_main_~pa~0.offset) (<= ULTIMATE.start_main_~pa~0.offset (+ .cse10 8)))))) .cse11) (and .cse1 (= ULTIMATE.start_main_~pd1~0.base |ULTIMATE.start_get_dummy_#res.base|) .cse2 (exists ((v_ULTIMATE.start_main_~i~0_27 Int)) (let ((.cse13 (* 4 v_ULTIMATE.start_main_~i~0_27))) (let ((.cse12 (+ .cse13 ULTIMATE.start_main_~pd2~0.offset 8))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) .cse12) v_ULTIMATE.start_main_~i~0_27) (<= ULTIMATE.start_main_~pa~0.offset (+ .cse13 8)) (<= .cse12 ULTIMATE.start_main_~pa~0.offset))))) (= 0 |ULTIMATE.start_get_dummy_#res.offset|) .cse7 (= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) (+ (* 4 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~pd2~0.offset 8)))) .cse0 (<= 0 ULTIMATE.start_main_~pd2~0.offset) (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) .cse8 .cse11))) [2019-01-12 09:34:36,331 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 19) no Hoare annotation was computed. [2019-01-12 09:34:36,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:34:36,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2019-01-12 09:34:36,332 INFO L451 ceAbstractionStarter]: At program point L51(lines 31 52) the Hoare annotation is: true [2019-01-12 09:34:36,333 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 45) no Hoare annotation was computed. [2019-01-12 09:34:36,340 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,341 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,342 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,342 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,343 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,344 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,344 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,344 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:34:36,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:34:36,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:34:36,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:34:36,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:34:36,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:34:36,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:34:36,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:34:36,362 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) 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:123) 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) [2019-01-12 09:34:36,365 INFO L168 Benchmark]: Toolchain (without parser) took 39164.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 392.7 MB). Free memory was 943.3 MB in the beginning and 903.8 MB in the end (delta: 39.5 MB). Peak memory consumption was 432.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:34:36,373 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:34:36,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.66 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:34:36,374 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.61 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:34:36,375 INFO L168 Benchmark]: Boogie Preprocessor took 142.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -205.8 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:34:36,376 INFO L168 Benchmark]: RCFGBuilder took 516.98 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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:34:36,376 INFO L168 Benchmark]: TraceAbstraction took 38035.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.4 MB). Free memory was 1.1 GB in the beginning and 903.8 MB in the end (delta: 211.2 MB). Peak memory consumption was 457.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:34:36,385 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.66 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 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 57.61 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 142.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -205.8 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 516.98 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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38035.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.4 MB). Free memory was 1.1 GB in the beginning and 903.8 MB in the end (delta: 211.2 MB). Peak memory consumption was 457.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant [2019-01-12 09:34:36,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:34:36,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:34:36,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:34:36,408 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:34:36,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_25,QUANTIFIED] [2019-01-12 09:34:36,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_27,QUANTIFIED] [2019-01-12 09:34:36,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:34:36,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:34:36,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:34:36,417 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((pd1 == d1 && i <= unknown-#memory_int-unknown[pa][pa]) && d1 == pd1) && pd2 == pa) && 0 == d2 && !(d1 == d2) && (pd2 == pd1 && pd2 <= pd1) && 0 == d1) && (\exists v_ULTIMATE.start_main_~i~0_25 : int :: (v_ULTIMATE.start_main_~i~0_25 == unknown-#memory_int-unknown[pa][4 * v_ULTIMATE.start_main_~i~0_25 + pd2 + 8] && 4 * v_ULTIMATE.start_main_~i~0_25 + pd2 + 8 <= pa) && pa <= 4 * v_ULTIMATE.start_main_~i~0_25 + 8)) && pd1 <= pd2) || ((((((((i <= unknown-#memory_int-unknown[pa][pa] && pd1 == \result) && (\exists v_ULTIMATE.start_main_~i~0_27 : int :: (unknown-#memory_int-unknown[pa][4 * v_ULTIMATE.start_main_~i~0_27 + pd2 + 8] == v_ULTIMATE.start_main_~i~0_27 && pa <= 4 * v_ULTIMATE.start_main_~i~0_27 + 8) && 4 * v_ULTIMATE.start_main_~i~0_27 + pd2 + 8 <= pa)) && 0 == \result) && pd2 == pa) && 0 <= pd2) && 0 == d2 && !(d1 == d2) && (pd2 == pd1 && pd2 <= pd1) && 0 == d1) && pd1 == d2) && pd1 <= pd2) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:34:38,796 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:34:38,798 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:34:38,810 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:34:38,811 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:34:38,812 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:34:38,813 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:34:38,815 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:34:38,819 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:34:38,822 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:34:38,824 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:34:38,824 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:34:38,825 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:34:38,827 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:34:38,832 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:34:38,835 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:34:38,836 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:34:38,841 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:34:38,846 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:34:38,849 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:34:38,850 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:34:38,853 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:34:38,856 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:34:38,858 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:34:38,858 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:34:38,859 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:34:38,862 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:34:38,863 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:34:38,864 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:34:38,865 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:34:38,865 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:34:38,866 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:34:38,866 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:34:38,867 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:34:38,867 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:34:38,868 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:34:38,868 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:34:38,883 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:34:38,884 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:34:38,885 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:34:38,885 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:34:38,885 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:34:38,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:34:38,886 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:34:38,886 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:34:38,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:34:38,886 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:34:38,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:34:38,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:34:38,887 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:34:38,887 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:34:38,887 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:34:38,887 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:34:38,887 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:34:38,888 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:34:38,890 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:34:38,890 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:34:38,890 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:34:38,890 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:34:38,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:34:38,891 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:34:38,891 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:34:38,892 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:34:38,892 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:34:38,892 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:34:38,892 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:34:38,892 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:34:38,892 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 308e43cca528a064aecd41d099b341627e43bb71 [2019-01-12 09:34:38,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:34:38,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:34:38,953 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:34:38,954 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:34:38,955 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:34:38,955 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test23_true-unreach-call.c [2019-01-12 09:34:39,015 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325b952d4/e31b7e3da09740c0b644dbdeb6a8f701/FLAGbc878e23f [2019-01-12 09:34:39,494 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:34:39,495 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test23_true-unreach-call.c [2019-01-12 09:34:39,501 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325b952d4/e31b7e3da09740c0b644dbdeb6a8f701/FLAGbc878e23f [2019-01-12 09:34:39,875 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325b952d4/e31b7e3da09740c0b644dbdeb6a8f701 [2019-01-12 09:34:39,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:34:39,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:34:39,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:34:39,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:34:39,885 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:34:39,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:34:39" (1/1) ... [2019-01-12 09:34:39,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@152ee249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:34:39, skipping insertion in model container [2019-01-12 09:34:39,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:34:39" (1/1) ... [2019-01-12 09:34:39,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:34:39,916 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:34:40,158 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:34:40,194 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:34:40,228 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:34:40,257 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:34:40,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:34:40 WrapperNode [2019-01-12 09:34:40,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:34:40,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:34:40,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:34:40,258 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:34:40,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:34:40" (1/1) ... [2019-01-12 09:34:40,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:34:40" (1/1) ... [2019-01-12 09:34:40,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:34:40,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:34:40,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:34:40,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:34:40,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:34:40" (1/1) ... [2019-01-12 09:34:40,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:34:40" (1/1) ... [2019-01-12 09:34:40,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:34:40" (1/1) ... [2019-01-12 09:34:40,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:34:40" (1/1) ... [2019-01-12 09:34:40,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:34:40" (1/1) ... [2019-01-12 09:34:40,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:34:40" (1/1) ... [2019-01-12 09:34:40,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:34:40" (1/1) ... [2019-01-12 09:34:40,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:34:40,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:34:40,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:34:40,440 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:34:40,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:34:40" (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-01-12 09:34:40,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:34:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:34:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:34:40,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:34:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 09:34:40,938 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:34:40,938 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-12 09:34:40,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:34:40 BoogieIcfgContainer [2019-01-12 09:34:40,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:34:40,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:34:40,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:34:40,945 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:34:40,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:34:39" (1/3) ... [2019-01-12 09:34:40,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562208af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:34:40, skipping insertion in model container [2019-01-12 09:34:40,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:34:40" (2/3) ... [2019-01-12 09:34:40,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562208af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:34:40, skipping insertion in model container [2019-01-12 09:34:40,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:34:40" (3/3) ... [2019-01-12 09:34:40,950 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_true-unreach-call.c [2019-01-12 09:34:40,961 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:34:40,969 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:34:40,988 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:34:41,020 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:34:41,021 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:34:41,021 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:34:41,021 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:34:41,022 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:34:41,022 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:34:41,022 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:34:41,022 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:34:41,023 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:34:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-01-12 09:34:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:34:41,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:34:41,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:34:41,050 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:34:41,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:34:41,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2100293056, now seen corresponding path program 1 times [2019-01-12 09:34:41,062 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 09:34:41,063 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 09:34:41,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:34:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:34:41,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:34:41,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:41,205 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:34:41,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:34:41,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:34:41,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:34:41,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:34:41,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:34:41,225 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-01-12 09:34:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:34:41,239 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-01-12 09:34:41,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:34:41,240 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-01-12 09:34:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:34:41,250 INFO L225 Difference]: With dead ends: 30 [2019-01-12 09:34:41,250 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 09:34:41,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:34:41,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 09:34:41,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 09:34:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 09:34:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-12 09:34:41,290 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2019-01-12 09:34:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:34:41,290 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-12 09:34:41,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:34:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-01-12 09:34:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:34:41,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:34:41,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:34:41,293 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:34:41,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:34:41,293 INFO L82 PathProgramCache]: Analyzing trace with hash 478567452, now seen corresponding path program 1 times [2019-01-12 09:34:41,294 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 09:34:41,294 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 09:34:41,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:34:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:34:41,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:34:41,678 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 09:34:41,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-12 09:34:41,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-12 09:34:41,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:41,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:42,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:34:42,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2019-01-12 09:34:42,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2019-01-12 09:34:42,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2019-01-12 09:34:42,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:42,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:42,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:42,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:12 [2019-01-12 09:34:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:42,346 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:34:42,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:34:42,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 09:34:42,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 09:34:42,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 09:34:42,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:34:42,356 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-01-12 09:34:43,305 WARN L181 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-01-12 09:34:43,525 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-12 09:34:43,886 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-01-12 09:34:44,039 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-12 09:34:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:34:44,229 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-01-12 09:34:44,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 09:34:44,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-12 09:34:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:34:44,233 INFO L225 Difference]: With dead ends: 59 [2019-01-12 09:34:44,234 INFO L226 Difference]: Without dead ends: 54 [2019-01-12 09:34:44,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-01-12 09:34:44,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-12 09:34:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 25. [2019-01-12 09:34:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 09:34:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-01-12 09:34:44,248 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2019-01-12 09:34:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:34:44,248 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-01-12 09:34:44,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 09:34:44,248 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-01-12 09:34:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:34:44,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:34:44,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:34:44,250 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:34:44,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:34:44,252 INFO L82 PathProgramCache]: Analyzing trace with hash -108238562, now seen corresponding path program 1 times [2019-01-12 09:34:44,252 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 09:34:44,252 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 09:34:44,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:34:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:34:44,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:34:44,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-12 09:34:44,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-12 09:34:44,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:44,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:44,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:44,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-01-12 09:34:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:44,500 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:34:44,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:34:44,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 09:34:44,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 09:34:44,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 09:34:44,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:34:44,508 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 9 states. [2019-01-12 09:34:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:34:45,093 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-01-12 09:34:45,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 09:34:45,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-12 09:34:45,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:34:45,096 INFO L225 Difference]: With dead ends: 54 [2019-01-12 09:34:45,096 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 09:34:45,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-12 09:34:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 09:34:45,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 25. [2019-01-12 09:34:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 09:34:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-01-12 09:34:45,105 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2019-01-12 09:34:45,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:34:45,106 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-01-12 09:34:45,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 09:34:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-01-12 09:34:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:34:45,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:34:45,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:34:45,107 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:34:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:34:45,108 INFO L82 PathProgramCache]: Analyzing trace with hash -501265572, now seen corresponding path program 1 times [2019-01-12 09:34:45,108 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 09:34:45,108 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 09:34:45,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:34:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:34:45,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:34:45,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-12 09:34:45,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:34:45,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:45,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:45,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:45,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2019-01-12 09:34:45,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-01-12 09:34:45,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2019-01-12 09:34:45,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:45,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:45,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:45,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2019-01-12 09:34:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:45,537 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:34:45,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:34:45,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 09:34:45,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 09:34:45,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 09:34:45,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:34:45,541 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 10 states. [2019-01-12 09:34:46,241 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-12 09:34:46,546 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-12 09:34:46,749 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-01-12 09:34:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:34:47,249 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-01-12 09:34:47,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 09:34:47,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-01-12 09:34:47,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:34:47,255 INFO L225 Difference]: With dead ends: 51 [2019-01-12 09:34:47,255 INFO L226 Difference]: Without dead ends: 46 [2019-01-12 09:34:47,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-01-12 09:34:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-12 09:34:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 22. [2019-01-12 09:34:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-12 09:34:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-01-12 09:34:47,266 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2019-01-12 09:34:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:34:47,267 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-12 09:34:47,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 09:34:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-01-12 09:34:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:34:47,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:34:47,268 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:34:47,268 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:34:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:34:47,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1851619425, now seen corresponding path program 1 times [2019-01-12 09:34:47,269 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 09:34:47,269 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 09:34:47,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:34:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:34:47,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:34:47,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-12 09:34:47,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-12 09:34:47,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:47,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:47,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:34:47,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2019-01-12 09:34:47,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2019-01-12 09:34:47,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2019-01-12 09:34:47,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:47,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:47,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:47,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:16 [2019-01-12 09:34:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:47,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 09:34:48,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-01-12 09:34:48,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2019-01-12 09:34:48,072 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:34:48,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:34:48,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:34:48,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:7 [2019-01-12 09:34:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:48,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:34:48,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-01-12 09:34:48,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 09:34:48,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 09:34:48,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-01-12 09:34:48,370 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 21 states. [2019-01-12 09:34:49,182 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-12 09:34:49,742 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-01-12 09:34:49,944 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-01-12 09:34:50,336 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-01-12 09:34:50,824 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-01-12 09:34:51,023 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-01-12 09:34:51,293 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-01-12 09:34:51,652 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-01-12 09:34:52,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:34:52,580 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-01-12 09:34:52,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-12 09:34:52,582 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 18 [2019-01-12 09:34:52,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:34:52,583 INFO L225 Difference]: With dead ends: 65 [2019-01-12 09:34:52,583 INFO L226 Difference]: Without dead ends: 60 [2019-01-12 09:34:52,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=475, Invalid=1595, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 09:34:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-12 09:34:52,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 31. [2019-01-12 09:34:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 09:34:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-01-12 09:34:52,600 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 18 [2019-01-12 09:34:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:34:52,600 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-12 09:34:52,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 09:34:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-01-12 09:34:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:34:52,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:34:52,602 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:34:52,603 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:34:52,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:34:52,603 INFO L82 PathProgramCache]: Analyzing trace with hash 200140454, now seen corresponding path program 1 times [2019-01-12 09:34:52,603 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 09:34:52,603 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 09:34:52,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:34:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:34:52,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:34:53,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-12 09:34:53,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-12 09:34:53,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:53,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:53,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:53,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2019-01-12 09:34:53,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-01-12 09:34:53,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2019-01-12 09:34:53,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:34:53,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:53,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:34:53,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2019-01-12 09:34:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:53,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 09:34:53,983 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-01-12 09:34:53,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-01-12 09:34:54,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2019-01-12 09:34:54,002 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:34:54,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:34:54,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:34:54,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:7 [2019-01-12 09:34:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:34:54,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:34:54,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2019-01-12 09:34:54,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 09:34:54,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 09:34:54,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-01-12 09:34:54,241 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 18 states. [2019-01-12 09:34:55,221 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-12 09:34:55,711 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-12 09:34:56,080 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-01-12 09:34:56,449 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-12 09:34:56,893 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-01-12 09:34:57,198 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-01-12 09:34:57,422 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-01-12 09:34:57,825 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-01-12 09:34:58,040 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-01-12 09:34:58,208 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2019-01-12 09:34:58,424 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-01-12 09:34:58,699 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-01-12 09:34:59,207 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-01-12 09:34:59,692 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-01-12 09:35:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:00,555 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2019-01-12 09:35:00,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-12 09:35:00,557 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2019-01-12 09:35:00,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:00,558 INFO L225 Difference]: With dead ends: 81 [2019-01-12 09:35:00,559 INFO L226 Difference]: Without dead ends: 76 [2019-01-12 09:35:00,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=728, Invalid=2578, Unknown=0, NotChecked=0, Total=3306 [2019-01-12 09:35:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-12 09:35:00,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 32. [2019-01-12 09:35:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 09:35:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-01-12 09:35:00,571 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-01-12 09:35:00,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:00,571 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-01-12 09:35:00,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 09:35:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-01-12 09:35:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 09:35:00,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:00,573 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:00,573 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:00,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:00,573 INFO L82 PathProgramCache]: Analyzing trace with hash -597070086, now seen corresponding path program 2 times [2019-01-12 09:35:00,573 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 09:35:00,574 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 09:35:00,590 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-12 09:35:00,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 09:35:00,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:35:00,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:35:00,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-12 09:35:00,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-12 09:35:00,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:00,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:00,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:00,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2019-01-12 09:35:01,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2019-01-12 09:35:01,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2019-01-12 09:35:01,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:01,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:01,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:01,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:12 [2019-01-12 09:35:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:01,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 09:35:03,285 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2019-01-12 09:35:03,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-01-12 09:35:03,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2019-01-12 09:35:03,299 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:03,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:03,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:03,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:7 [2019-01-12 09:35:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:03,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:35:03,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2019-01-12 09:35:03,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-12 09:35:03,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-12 09:35:03,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1032, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 09:35:03,896 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 35 states. [2019-01-12 09:35:05,020 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-12 09:35:05,839 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2019-01-12 09:35:06,151 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-01-12 09:35:07,022 WARN L181 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2019-01-12 09:35:07,318 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-12 09:35:08,156 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-01-12 09:35:08,415 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-01-12 09:35:09,201 WARN L181 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2019-01-12 09:35:09,471 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-12 09:35:10,171 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2019-01-12 09:35:10,470 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-01-12 09:35:10,715 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-01-12 09:35:11,208 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-01-12 09:35:11,458 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-12 09:35:12,098 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-01-12 09:35:12,385 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-01-12 09:35:12,608 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-01-12 09:35:13,055 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-01-12 09:35:13,308 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-12 09:35:13,844 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-01-12 09:35:14,141 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-12 09:35:14,384 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-12 09:35:14,737 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-01-12 09:35:15,940 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-12 09:35:16,165 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-12 09:35:17,498 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-12 09:35:18,776 WARN L181 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-01-12 09:35:19,544 WARN L181 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-01-12 09:35:20,561 WARN L181 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-01-12 09:35:21,328 WARN L181 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-01-12 09:35:22,005 WARN L181 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-01-12 09:35:22,652 WARN L181 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-01-12 09:35:23,358 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-01-12 09:35:24,241 WARN L181 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-01-12 09:35:24,998 WARN L181 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-12 09:35:25,620 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-12 09:35:26,232 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-01-12 09:35:26,788 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-12 09:35:27,376 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-01-12 09:35:27,951 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-12 09:35:28,471 WARN L181 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-12 09:35:28,987 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-12 09:35:29,532 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-01-12 09:35:30,070 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2019-01-12 09:35:30,536 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-01-12 09:35:30,972 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-01-12 09:35:31,225 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-01-12 09:35:31,785 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2019-01-12 09:35:32,162 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-01-12 09:35:33,560 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-12 09:35:33,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:35:33,662 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2019-01-12 09:35:33,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-12 09:35:33,666 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 28 [2019-01-12 09:35:33,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:35:33,669 INFO L225 Difference]: With dead ends: 125 [2019-01-12 09:35:33,669 INFO L226 Difference]: Without dead ends: 120 [2019-01-12 09:35:33,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3429 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=2418, Invalid=9572, Unknown=0, NotChecked=0, Total=11990 [2019-01-12 09:35:33,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-12 09:35:33,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 59. [2019-01-12 09:35:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 09:35:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-01-12 09:35:33,712 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 28 [2019-01-12 09:35:33,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:35:33,714 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-01-12 09:35:33,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-12 09:35:33,714 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-01-12 09:35:33,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 09:35:33,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:35:33,717 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:35:33,717 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:35:33,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:35:33,717 INFO L82 PathProgramCache]: Analyzing trace with hash 745310975, now seen corresponding path program 2 times [2019-01-12 09:35:33,719 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 09:35:33,719 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 09:35:33,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 09:35:33,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 09:35:33,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:35:33,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:35:34,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-12 09:35:34,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-12 09:35:34,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:34,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:34,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:34,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2019-01-12 09:35:35,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-01-12 09:35:35,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2019-01-12 09:35:35,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:35:35,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:35,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:35:35,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:15 [2019-01-12 09:35:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:35,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 09:35:36,700 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-01-12 09:35:36,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-01-12 09:35:36,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2019-01-12 09:35:36,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:36,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:35:36,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-12 09:35:36,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:7 [2019-01-12 09:35:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:35:37,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:35:37,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2019-01-12 09:35:37,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-12 09:35:37,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-12 09:35:37,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 09:35:37,460 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 35 states. [2019-01-12 09:35:39,030 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2019-01-12 09:35:39,799 WARN L181 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-01-12 09:35:40,092 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-12 09:35:40,884 WARN L181 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-01-12 09:35:41,649 WARN L181 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-01-12 09:35:41,966 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-01-12 09:35:42,676 WARN L181 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2019-01-12 09:35:43,392 WARN L181 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-01-12 09:35:43,645 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-01-12 09:35:44,208 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2019-01-12 09:35:44,891 WARN L181 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-01-12 09:35:45,199 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-12 09:35:45,720 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-01-12 09:35:46,212 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-01-12 09:35:46,634 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-12 09:35:47,431 WARN L181 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2019-01-12 09:35:48,064 WARN L181 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-01-12 09:35:48,355 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-01-12 09:35:48,792 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2019-01-12 09:35:49,221 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-01-12 09:35:49,444 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-01-12 09:35:49,904 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-01-12 09:35:50,439 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-01-12 09:35:50,721 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-12 09:35:51,051 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-01-12 09:35:51,405 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-12 09:35:52,026 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-01-12 09:35:52,479 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-01-12 09:35:52,738 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-12 09:35:53,011 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-01-12 09:35:53,269 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-01-12 09:35:53,488 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-01-12 09:35:53,825 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-01-12 09:35:54,188 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-01-12 09:35:54,462 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-12 09:35:55,411 WARN L181 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-12 09:35:56,050 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-01-12 09:35:56,650 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-01-12 09:35:56,954 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-12 09:35:58,246 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-01-12 09:35:59,197 WARN L181 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-01-12 09:35:59,994 WARN L181 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-01-12 09:36:00,749 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-01-12 09:36:01,423 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-01-12 09:36:02,002 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-01-12 09:36:02,580 WARN L181 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-01-12 09:36:03,244 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2019-01-12 09:36:03,984 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-01-12 09:36:04,421 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2019-01-12 09:36:04,868 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-01-12 09:36:05,212 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-01-12 09:36:05,592 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-12 09:36:05,906 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-01-12 09:36:06,259 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-01-12 09:36:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:36:06,798 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2019-01-12 09:36:06,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-12 09:36:06,802 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 30 [2019-01-12 09:36:06,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:36:06,804 INFO L225 Difference]: With dead ends: 138 [2019-01-12 09:36:06,804 INFO L226 Difference]: Without dead ends: 133 [2019-01-12 09:36:06,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2867 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=2218, Invalid=8494, Unknown=0, NotChecked=0, Total=10712 [2019-01-12 09:36:06,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-12 09:36:06,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 77. [2019-01-12 09:36:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-12 09:36:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-01-12 09:36:06,853 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 30 [2019-01-12 09:36:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:36:06,853 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-01-12 09:36:06,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-12 09:36:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-01-12 09:36:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 09:36:06,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:36:06,857 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:36:06,857 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:36:06,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:36:06,858 INFO L82 PathProgramCache]: Analyzing trace with hash 415068814, now seen corresponding path program 3 times [2019-01-12 09:36:06,858 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-12 09:36:06,858 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-12 09:36:06,886 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2019-01-12 09:36:07,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-12 09:36:07,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 09:36:07,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:36:07,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-12 09:36:07,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2019-01-12 09:36:07,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:07,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:07,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2019-01-12 09:36:07,089 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:36:07,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-12 09:36:07,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:07,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:07,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:07,136 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:23 [2019-01-12 09:36:07,270 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-01-12 09:36:07,276 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:36:07,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2019-01-12 09:36:07,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2019-01-12 09:36:07,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:07,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:36:07,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:07,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:60, output treesize:34 [2019-01-12 09:36:13,429 WARN L181 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 27 [2019-01-12 09:36:17,508 WARN L181 SmtUtils]: Spent 4.06 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-12 09:36:21,585 WARN L181 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-12 09:36:25,673 WARN L181 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-12 09:36:29,786 WARN L181 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-12 09:36:33,939 WARN L181 SmtUtils]: Spent 4.11 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-12 09:36:38,049 WARN L181 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-12 09:36:38,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2019-01-12 09:36:38,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-12 09:36:38,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-12 09:36:38,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:67, output treesize:59 [2019-01-12 09:36:40,364 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 43 [2019-01-12 09:36:44,609 WARN L181 SmtUtils]: Spent 4.07 s on a formula simplification that was a NOOP. DAG size: 46 [2019-01-12 09:36:48,860 WARN L181 SmtUtils]: Spent 4.08 s on a formula simplification that was a NOOP. DAG size: 48 [2019-01-12 09:36:53,233 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 44 [2019-01-12 09:36:55,488 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 44 [2019-01-12 09:36:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-12 09:36:55,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 09:37:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-12 09:37:10,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 09:37:10,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2019-01-12 09:37:10,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-12 09:37:10,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-12 09:37:10,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=783, Unknown=6, NotChecked=0, Total=870 [2019-01-12 09:37:10,050 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 30 states. [2019-01-12 09:37:21,888 WARN L181 SmtUtils]: Spent 8.14 s on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-01-12 09:37:30,478 WARN L181 SmtUtils]: Spent 8.16 s on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-01-12 09:37:41,069 WARN L181 SmtUtils]: Spent 8.19 s on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-01-12 09:38:15,814 WARN L181 SmtUtils]: Spent 11.64 s on a formula simplification that was a NOOP. DAG size: 92 [2019-01-12 09:38:17,171 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-12 09:39:02,642 WARN L181 SmtUtils]: Spent 25.51 s on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-01-12 09:39:24,313 WARN L181 SmtUtils]: Spent 13.31 s on a formula simplification that was a NOOP. DAG size: 58 [2019-01-12 09:40:17,938 WARN L181 SmtUtils]: Spent 17.74 s on a formula simplification that was a NOOP. DAG size: 73 [2019-01-12 09:41:19,414 WARN L181 SmtUtils]: Spent 30.96 s on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-01-12 09:41:38,557 WARN L181 SmtUtils]: Spent 12.25 s on a formula simplification that was a NOOP. DAG size: 37 [2019-01-12 09:42:43,692 WARN L181 SmtUtils]: Spent 20.48 s on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-01-12 09:42:48,982 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) |c_ULTIMATE.start_check_#res|) (= (_ bv0 32) c_ULTIMATE.start_main_~pd2~0.offset) (= c_ULTIMATE.start_main_~pa~0.base c_ULTIMATE.start_main_~pd2~0.base) (exists ((v_ULTIMATE.start_main_~i~0_56 (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet1_4| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet0_4| (_ BitVec 32))) (let ((.cse0 (bvmul (_ bv4 32) v_ULTIMATE.start_main_~i~0_56))) (and (bvsge v_ULTIMATE.start_main_~i~0_56 (_ bv0 32)) (bvslt v_ULTIMATE.start_main_~i~0_56 (_ bv10 32)) (= (bvadd c_ULTIMATE.start_main_~pa~0.offset (_ bv4294967288 32)) (bvadd .cse0 c_ULTIMATE.start_main_~pd2~0.offset)) (= (store (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) c_ULTIMATE.start_main_~pd2~0.offset |v_ULTIMATE.start_init_#t~nondet0_4|) (bvadd c_ULTIMATE.start_main_~pd2~0.offset (_ bv4 32)) |v_ULTIMATE.start_init_#t~nondet1_4|) (bvadd c_ULTIMATE.start_main_~pd2~0.offset .cse0 (_ bv8 32)) v_ULTIMATE.start_main_~i~0_56) (select |c_#memory_int| c_ULTIMATE.start_main_~pa~0.base))))) (exists ((|~#d2~0.base| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet3_4| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet2_4| (_ BitVec 32))) (and (= (select |c_#memory_int| |~#d2~0.base|) (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (_ bv0 32) |v_ULTIMATE.start_init_#t~nondet2_4|) (_ bv4 32) |v_ULTIMATE.start_init_#t~nondet3_4|)) (not (= c_ULTIMATE.start_main_~pd2~0.base |~#d2~0.base|)))) (exists ((v_ULTIMATE.start_main_~i~0_56 (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet1_4| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet0_4| (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int| c_ULTIMATE.start_main_~pd2~0.base)) (.cse2 (bvmul (_ bv4 32) v_ULTIMATE.start_main_~i~0_56))) (let ((.cse3 (select .cse1 (bvadd .cse2 c_ULTIMATE.start_main_~pd2~0.offset (_ bv8 32))))) (and (= .cse1 (store (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) c_ULTIMATE.start_main_~pd2~0.offset |v_ULTIMATE.start_init_#t~nondet0_4|) (bvadd c_ULTIMATE.start_main_~pd2~0.offset (_ bv4 32)) |v_ULTIMATE.start_init_#t~nondet1_4|) (bvadd c_ULTIMATE.start_main_~pd2~0.offset .cse2 (_ bv8 32)) v_ULTIMATE.start_main_~i~0_56)) (bvsge v_ULTIMATE.start_main_~i~0_56 (_ bv0 32)) (not (bvslt c_ULTIMATE.start_main_~i~0 .cse3)) (bvslt v_ULTIMATE.start_main_~i~0_56 (_ bv10 32)) (bvslt (bvadd c_ULTIMATE.start_main_~i~0 (_ bv4294967295 32)) .cse3))))) (bvslt (bvadd c_ULTIMATE.start_main_~i~0 (_ bv4294967295 32)) (select (select |c_#memory_int| c_ULTIMATE.start_main_~pa~0.base) c_ULTIMATE.start_main_~pa~0.offset)) (forall ((ULTIMATE.start_main_~i~0 (_ BitVec 32)) (v_ULTIMATE.start_main_~i~0_58 (_ BitVec 32))) (let ((.cse6 (bvmul (_ bv4 32) ULTIMATE.start_main_~i~0))) (let ((.cse5 (store (select |c_#memory_int| c_ULTIMATE.start_main_~pd2~0.base) (bvadd c_ULTIMATE.start_main_~pd2~0.offset .cse6 (_ bv8 32)) ULTIMATE.start_main_~i~0))) (let ((.cse4 (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~pd2~0.base .cse5) c_ULTIMATE.start_main_~pd1~0.base) (bvadd .cse6 c_ULTIMATE.start_main_~pd1~0.offset (_ bv8 32))))) (or (not (bvsge ULTIMATE.start_main_~i~0 (_ bv0 32))) (not (bvslt (bvadd v_ULTIMATE.start_main_~i~0_58 (_ bv4294967295 32)) .cse4)) (= (select .cse5 (bvadd c_ULTIMATE.start_main_~pd2~0.offset (bvmul (_ bv4 32) v_ULTIMATE.start_main_~i~0_58) (_ bv8 32))) v_ULTIMATE.start_main_~i~0_58) (not (bvslt ULTIMATE.start_main_~i~0 (_ bv10 32))) (bvslt v_ULTIMATE.start_main_~i~0_58 .cse4))))))) is different from false [2019-01-12 09:42:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:42:50,197 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2019-01-12 09:42:50,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 09:42:50,197 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-01-12 09:42:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:42:50,198 INFO L225 Difference]: With dead ends: 113 [2019-01-12 09:42:50,198 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:42:50,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 343.2s TimeCoverageRelationStatistics Valid=230, Invalid=1716, Unknown=38, NotChecked=86, Total=2070 [2019-01-12 09:42:50,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:42:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:42:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:42:50,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:42:50,200 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-01-12 09:42:50,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:42:50,200 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:42:50,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-12 09:42:50,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:42:50,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:42:50,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:42:50,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:42:50,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:42:50,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:42:50,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:42:50,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:42:50,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:42:50,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:42:50,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:42:51,145 WARN L181 SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 474 DAG size of output: 401 [2019-01-12 09:42:51,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:43:52,957 WARN L181 SmtUtils]: Spent 1.03 m on a formula simplification. DAG size of input: 384 DAG size of output: 45 [2019-01-12 09:44:05,453 WARN L181 SmtUtils]: Spent 12.49 s on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-01-12 09:44:06,112 WARN L181 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 47 [2019-01-12 09:44:30,157 WARN L181 SmtUtils]: Spent 24.04 s on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-01-12 09:44:30,160 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2019-01-12 09:44:30,160 INFO L448 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2019-01-12 09:44:30,161 INFO L444 ceAbstractionStarter]: At program point L23-3(lines 21 24) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |~#d2~0.offset|)) (.cse1 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse2 (exists ((|~#d2~0.base| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet3_4| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet2_4| (_ BitVec 32))) (and (= (select |#memory_int| |~#d2~0.base|) (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (_ bv0 32) |v_ULTIMATE.start_init_#t~nondet2_4|) (_ bv4 32) |v_ULTIMATE.start_init_#t~nondet3_4|)) (not (= |~#d1~0.base| |~#d2~0.base|))))) (.cse3 (= (_ bv0 32) |~#d1~0.offset|)) (.cse4 (exists ((|v_ULTIMATE.start_init_#t~nondet1_4| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet0_4| (_ BitVec 32))) (= (select |#memory_int| |~#d1~0.base|) (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) |~#d1~0.offset| |v_ULTIMATE.start_init_#t~nondet0_4|) (bvadd |~#d1~0.offset| (_ bv4 32)) |v_ULTIMATE.start_init_#t~nondet1_4|))))) (or (and (= |ULTIMATE.start_get_dummy_#res.base| |~#d1~0.base|) (= |ULTIMATE.start_get_dummy_#res.offset| |~#d1~0.offset|) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_get_dummy_#res.offset| |~#d2~0.offset|) .cse0 .cse1 (= |ULTIMATE.start_get_dummy_#res.base| |~#d2~0.base|) .cse2 .cse3 .cse4))) [2019-01-12 09:44:30,161 INFO L448 ceAbstractionStarter]: For program point L23-4(line 23) no Hoare annotation was computed. [2019-01-12 09:44:30,161 INFO L448 ceAbstractionStarter]: For program point L23-6(line 23) no Hoare annotation was computed. [2019-01-12 09:44:30,161 INFO L444 ceAbstractionStarter]: At program point L23-7(lines 21 24) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|))) (let ((.cse3 (= ULTIMATE.start_main_~pd1~0.base |ULTIMATE.start_get_dummy_#res.base|)) (.cse1 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse2 (not .cse0)) (.cse4 (= (_ bv0 32) |~#d1~0.offset|))) (or (and (and (or (and (and .cse0 (= ULTIMATE.start_main_~pd1~0.offset |~#d1~0.offset|)) .cse1) (and (= |ULTIMATE.start_get_dummy_#res.offset| |~#d2~0.offset|) (= |ULTIMATE.start_get_dummy_#res.base| |~#d2~0.base|) .cse2 (= ULTIMATE.start_main_~pd1~0.offset |ULTIMATE.start_get_dummy_#res.offset|) .cse3)) .cse4) (= (_ bv0 32) |~#d2~0.offset|) (exists ((|~#d2~0.base| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet3_4| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet2_4| (_ BitVec 32))) (and (= (select |#memory_int| |~#d2~0.base|) (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (_ bv0 32) |v_ULTIMATE.start_init_#t~nondet2_4|) (_ bv4 32) |v_ULTIMATE.start_init_#t~nondet3_4|)) (not (= |~#d1~0.base| |~#d2~0.base|)))) (exists ((|v_ULTIMATE.start_init_#t~nondet1_4| (_ BitVec 32)) (|v_ULTIMATE.start_init_#t~nondet0_4| (_ BitVec 32))) (= (select |#memory_int| |~#d1~0.base|) (store (store ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) |~#d1~0.offset| |v_ULTIMATE.start_init_#t~nondet0_4|) (bvadd |~#d1~0.offset| (_ bv4 32)) |v_ULTIMATE.start_init_#t~nondet1_4|)))) (and (not .cse3) .cse1 .cse2 .cse4)))) [2019-01-12 09:44:30,162 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2019-01-12 09:44:30,162 INFO L444 ceAbstractionStarter]: At program point L44(lines 32 52) the Hoare annotation is: false [2019-01-12 09:44:30,162 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2019-01-12 09:44:30,162 INFO L444 ceAbstractionStarter]: At program point L40-3(lines 40 42) the Hoare annotation is: (and (forall ((v_ULTIMATE.start_main_~i~0_58 (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) (bvadd ULTIMATE.start_main_~pd2~0.offset (bvmul (_ bv4 32) v_ULTIMATE.start_main_~i~0_58) (_ bv8 32))) v_ULTIMATE.start_main_~i~0_58) (bvslt v_ULTIMATE.start_main_~i~0_58 .cse0) (not (bvslt (bvadd v_ULTIMATE.start_main_~i~0_58 (_ bv4294967295 32)) .cse0))))) (or (bvslt ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~pd2~0.offset (_ bv8 32))))) (= (_ bv0 32) |~#d2~0.offset|) (not (= |~#d1~0.base| |~#d2~0.base|)) (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base) (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset) (= (_ bv0 32) |~#d1~0.offset|)) [2019-01-12 09:44:30,162 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 46) no Hoare annotation was computed. [2019-01-12 09:44:30,162 INFO L448 ceAbstractionStarter]: For program point L40-4(lines 40 42) no Hoare annotation was computed. [2019-01-12 09:44:30,162 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 46) no Hoare annotation was computed. [2019-01-12 09:44:30,162 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:44:30,162 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:44:30,163 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:44:30,163 INFO L444 ceAbstractionStarter]: At program point L28(lines 26 29) the Hoare annotation is: (and (= (_ bv1 32) |ULTIMATE.start_check_#res|) (forall ((v_ULTIMATE.start_main_~i~0_58 (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) (bvadd ULTIMATE.start_main_~pd2~0.offset (bvmul (_ bv4 32) v_ULTIMATE.start_main_~i~0_58) (_ bv8 32))) v_ULTIMATE.start_main_~i~0_58) (bvslt v_ULTIMATE.start_main_~i~0_58 .cse0) (not (bvslt (bvadd v_ULTIMATE.start_main_~i~0_58 (_ bv4294967295 32)) .cse0))))) (= ULTIMATE.start_main_~pd1~0.offset ULTIMATE.start_main_~pd2~0.offset) (not (= |~#d1~0.base| |~#d2~0.base|)) (= (_ bv0 32) |~#d2~0.offset|) (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base) (= (_ bv0 32) |~#d1~0.offset|) (= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~pd2~0.offset (_ bv8 32))))) [2019-01-12 09:44:30,163 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 19) no Hoare annotation was computed. [2019-01-12 09:44:30,163 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:44:30,163 INFO L451 ceAbstractionStarter]: At program point L51(lines 31 52) the Hoare annotation is: true [2019-01-12 09:44:30,163 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 45) no Hoare annotation was computed. [2019-01-12 09:44:30,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,174 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,174 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,186 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:312) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:312) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) 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:123) 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) [2019-01-12 09:44:30,189 INFO L168 Benchmark]: Toolchain (without parser) took 590309.78 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 343.9 MB). Free memory was 954.0 MB in the beginning and 842.7 MB in the end (delta: 111.4 MB). Peak memory consumption was 528.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:44:30,190 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:44:30,190 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.41 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 943.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:44:30,190 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.84 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 937.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:44:30,191 INFO L168 Benchmark]: Boogie Preprocessor took 125.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:44:30,191 INFO L168 Benchmark]: RCFGBuilder took 500.26 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: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:44:30,192 INFO L168 Benchmark]: TraceAbstraction took 589247.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 842.7 MB in the end (delta: 250.0 MB). Peak memory consumption was 541.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:44:30,194 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 376.41 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 943.3 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 53.84 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 937.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 125.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 500.26 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: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 589247.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 842.7 MB in the end (delta: 250.0 MB). Peak memory consumption was 541.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant [2019-01-12 09:44:30,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#d2~0.base,QUANTIFIED] [2019-01-12 09:44:30,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_58,QUANTIFIED] [2019-01-12 09:44:30,203 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[~#d2~0.base,QUANTIFIED] [2019-01-12 09:44:30,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-12 09:44:30,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((forall v_ULTIMATE.start_main_~i~0_58 : bv32 :: (unknown-#memory_int-unknown[pd2][~bvadd64(pd2, ~bvmul32(4bv32, v_ULTIMATE.start_main_~i~0_58), 8bv32)] == v_ULTIMATE.start_main_~i~0_58 || ~bvslt32(v_ULTIMATE.start_main_~i~0_58, unknown-#memory_int-unknown[pa][pa])) || !~bvslt32(~bvadd64(v_ULTIMATE.start_main_~i~0_58, 4294967295bv32), unknown-#memory_int-unknown[pa][pa])) && (~bvslt32(i, unknown-#memory_int-unknown[pa][pa]) || i == unknown-#memory_int-unknown[pd2][~bvadd64(~bvmul32(4bv32, i), pd2, 8bv32)])) && 0bv32 == d2) && !(d1 == ~#d2~0.base)) && pd1 == pd2) && pd2 == pd1) && 0bv32 == d1 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...