./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer --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 9722a10940ebd7a5d75170225a40cd37454d0528 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 08:57:50,236 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:57:50,237 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:57:50,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:57:50,245 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:57:50,245 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:57:50,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:57:50,248 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:57:50,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:57:50,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:57:50,250 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:57:50,251 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:57:50,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:57:50,252 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:57:50,252 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:57:50,253 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:57:50,253 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:57:50,254 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:57:50,256 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:57:50,257 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:57:50,258 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:57:50,258 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:57:50,260 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:57:50,261 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:57:50,261 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:57:50,261 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:57:50,262 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:57:50,262 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:57:50,263 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:57:50,263 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:57:50,264 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:57:50,264 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:57:50,264 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:57:50,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:57:50,265 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:57:50,265 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:57:50,265 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 08:57:50,273 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:57:50,273 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:57:50,274 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:57:50,274 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:57:50,274 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 08:57:50,275 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 08:57:50,275 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 08:57:50,275 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:57:50,275 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:57:50,275 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:57:50,275 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:57:50,275 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:57:50,276 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:57:50,276 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:57:50,276 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:57:50,276 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:57:50,276 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:57:50,276 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:57:50,276 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:57:50,277 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:57:50,277 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:57:50,277 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:57:50,277 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:57:50,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:57:50,277 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:57:50,277 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:57:50,278 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:57:50,278 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 08:57:50,278 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:57:50,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:57:50,278 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer 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 -> 9722a10940ebd7a5d75170225a40cd37454d0528 [2018-11-23 08:57:50,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:57:50,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:57:50,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:57:50,315 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:57:50,315 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:57:50,316 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-23 08:57:50,351 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/data/0411d5f82/0d14e118c94a4ab98540a9ec6f26b0ec/FLAGf26dc63ee [2018-11-23 08:57:50,768 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:57:50,768 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-23 08:57:50,773 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/data/0411d5f82/0d14e118c94a4ab98540a9ec6f26b0ec/FLAGf26dc63ee [2018-11-23 08:57:50,785 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/data/0411d5f82/0d14e118c94a4ab98540a9ec6f26b0ec [2018-11-23 08:57:50,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:57:50,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:57:50,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:57:50,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:57:50,792 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:57:50,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:57:50" (1/1) ... [2018-11-23 08:57:50,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab0a94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:50, skipping insertion in model container [2018-11-23 08:57:50,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:57:50" (1/1) ... [2018-11-23 08:57:50,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:57:50,818 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:57:50,947 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:57:50,950 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:57:50,963 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:57:50,975 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:57:50,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:50 WrapperNode [2018-11-23 08:57:50,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:57:50,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:57:50,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:57:50,976 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:57:50,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:50" (1/1) ... [2018-11-23 08:57:50,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:50" (1/1) ... [2018-11-23 08:57:50,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:57:50,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:57:50,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:57:50,991 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:57:50,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:50" (1/1) ... [2018-11-23 08:57:50,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:50" (1/1) ... [2018-11-23 08:57:50,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:50" (1/1) ... [2018-11-23 08:57:50,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:50" (1/1) ... [2018-11-23 08:57:51,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:50" (1/1) ... [2018-11-23 08:57:51,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:50" (1/1) ... [2018-11-23 08:57:51,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:50" (1/1) ... [2018-11-23 08:57:51,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:57:51,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:57:51,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:57:51,045 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:57:51,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/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 [2018-11-23 08:57:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 08:57:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:57:51,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:57:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 08:57:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:57:51,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:57:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 08:57:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:57:51,080 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:57:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 08:57:51,080 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 08:57:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 08:57:51,218 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:57:51,218 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 08:57:51,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:57:51 BoogieIcfgContainer [2018-11-23 08:57:51,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:57:51,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:57:51,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:57:51,222 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:57:51,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:57:50" (1/3) ... [2018-11-23 08:57:51,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310373fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:57:51, skipping insertion in model container [2018-11-23 08:57:51,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:57:50" (2/3) ... [2018-11-23 08:57:51,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310373fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:57:51, skipping insertion in model container [2018-11-23 08:57:51,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:57:51" (3/3) ... [2018-11-23 08:57:51,226 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-11-23 08:57:51,234 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:57:51,239 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:57:51,252 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:57:51,276 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 08:57:51,277 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:57:51,277 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:57:51,277 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:57:51,277 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:57:51,278 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:57:51,278 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:57:51,278 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:57:51,278 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:57:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 08:57:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 08:57:51,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:57:51,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:57:51,296 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:57:51,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:57:51,299 INFO L82 PathProgramCache]: Analyzing trace with hash 342854797, now seen corresponding path program 1 times [2018-11-23 08:57:51,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:57:51,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:57:51,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:51,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:57:51,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:57:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:51,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:57:51,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 08:57:51,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 08:57:51,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 08:57:51,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 08:57:51,510 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2018-11-23 08:57:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:57:51,588 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2018-11-23 08:57:51,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 08:57:51,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 08:57:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:57:51,594 INFO L225 Difference]: With dead ends: 67 [2018-11-23 08:57:51,594 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 08:57:51,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:57:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 08:57:51,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2018-11-23 08:57:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 08:57:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 08:57:51,620 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-23 08:57:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:57:51,621 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 08:57:51,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 08:57:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 08:57:51,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 08:57:51,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:57:51,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:57:51,622 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:57:51,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:57:51,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1336061280, now seen corresponding path program 1 times [2018-11-23 08:57:51,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:57:51,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:57:51,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:51,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:57:51,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:57:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:51,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:57:51,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/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 [2018-11-23 08:57:51,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:57:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:57:52,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:57:52,135 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 28 treesize of output 23 [2018-11-23 08:57:52,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:52,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 37 [2018-11-23 08:57:52,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:52,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:52,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:57:52,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-23 08:57:52,179 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 26 treesize of output 18 [2018-11-23 08:57:52,182 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 08:57:52,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:52,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:52,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:52,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 08:57:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:52,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:57:52,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-11-23 08:57:52,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 08:57:52,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 08:57:52,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-23 08:57:52,220 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 17 states. [2018-11-23 08:57:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:57:52,589 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2018-11-23 08:57:52,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 08:57:52,589 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-11-23 08:57:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:57:52,591 INFO L225 Difference]: With dead ends: 86 [2018-11-23 08:57:52,592 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 08:57:52,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-11-23 08:57:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 08:57:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2018-11-23 08:57:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 08:57:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-23 08:57:52,604 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 19 [2018-11-23 08:57:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:57:52,604 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-23 08:57:52,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 08:57:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 08:57:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 08:57:52,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:57:52,605 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:57:52,605 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:57:52,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:57:52,606 INFO L82 PathProgramCache]: Analyzing trace with hash -455852680, now seen corresponding path program 1 times [2018-11-23 08:57:52,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:57:52,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:57:52,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:52,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:57:52,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:57:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:53,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:57:53,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/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 [2018-11-23 08:57:53,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:57:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:57:53,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:57:53,137 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 38 treesize of output 31 [2018-11-23 08:57:53,139 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:53,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 47 [2018-11-23 08:57:53,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:53,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:53,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:53,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-23 08:57:53,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:53,266 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-23 08:57:53,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:53,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:53,271 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:57:53,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 72 [2018-11-23 08:57:53,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:53,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:53,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:57:53,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-23 08:57:53,360 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 31 [2018-11-23 08:57:53,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:53,363 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:57:53,364 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:53,365 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:57:53,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:53,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-11-23 08:57:53,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:53,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:53,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:53,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-23 08:57:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:53,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:57:53,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2018-11-23 08:57:53,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 08:57:53,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 08:57:53,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2018-11-23 08:57:53,416 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 28 states. [2018-11-23 08:57:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:57:54,083 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2018-11-23 08:57:54,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 08:57:54,085 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 24 [2018-11-23 08:57:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:57:54,087 INFO L225 Difference]: With dead ends: 130 [2018-11-23 08:57:54,087 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 08:57:54,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=260, Invalid=1546, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 08:57:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 08:57:54,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 58. [2018-11-23 08:57:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 08:57:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2018-11-23 08:57:54,096 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 24 [2018-11-23 08:57:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:57:54,097 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2018-11-23 08:57:54,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 08:57:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-23 08:57:54,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 08:57:54,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:57:54,097 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:57:54,098 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:57:54,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:57:54,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2042668019, now seen corresponding path program 2 times [2018-11-23 08:57:54,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:57:54,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:57:54,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:54,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:57:54,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:57:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:54,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:57:54,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/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 [2018-11-23 08:57:54,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 08:57:54,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:57:54,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:57:54,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:57:54,488 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 28 treesize of output 23 [2018-11-23 08:57:54,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:54,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 37 [2018-11-23 08:57:54,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:54,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:54,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:54,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-23 08:57:54,553 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 32 treesize of output 25 [2018-11-23 08:57:54,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:54,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:54,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:54,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-23 08:57:54,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:54,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:54,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:57:54,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2018-11-23 08:57:54,630 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 26 treesize of output 18 [2018-11-23 08:57:54,633 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 08:57:54,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:54,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:54,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:54,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 08:57:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:54,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:57:54,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 18 [2018-11-23 08:57:54,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 08:57:54,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 08:57:54,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-11-23 08:57:54,670 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 18 states. [2018-11-23 08:57:55,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:57:55,127 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions. [2018-11-23 08:57:55,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 08:57:55,127 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-23 08:57:55,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:57:55,128 INFO L225 Difference]: With dead ends: 147 [2018-11-23 08:57:55,128 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 08:57:55,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 08:57:55,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 08:57:55,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 68. [2018-11-23 08:57:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 08:57:55,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2018-11-23 08:57:55,136 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 25 [2018-11-23 08:57:55,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:57:55,136 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2018-11-23 08:57:55,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 08:57:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-11-23 08:57:55,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 08:57:55,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:57:55,137 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:57:55,137 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:57:55,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:57:55,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2145817879, now seen corresponding path program 1 times [2018-11-23 08:57:55,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:57:55,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:57:55,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:55,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:57:55,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:57:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:55,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:57:55,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/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 [2018-11-23 08:57:55,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:57:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:57:55,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:57:55,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:55,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:57:55,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-11-23 08:57:55,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 08:57:55,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 08:57:55,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 08:57:55,304 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand 9 states. [2018-11-23 08:57:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:57:55,361 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2018-11-23 08:57:55,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 08:57:55,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-11-23 08:57:55,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:57:55,362 INFO L225 Difference]: With dead ends: 119 [2018-11-23 08:57:55,362 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 08:57:55,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-23 08:57:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 08:57:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2018-11-23 08:57:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 08:57:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2018-11-23 08:57:55,369 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 27 [2018-11-23 08:57:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:57:55,369 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2018-11-23 08:57:55,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 08:57:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2018-11-23 08:57:55,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 08:57:55,370 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:57:55,370 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:57:55,370 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:57:55,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:57:55,370 INFO L82 PathProgramCache]: Analyzing trace with hash 504300867, now seen corresponding path program 1 times [2018-11-23 08:57:55,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:57:55,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:57:55,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:55,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:57:55,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:57:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:55,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:57:55,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/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 [2018-11-23 08:57:55,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:57:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:57:55,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:57:55,666 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 21 treesize of output 16 [2018-11-23 08:57:55,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:55,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 23 [2018-11-23 08:57:55,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:55,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:55,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:55,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-23 08:57:55,703 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 26 treesize of output 18 [2018-11-23 08:57:55,705 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 08:57:55,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:55,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:55,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:55,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 08:57:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:55,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:57:55,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-11-23 08:57:55,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 08:57:55,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 08:57:55,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-11-23 08:57:55,760 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 17 states. [2018-11-23 08:57:56,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:57:56,256 INFO L93 Difference]: Finished difference Result 211 states and 273 transitions. [2018-11-23 08:57:56,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 08:57:56,256 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-11-23 08:57:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:57:56,257 INFO L225 Difference]: With dead ends: 211 [2018-11-23 08:57:56,257 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 08:57:56,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=392, Invalid=1330, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 08:57:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 08:57:56,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 86. [2018-11-23 08:57:56,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 08:57:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2018-11-23 08:57:56,265 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 30 [2018-11-23 08:57:56,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:57:56,265 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2018-11-23 08:57:56,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 08:57:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2018-11-23 08:57:56,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 08:57:56,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:57:56,266 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:57:56,266 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:57:56,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:57:56,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1205365445, now seen corresponding path program 2 times [2018-11-23 08:57:56,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:57:56,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:57:56,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:56,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:57:56,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:57:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:56,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:57:56,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/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 [2018-11-23 08:57:56,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 08:57:56,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:57:56,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:57:56,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:57:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:56,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:57:56,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 08:57:56,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 08:57:56,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 08:57:56,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 08:57:56,340 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand 7 states. [2018-11-23 08:57:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:57:56,431 INFO L93 Difference]: Finished difference Result 165 states and 212 transitions. [2018-11-23 08:57:56,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 08:57:56,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-23 08:57:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:57:56,432 INFO L225 Difference]: With dead ends: 165 [2018-11-23 08:57:56,432 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 08:57:56,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-11-23 08:57:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 08:57:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 76. [2018-11-23 08:57:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 08:57:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2018-11-23 08:57:56,441 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 30 [2018-11-23 08:57:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:57:56,441 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2018-11-23 08:57:56,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 08:57:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2018-11-23 08:57:56,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 08:57:56,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:57:56,444 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:57:56,444 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:57:56,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:57:56,444 INFO L82 PathProgramCache]: Analyzing trace with hash 488358411, now seen corresponding path program 3 times [2018-11-23 08:57:56,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:57:56,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:57:56,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:56,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:57:56,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:57:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:56,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:57:56,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:57:56,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 08:57:56,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 08:57:56,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:57:56,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:57:56,800 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 38 treesize of output 31 [2018-11-23 08:57:56,803 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:57:56,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:56,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 71 [2018-11-23 08:57:56,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:56,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:56,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:56,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-11-23 08:57:56,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:56,867 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-11-23 08:57:56,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:56,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:56,871 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:57:56,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 72 [2018-11-23 08:57:56,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:56,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:56,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:56,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-11-23 08:57:57,001 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 34 treesize of output 27 [2018-11-23 08:57:57,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:57,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:57,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:57,007 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:57,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-23 08:57:57,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:57,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:57,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:57:57,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:36 [2018-11-23 08:57:57,057 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 28 treesize of output 20 [2018-11-23 08:57:57,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:57,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 08:57:57,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:57,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:57,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:57,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-23 08:57:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:57,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:57:57,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 24 [2018-11-23 08:57:57,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 08:57:57,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 08:57:57,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2018-11-23 08:57:57,133 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand 24 states. [2018-11-23 08:57:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:57:57,888 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2018-11-23 08:57:57,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 08:57:57,888 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-11-23 08:57:57,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:57:57,889 INFO L225 Difference]: With dead ends: 135 [2018-11-23 08:57:57,889 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 08:57:57,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=1392, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 08:57:57,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 08:57:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 70. [2018-11-23 08:57:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 08:57:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2018-11-23 08:57:57,898 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 30 [2018-11-23 08:57:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:57:57,898 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2018-11-23 08:57:57,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 08:57:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2018-11-23 08:57:57,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 08:57:57,899 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:57:57,899 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:57:57,900 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:57:57,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:57:57,900 INFO L82 PathProgramCache]: Analyzing trace with hash 586827946, now seen corresponding path program 2 times [2018-11-23 08:57:57,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:57:57,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:57:57,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:57,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:57:57,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:57:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:57:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:58,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:57:58,119 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:57:58,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 08:57:58,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:57:58,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:57:58,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:57:58,226 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 23 treesize of output 18 [2018-11-23 08:57:58,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:57:58,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 27 [2018-11-23 08:57:58,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:58,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:58,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:58,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-23 08:57:58,383 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 26 treesize of output 18 [2018-11-23 08:57:58,385 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 08:57:58,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:57:58,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:58,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:57:58,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 08:57:58,424 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:57:58,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:57:58,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-11-23 08:57:58,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 08:57:58,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 08:57:58,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2018-11-23 08:57:58,449 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 29 states. [2018-11-23 08:58:19,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:58:19,012 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2018-11-23 08:58:19,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 08:58:19,012 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2018-11-23 08:58:19,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:58:19,013 INFO L225 Difference]: With dead ends: 131 [2018-11-23 08:58:19,013 INFO L226 Difference]: Without dead ends: 129 [2018-11-23 08:58:19,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=1898, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 08:58:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-23 08:58:19,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 82. [2018-11-23 08:58:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 08:58:19,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2018-11-23 08:58:19,023 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 33 [2018-11-23 08:58:19,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:58:19,023 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-11-23 08:58:19,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 08:58:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2018-11-23 08:58:19,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 08:58:19,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:58:19,025 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:58:19,025 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:58:19,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:58:19,025 INFO L82 PathProgramCache]: Analyzing trace with hash 853695349, now seen corresponding path program 4 times [2018-11-23 08:58:19,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:58:19,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:58:19,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:19,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:58:19,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:58:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:58:19,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:58:19,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:58:19,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 08:58:19,346 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 08:58:19,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:58:19,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:58:19,393 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 38 treesize of output 31 [2018-11-23 08:58:19,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:19,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 47 [2018-11-23 08:58:19,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:19,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:19,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:19,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-11-23 08:58:19,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:19,859 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-23 08:58:19,861 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:19,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:19,862 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:58:19,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 73 [2018-11-23 08:58:19,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:19,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:19,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 08:58:19,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:35 [2018-11-23 08:58:19,923 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 40 treesize of output 32 [2018-11-23 08:58:19,925 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:58:19,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:19,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:19,927 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:58:19,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:19,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 63 [2018-11-23 08:58:19,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:19,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:19,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:19,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2018-11-23 08:58:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 08:58:19,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:58:19,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 28 [2018-11-23 08:58:19,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 08:58:19,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 08:58:19,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-11-23 08:58:19,977 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand 28 states. [2018-11-23 08:58:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:58:20,967 INFO L93 Difference]: Finished difference Result 168 states and 202 transitions. [2018-11-23 08:58:20,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 08:58:20,967 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-11-23 08:58:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:58:20,968 INFO L225 Difference]: With dead ends: 168 [2018-11-23 08:58:20,968 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 08:58:20,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=425, Invalid=2545, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 08:58:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 08:58:20,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 85. [2018-11-23 08:58:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 08:58:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2018-11-23 08:58:20,980 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 35 [2018-11-23 08:58:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:58:20,980 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2018-11-23 08:58:20,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 08:58:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2018-11-23 08:58:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 08:58:20,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:58:20,981 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:58:20,981 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:58:20,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:58:20,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1400428558, now seen corresponding path program 1 times [2018-11-23 08:58:20,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:58:20,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:58:20,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:20,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:58:20,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:58:21,379 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:58:21,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:58:21,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:58:21,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:58:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:58:21,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:58:21,453 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 28 treesize of output 23 [2018-11-23 08:58:21,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:21,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 37 [2018-11-23 08:58:21,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:21,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:21,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:21,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-23 08:58:21,541 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 32 treesize of output 25 [2018-11-23 08:58:21,555 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 08:58:21,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:21,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:21,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:21,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:21,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 43 [2018-11-23 08:58:21,564 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:21,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:21,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:21,584 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2018-11-23 08:58:21,628 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 32 treesize of output 25 [2018-11-23 08:58:21,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:21,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:21,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:21,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-23 08:58:21,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:21,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:21,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:21,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-23 08:58:21,663 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 26 treesize of output 18 [2018-11-23 08:58:21,666 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 08:58:21,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:21,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:21,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:21,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 08:58:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 08:58:21,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:58:21,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2018-11-23 08:58:21,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 08:58:21,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 08:58:21,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-11-23 08:58:21,720 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 21 states. [2018-11-23 08:58:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:58:22,273 INFO L93 Difference]: Finished difference Result 242 states and 289 transitions. [2018-11-23 08:58:22,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 08:58:22,274 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-11-23 08:58:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:58:22,275 INFO L225 Difference]: With dead ends: 242 [2018-11-23 08:58:22,275 INFO L226 Difference]: Without dead ends: 197 [2018-11-23 08:58:22,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 14 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=1135, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 08:58:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-23 08:58:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 121. [2018-11-23 08:58:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-23 08:58:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2018-11-23 08:58:22,287 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 36 [2018-11-23 08:58:22,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:58:22,287 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2018-11-23 08:58:22,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 08:58:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2018-11-23 08:58:22,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 08:58:22,288 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:58:22,288 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:58:22,288 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:58:22,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:58:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash -311016042, now seen corresponding path program 2 times [2018-11-23 08:58:22,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:58:22,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:58:22,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:22,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:58:22,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:58:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:58:22,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:58:22,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:58:22,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 08:58:22,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:58:22,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:58:22,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:58:22,730 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 28 treesize of output 23 [2018-11-23 08:58:22,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:22,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 37 [2018-11-23 08:58:22,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:22,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:22,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:58:22,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-11-23 08:58:22,811 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 32 treesize of output 25 [2018-11-23 08:58:22,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:22,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:22,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:22,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-23 08:58:22,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:22,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:22,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:22,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:19 [2018-11-23 08:58:22,836 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 26 treesize of output 18 [2018-11-23 08:58:22,838 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 08:58:22,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:22,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:22,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:22,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 08:58:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:58:22,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:58:22,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-11-23 08:58:22,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 08:58:22,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 08:58:22,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2018-11-23 08:58:22,866 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand 25 states. [2018-11-23 08:58:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:58:23,576 INFO L93 Difference]: Finished difference Result 246 states and 295 transitions. [2018-11-23 08:58:23,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 08:58:23,576 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 36 [2018-11-23 08:58:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:58:23,577 INFO L225 Difference]: With dead ends: 246 [2018-11-23 08:58:23,577 INFO L226 Difference]: Without dead ends: 201 [2018-11-23 08:58:23,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 08:58:23,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-23 08:58:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 133. [2018-11-23 08:58:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 08:58:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 161 transitions. [2018-11-23 08:58:23,593 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 161 transitions. Word has length 36 [2018-11-23 08:58:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:58:23,594 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 161 transitions. [2018-11-23 08:58:23,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 08:58:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 161 transitions. [2018-11-23 08:58:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 08:58:23,594 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:58:23,595 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:58:23,595 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:58:23,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:58:23,595 INFO L82 PathProgramCache]: Analyzing trace with hash -591767046, now seen corresponding path program 1 times [2018-11-23 08:58:23,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:58:23,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:58:23,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:23,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:58:23,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:58:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:58:23,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:58:23,859 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:58:23,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:58:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:58:23,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:58:23,973 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 38 treesize of output 31 [2018-11-23 08:58:23,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:23,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 47 [2018-11-23 08:58:23,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:23,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:23,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:23,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-23 08:58:24,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:24,087 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2018-11-23 08:58:24,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:24,090 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:58:24,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2018-11-23 08:58:24,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:24,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:24,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:58:24,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2018-11-23 08:58:24,310 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 32 treesize of output 24 [2018-11-23 08:58:24,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:24,328 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:58:24,329 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:24,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-11-23 08:58:24,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:24,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:24,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:24,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-11-23 08:58:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:58:24,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:58:24,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-11-23 08:58:24,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 08:58:24,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 08:58:24,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 08:58:24,403 INFO L87 Difference]: Start difference. First operand 133 states and 161 transitions. Second operand 36 states. [2018-11-23 08:58:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:58:25,206 INFO L93 Difference]: Finished difference Result 192 states and 227 transitions. [2018-11-23 08:58:25,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 08:58:25,206 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 38 [2018-11-23 08:58:25,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:58:25,207 INFO L225 Difference]: With dead ends: 192 [2018-11-23 08:58:25,207 INFO L226 Difference]: Without dead ends: 190 [2018-11-23 08:58:25,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=258, Invalid=2394, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 08:58:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-23 08:58:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 140. [2018-11-23 08:58:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 08:58:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 170 transitions. [2018-11-23 08:58:25,226 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 170 transitions. Word has length 38 [2018-11-23 08:58:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:58:25,227 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 170 transitions. [2018-11-23 08:58:25,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 08:58:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 170 transitions. [2018-11-23 08:58:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 08:58:25,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:58:25,228 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:58:25,228 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:58:25,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:58:25,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1198506493, now seen corresponding path program 3 times [2018-11-23 08:58:25,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:58:25,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:58:25,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:25,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:58:25,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:58:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:58:25,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:58:25,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:58:25,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 08:58:25,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 08:58:25,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:58:25,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:58:25,733 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 28 treesize of output 23 [2018-11-23 08:58:25,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:25,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 37 [2018-11-23 08:58:25,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:25,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:25,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:25,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-23 08:58:25,792 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 32 treesize of output 25 [2018-11-23 08:58:25,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:25,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:25,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:25,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-23 08:58:25,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:25,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:25,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:25,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-23 08:58:25,930 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 26 treesize of output 18 [2018-11-23 08:58:25,932 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 08:58:25,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:25,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:25,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:25,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 08:58:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:58:25,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:58:25,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2018-11-23 08:58:25,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 08:58:25,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 08:58:25,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 08:58:25,982 INFO L87 Difference]: Start difference. First operand 140 states and 170 transitions. Second operand 33 states. [2018-11-23 08:58:38,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:58:38,658 INFO L93 Difference]: Finished difference Result 266 states and 316 transitions. [2018-11-23 08:58:38,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 08:58:38,659 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2018-11-23 08:58:38,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:58:38,659 INFO L225 Difference]: With dead ends: 266 [2018-11-23 08:58:38,660 INFO L226 Difference]: Without dead ends: 209 [2018-11-23 08:58:38,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=2406, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 08:58:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-23 08:58:38,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 139. [2018-11-23 08:58:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 08:58:38,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2018-11-23 08:58:38,676 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 39 [2018-11-23 08:58:38,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:58:38,677 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2018-11-23 08:58:38,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 08:58:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2018-11-23 08:58:38,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 08:58:38,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:58:38,677 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:58:38,677 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:58:38,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:58:38,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1463502433, now seen corresponding path program 4 times [2018-11-23 08:58:38,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:58:38,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:58:38,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:38,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:58:38,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:58:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 08:58:38,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:58:38,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:58:38,754 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 08:58:38,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 08:58:38,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:58:38,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:58:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 08:58:38,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:58:38,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-11-23 08:58:38,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 08:58:38,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 08:58:38,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 08:58:38,820 INFO L87 Difference]: Start difference. First operand 139 states and 168 transitions. Second operand 12 states. [2018-11-23 08:58:38,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:58:38,912 INFO L93 Difference]: Finished difference Result 221 states and 266 transitions. [2018-11-23 08:58:38,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 08:58:38,912 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-23 08:58:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:58:38,913 INFO L225 Difference]: With dead ends: 221 [2018-11-23 08:58:38,913 INFO L226 Difference]: Without dead ends: 201 [2018-11-23 08:58:38,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-11-23 08:58:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-23 08:58:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 157. [2018-11-23 08:58:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-23 08:58:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 186 transitions. [2018-11-23 08:58:38,941 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 186 transitions. Word has length 41 [2018-11-23 08:58:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:58:38,941 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 186 transitions. [2018-11-23 08:58:38,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 08:58:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2018-11-23 08:58:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 08:58:38,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:58:38,943 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:58:38,943 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:58:38,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:58:38,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2065125816, now seen corresponding path program 5 times [2018-11-23 08:58:38,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:58:38,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:58:38,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:38,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:58:38,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:58:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:58:39,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:58:39,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:58:39,349 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 08:58:39,385 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 08:58:39,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:58:39,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:58:39,527 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 38 treesize of output 31 [2018-11-23 08:58:39,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:39,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 47 [2018-11-23 08:58:39,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:39,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:39,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:39,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-11-23 08:58:39,591 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:39,591 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-11-23 08:58:39,593 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:39,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-23 08:58:39,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:39,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:39,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:39,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:33 [2018-11-23 08:58:39,659 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 34 treesize of output 27 [2018-11-23 08:58:39,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:39,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:39,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:39,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:39,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-23 08:58:39,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:39,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:39,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:39,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-11-23 08:58:39,685 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 28 treesize of output 20 [2018-11-23 08:58:39,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:39,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 08:58:39,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:39,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:39,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:39,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-23 08:58:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 08:58:39,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:58:39,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2018-11-23 08:58:39,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 08:58:39,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 08:58:39,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2018-11-23 08:58:39,718 INFO L87 Difference]: Start difference. First operand 157 states and 186 transitions. Second operand 30 states. [2018-11-23 08:58:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:58:40,722 INFO L93 Difference]: Finished difference Result 305 states and 364 transitions. [2018-11-23 08:58:40,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 08:58:40,723 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2018-11-23 08:58:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:58:40,723 INFO L225 Difference]: With dead ends: 305 [2018-11-23 08:58:40,723 INFO L226 Difference]: Without dead ends: 248 [2018-11-23 08:58:40,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=477, Invalid=2715, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 08:58:40,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-23 08:58:40,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 168. [2018-11-23 08:58:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 08:58:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 198 transitions. [2018-11-23 08:58:40,751 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 198 transitions. Word has length 41 [2018-11-23 08:58:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:58:40,751 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 198 transitions. [2018-11-23 08:58:40,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 08:58:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 198 transitions. [2018-11-23 08:58:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 08:58:40,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:58:40,751 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:58:40,751 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:58:40,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:58:40,752 INFO L82 PathProgramCache]: Analyzing trace with hash 591821558, now seen corresponding path program 1 times [2018-11-23 08:58:40,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:58:40,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:58:40,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:40,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:58:40,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:58:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:58:41,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:58:41,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:58:41,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:58:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:58:41,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:58:41,302 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 38 treesize of output 31 [2018-11-23 08:58:41,305 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:58:41,307 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:41,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 71 [2018-11-23 08:58:41,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:41,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:41,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:41,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-11-23 08:58:41,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:41,449 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-11-23 08:58:41,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:41,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:41,453 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:58:41,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 72 [2018-11-23 08:58:41,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:41,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:41,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:41,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-23 08:58:41,526 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 34 treesize of output 27 [2018-11-23 08:58:41,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:41,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:41,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:41,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:41,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-23 08:58:41,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:41,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:41,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:58:41,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:36 [2018-11-23 08:58:41,618 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 34 treesize of output 27 [2018-11-23 08:58:41,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:41,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:41,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:41,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:41,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-23 08:58:41,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:41,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:41,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:41,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-11-23 08:58:41,651 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 28 treesize of output 20 [2018-11-23 08:58:41,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:41,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 08:58:41,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:41,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:41,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:41,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-23 08:58:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 08:58:41,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:58:41,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 31 [2018-11-23 08:58:41,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 08:58:41,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 08:58:41,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2018-11-23 08:58:41,706 INFO L87 Difference]: Start difference. First operand 168 states and 198 transitions. Second operand 31 states. [2018-11-23 08:58:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:58:42,405 INFO L93 Difference]: Finished difference Result 306 states and 365 transitions. [2018-11-23 08:58:42,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 08:58:42,405 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 41 [2018-11-23 08:58:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:58:42,407 INFO L225 Difference]: With dead ends: 306 [2018-11-23 08:58:42,407 INFO L226 Difference]: Without dead ends: 238 [2018-11-23 08:58:42,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=280, Invalid=1882, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 08:58:42,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-23 08:58:42,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 174. [2018-11-23 08:58:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-23 08:58:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 206 transitions. [2018-11-23 08:58:42,442 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 206 transitions. Word has length 41 [2018-11-23 08:58:42,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:58:42,442 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 206 transitions. [2018-11-23 08:58:42,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 08:58:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 206 transitions. [2018-11-23 08:58:42,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 08:58:42,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:58:42,443 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:58:42,443 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:58:42,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:58:42,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2135659553, now seen corresponding path program 2 times [2018-11-23 08:58:42,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:58:42,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:58:42,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:42,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:58:42,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:58:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:58:42,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:58:42,836 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:58:42,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 08:58:42,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:58:42,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:58:42,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:58:42,904 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 28 treesize of output 23 [2018-11-23 08:58:42,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:42,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 37 [2018-11-23 08:58:42,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:42,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:42,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:42,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-23 08:58:42,950 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 39 treesize of output 32 [2018-11-23 08:58:42,960 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 08:58:42,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:42,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:42,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:42,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:42,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 66 [2018-11-23 08:58:42,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:42,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:42,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:42,977 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:25 [2018-11-23 08:58:43,025 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 32 treesize of output 25 [2018-11-23 08:58:43,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:43,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:43,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:43,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-23 08:58:43,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:43,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:43,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:43,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:29 [2018-11-23 08:58:43,072 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 32 treesize of output 25 [2018-11-23 08:58:43,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:43,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:43,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:43,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-23 08:58:43,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:43,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:43,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:43,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:19 [2018-11-23 08:58:43,098 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 26 treesize of output 18 [2018-11-23 08:58:43,099 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 08:58:43,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:43,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:43,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:43,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 08:58:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:58:43,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:58:43,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 25 [2018-11-23 08:58:43,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 08:58:43,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 08:58:43,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2018-11-23 08:58:43,131 INFO L87 Difference]: Start difference. First operand 174 states and 206 transitions. Second operand 25 states. [2018-11-23 08:58:44,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:58:44,083 INFO L93 Difference]: Finished difference Result 371 states and 447 transitions. [2018-11-23 08:58:44,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 08:58:44,084 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2018-11-23 08:58:44,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:58:44,085 INFO L225 Difference]: With dead ends: 371 [2018-11-23 08:58:44,085 INFO L226 Difference]: Without dead ends: 303 [2018-11-23 08:58:44,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 15 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=347, Invalid=2005, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 08:58:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-23 08:58:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 171. [2018-11-23 08:58:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-23 08:58:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2018-11-23 08:58:44,111 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 42 [2018-11-23 08:58:44,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:58:44,111 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2018-11-23 08:58:44,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 08:58:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2018-11-23 08:58:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 08:58:44,112 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:58:44,112 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:58:44,112 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:58:44,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:58:44,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1630887468, now seen corresponding path program 1 times [2018-11-23 08:58:44,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:58:44,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:58:44,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:44,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:58:44,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:58:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:58:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:58:44,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:58:44,779 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:58:44,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:58:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:58:44,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:58:44,883 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 28 treesize of output 23 [2018-11-23 08:58:44,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:44,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 37 [2018-11-23 08:58:44,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:44,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:44,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:44,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-23 08:58:44,928 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 40 treesize of output 31 [2018-11-23 08:58:44,930 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:58:44,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:44,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:44,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:44,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 77 [2018-11-23 08:58:44,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:44,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:44,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:44,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-11-23 08:58:45,092 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 60 treesize of output 47 [2018-11-23 08:58:45,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:45,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:45,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:45,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:45,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:45,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:45,098 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:58:45,099 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:58:45,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 131 [2018-11-23 08:58:45,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:45,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:45,120 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. [2018-11-23 08:58:45,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:54 [2018-11-23 08:58:45,309 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 56 treesize of output 45 [2018-11-23 08:58:45,312 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:45,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:45,314 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:58:45,315 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:58:45,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 85 [2018-11-23 08:58:45,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:45,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:45,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:58:45,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:78, output treesize:30 [2018-11-23 08:58:45,498 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 26 treesize of output 18 [2018-11-23 08:58:45,500 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 08:58:45,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:58:45,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:45,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:58:45,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 08:58:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:58:45,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:58:45,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 43 [2018-11-23 08:58:45,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 08:58:45,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 08:58:45,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1633, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 08:58:45,582 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand 43 states. [2018-11-23 08:59:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:59:03,265 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2018-11-23 08:59:03,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 08:59:03,265 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-11-23 08:59:03,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:59:03,266 INFO L225 Difference]: With dead ends: 217 [2018-11-23 08:59:03,266 INFO L226 Difference]: Without dead ends: 200 [2018-11-23 08:59:03,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=549, Invalid=4707, Unknown=0, NotChecked=0, Total=5256 [2018-11-23 08:59:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-23 08:59:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 181. [2018-11-23 08:59:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-23 08:59:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 212 transitions. [2018-11-23 08:59:03,290 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 212 transitions. Word has length 43 [2018-11-23 08:59:03,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:59:03,291 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 212 transitions. [2018-11-23 08:59:03,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 08:59:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 212 transitions. [2018-11-23 08:59:03,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 08:59:03,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:59:03,291 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:59:03,291 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:59:03,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:59:03,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1316368837, now seen corresponding path program 1 times [2018-11-23 08:59:03,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:59:03,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:59:03,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:59:03,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:59:03,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:59:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:59:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:59:03,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:59:03,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:59:03,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:59:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:59:03,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:59:03,647 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 28 treesize of output 23 [2018-11-23 08:59:03,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:03,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 37 [2018-11-23 08:59:03,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:03,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:03,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:59:03,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-23 08:59:03,867 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 32 treesize of output 24 [2018-11-23 08:59:03,869 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:59:03,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:03,871 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:59:03,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 40 [2018-11-23 08:59:03,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:03,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:03,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:03,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-11-23 08:59:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:59:03,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:59:03,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2018-11-23 08:59:03,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 08:59:03,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 08:59:03,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2018-11-23 08:59:03,937 INFO L87 Difference]: Start difference. First operand 181 states and 212 transitions. Second operand 32 states. [2018-11-23 08:59:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:59:30,980 INFO L93 Difference]: Finished difference Result 417 states and 495 transitions. [2018-11-23 08:59:30,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 08:59:30,980 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2018-11-23 08:59:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:59:30,981 INFO L225 Difference]: With dead ends: 417 [2018-11-23 08:59:30,981 INFO L226 Difference]: Without dead ends: 349 [2018-11-23 08:59:30,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=4409, Unknown=0, NotChecked=0, Total=4970 [2018-11-23 08:59:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-23 08:59:31,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 198. [2018-11-23 08:59:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-23 08:59:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 234 transitions. [2018-11-23 08:59:31,028 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 234 transitions. Word has length 44 [2018-11-23 08:59:31,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:59:31,028 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 234 transitions. [2018-11-23 08:59:31,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 08:59:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 234 transitions. [2018-11-23 08:59:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 08:59:31,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:59:31,029 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:59:31,029 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:59:31,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:59:31,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2095999155, now seen corresponding path program 2 times [2018-11-23 08:59:31,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:59:31,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:59:31,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:59:31,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:59:31,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:59:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:59:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:59:31,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:59:31,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:59:31,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 08:59:31,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:59:31,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:59:31,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:59:31,670 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 38 treesize of output 31 [2018-11-23 08:59:31,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:31,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 47 [2018-11-23 08:59:31,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:31,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:31,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:31,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-11-23 08:59:31,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:31,792 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-11-23 08:59:31,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:31,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:31,796 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:59:31,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 72 [2018-11-23 08:59:31,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:31,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:31,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:31,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-23 08:59:31,882 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 31 treesize of output 24 [2018-11-23 08:59:31,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:31,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:31,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:31,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:31,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 67 [2018-11-23 08:59:31,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:31,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:31,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:31,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-11-23 08:59:32,048 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 28 treesize of output 20 [2018-11-23 08:59:32,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:32,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 08:59:32,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:32,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:32,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:32,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-23 08:59:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:59:32,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:59:32,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2018-11-23 08:59:32,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 08:59:32,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 08:59:32,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1530, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 08:59:32,105 INFO L87 Difference]: Start difference. First operand 198 states and 234 transitions. Second operand 42 states. [2018-11-23 08:59:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:59:33,910 INFO L93 Difference]: Finished difference Result 337 states and 398 transitions. [2018-11-23 08:59:33,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-23 08:59:33,910 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 44 [2018-11-23 08:59:33,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:59:33,911 INFO L225 Difference]: With dead ends: 337 [2018-11-23 08:59:33,911 INFO L226 Difference]: Without dead ends: 335 [2018-11-23 08:59:33,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2040 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=737, Invalid=5743, Unknown=0, NotChecked=0, Total=6480 [2018-11-23 08:59:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-11-23 08:59:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 235. [2018-11-23 08:59:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-11-23 08:59:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 278 transitions. [2018-11-23 08:59:33,954 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 278 transitions. Word has length 44 [2018-11-23 08:59:33,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:59:33,954 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 278 transitions. [2018-11-23 08:59:33,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 08:59:33,954 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 278 transitions. [2018-11-23 08:59:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 08:59:33,955 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:59:33,955 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:59:33,955 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:59:33,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:59:33,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1588085580, now seen corresponding path program 5 times [2018-11-23 08:59:33,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:59:33,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:59:33,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:59:33,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:59:33,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:59:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:59:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 08:59:34,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:59:34,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:59:34,183 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 08:59:34,207 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 08:59:34,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:59:34,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:59:34,297 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 [2018-11-23 08:59:34,299 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 [2018-11-23 08:59:34,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:34,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:34,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:34,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-11-23 08:59:34,387 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 46 treesize of output 37 [2018-11-23 08:59:34,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:34,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 37 treesize of output 37 [2018-11-23 08:59:34,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:34,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:34,397 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. [2018-11-23 08:59:34,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:30 [2018-11-23 08:59:34,670 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 32 treesize of output 24 [2018-11-23 08:59:34,671 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:59:34,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:34,672 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:59:34,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-11-23 08:59:34,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:34,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:34,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:34,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-11-23 08:59:34,716 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 08:59:34,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:59:34,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 37 [2018-11-23 08:59:34,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 08:59:34,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 08:59:34,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1216, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 08:59:34,732 INFO L87 Difference]: Start difference. First operand 235 states and 278 transitions. Second operand 37 states. [2018-11-23 08:59:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:59:49,922 INFO L93 Difference]: Finished difference Result 356 states and 416 transitions. [2018-11-23 08:59:49,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 08:59:49,922 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 47 [2018-11-23 08:59:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:59:49,923 INFO L225 Difference]: With dead ends: 356 [2018-11-23 08:59:49,923 INFO L226 Difference]: Without dead ends: 354 [2018-11-23 08:59:49,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=277, Invalid=2585, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 08:59:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-23 08:59:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 300. [2018-11-23 08:59:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-23 08:59:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 350 transitions. [2018-11-23 08:59:49,987 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 350 transitions. Word has length 47 [2018-11-23 08:59:49,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:59:49,987 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 350 transitions. [2018-11-23 08:59:49,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 08:59:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 350 transitions. [2018-11-23 08:59:49,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 08:59:49,988 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:59:49,988 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:59:49,989 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:59:49,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:59:49,989 INFO L82 PathProgramCache]: Analyzing trace with hash -681197923, now seen corresponding path program 2 times [2018-11-23 08:59:49,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:59:49,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:59:49,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:59:49,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:59:49,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:59:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:59:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 08:59:50,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:59:50,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:59:50,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 08:59:50,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:59:50,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:59:50,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:59:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 08:59:50,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:59:50,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 08:59:50,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 08:59:50,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 08:59:50,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 08:59:50,075 INFO L87 Difference]: Start difference. First operand 300 states and 350 transitions. Second operand 6 states. [2018-11-23 08:59:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:59:50,189 INFO L93 Difference]: Finished difference Result 384 states and 449 transitions. [2018-11-23 08:59:50,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 08:59:50,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-23 08:59:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:59:50,190 INFO L225 Difference]: With dead ends: 384 [2018-11-23 08:59:50,191 INFO L226 Difference]: Without dead ends: 298 [2018-11-23 08:59:50,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 08:59:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-11-23 08:59:50,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 249. [2018-11-23 08:59:50,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-23 08:59:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 286 transitions. [2018-11-23 08:59:50,244 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 286 transitions. Word has length 47 [2018-11-23 08:59:50,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:59:50,244 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 286 transitions. [2018-11-23 08:59:50,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 08:59:50,245 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 286 transitions. [2018-11-23 08:59:50,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 08:59:50,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:59:50,245 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:59:50,246 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:59:50,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:59:50,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1128146500, now seen corresponding path program 2 times [2018-11-23 08:59:50,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:59:50,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:59:50,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:59:50,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:59:50,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:59:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:59:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:59:51,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:59:51,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:59:51,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 08:59:51,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 08:59:51,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:59:51,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:59:51,247 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 38 treesize of output 31 [2018-11-23 08:59:51,249 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:59:51,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 71 [2018-11-23 08:59:51,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:51,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:51,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:51,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-11-23 08:59:51,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-11-23 08:59:51,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2018-11-23 08:59:51,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:51,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:51,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:51,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-11-23 08:59:51,428 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 42 treesize of output 33 [2018-11-23 08:59:51,430 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:59:51,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 95 [2018-11-23 08:59:51,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:51,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:51,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:51,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-11-23 08:59:51,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,585 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 66 [2018-11-23 08:59:51,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,590 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:59:51,591 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,592 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:59:51,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 148 [2018-11-23 08:59:51,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:51,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:51,610 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. [2018-11-23 08:59:51,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:57 [2018-11-23 08:59:51,739 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 59 treesize of output 48 [2018-11-23 08:59:51,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 144 [2018-11-23 08:59:51,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 08:59:51,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 08:59:51,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-23 08:59:51,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:102 [2018-11-23 08:59:51,962 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 28 treesize of output 20 [2018-11-23 08:59:51,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:51,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 08:59:51,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:51,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:51,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:51,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-23 08:59:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:59:52,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:59:52,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 49 [2018-11-23 08:59:52,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 08:59:52,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 08:59:52,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2123, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 08:59:52,034 INFO L87 Difference]: Start difference. First operand 249 states and 286 transitions. Second operand 49 states. [2018-11-23 08:59:53,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:59:53,262 INFO L93 Difference]: Finished difference Result 273 states and 310 transitions. [2018-11-23 08:59:53,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 08:59:53,263 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-11-23 08:59:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:59:53,263 INFO L225 Difference]: With dead ends: 273 [2018-11-23 08:59:53,264 INFO L226 Difference]: Without dead ends: 256 [2018-11-23 08:59:53,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1854 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=470, Invalid=4500, Unknown=0, NotChecked=0, Total=4970 [2018-11-23 08:59:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-23 08:59:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 219. [2018-11-23 08:59:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-23 08:59:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 252 transitions. [2018-11-23 08:59:53,311 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 252 transitions. Word has length 48 [2018-11-23 08:59:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:59:53,311 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 252 transitions. [2018-11-23 08:59:53,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 08:59:53,311 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2018-11-23 08:59:53,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 08:59:53,312 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:59:53,312 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:59:53,312 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:59:53,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:59:53,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1834674623, now seen corresponding path program 1 times [2018-11-23 08:59:53,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:59:53,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:59:53,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:59:53,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:59:53,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:59:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:59:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:59:53,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:59:53,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:59:53,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:59:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:59:53,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:59:53,783 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 38 treesize of output 31 [2018-11-23 08:59:53,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:53,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 47 [2018-11-23 08:59:53,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:53,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:53,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:53,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-23 08:59:53,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:53,897 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-11-23 08:59:53,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:53,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-23 08:59:53,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:53,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:53,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 08:59:53,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:33 [2018-11-23 08:59:54,089 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 28 [2018-11-23 08:59:54,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:54,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:54,094 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:59:54,095 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:59:54,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:54,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-11-23 08:59:54,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:54,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:54,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:54,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:5 [2018-11-23 08:59:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:59:54,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:59:54,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 38 [2018-11-23 08:59:54,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 08:59:54,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 08:59:54,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 08:59:54,173 INFO L87 Difference]: Start difference. First operand 219 states and 252 transitions. Second operand 38 states. [2018-11-23 08:59:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:59:56,329 INFO L93 Difference]: Finished difference Result 330 states and 378 transitions. [2018-11-23 08:59:56,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-11-23 08:59:56,329 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 49 [2018-11-23 08:59:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:59:56,330 INFO L225 Difference]: With dead ends: 330 [2018-11-23 08:59:56,330 INFO L226 Difference]: Without dead ends: 328 [2018-11-23 08:59:56,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3063 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=824, Invalid=9076, Unknown=0, NotChecked=0, Total=9900 [2018-11-23 08:59:56,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-23 08:59:56,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 217. [2018-11-23 08:59:56,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-23 08:59:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 251 transitions. [2018-11-23 08:59:56,386 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 251 transitions. Word has length 49 [2018-11-23 08:59:56,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:59:56,386 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 251 transitions. [2018-11-23 08:59:56,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 08:59:56,386 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 251 transitions. [2018-11-23 08:59:56,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 08:59:56,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:59:56,386 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:59:56,387 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:59:56,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:59:56,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1831939583, now seen corresponding path program 3 times [2018-11-23 08:59:56,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 08:59:56,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 08:59:56,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:59:56,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:59:56,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:59:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:59:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:59:57,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:59:57,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 08:59:57,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 08:59:57,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 08:59:57,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:59:57,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:59:57,318 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 28 treesize of output 23 [2018-11-23 08:59:57,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:57,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 37 [2018-11-23 08:59:57,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:57,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:57,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:57,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-23 08:59:57,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 40 treesize of output 31 [2018-11-23 08:59:57,365 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:59:57,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:57,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:57,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:57,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 77 [2018-11-23 08:59:57,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:57,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:57,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:57,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:46 [2018-11-23 08:59:57,467 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 61 treesize of output 48 [2018-11-23 08:59:57,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:57,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:57,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:57,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:57,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:57,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 120 [2018-11-23 08:59:57,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 08:59:57,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 08:59:57,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 08:59:57,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:130 [2018-11-23 08:59:57,762 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 53 treesize of output 42 [2018-11-23 08:59:57,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:57,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:57,765 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 08:59:57,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:57,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 84 [2018-11-23 08:59:57,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:57,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:57,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:57,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:30 [2018-11-23 08:59:57,838 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 36 treesize of output 29 [2018-11-23 08:59:57,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:57,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:57,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 08:59:57,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 70 [2018-11-23 08:59:57,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:57,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:57,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:57,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:23 [2018-11-23 08:59:57,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 26 treesize of output 18 [2018-11-23 08:59:57,974 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 08:59:57,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 08:59:57,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:57,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 08:59:57,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 08:59:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:59:58,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 08:59:58,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 46 [2018-11-23 08:59:58,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 08:59:58,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 08:59:58,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1868, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 08:59:58,041 INFO L87 Difference]: Start difference. First operand 217 states and 251 transitions. Second operand 46 states. [2018-11-23 09:00:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:00:15,607 INFO L93 Difference]: Finished difference Result 375 states and 424 transitions. [2018-11-23 09:00:15,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 09:00:15,608 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 49 [2018-11-23 09:00:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:00:15,609 INFO L225 Difference]: With dead ends: 375 [2018-11-23 09:00:15,609 INFO L226 Difference]: Without dead ends: 373 [2018-11-23 09:00:15,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2083 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=598, Invalid=5564, Unknown=0, NotChecked=0, Total=6162 [2018-11-23 09:00:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-11-23 09:00:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 227. [2018-11-23 09:00:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-23 09:00:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 262 transitions. [2018-11-23 09:00:15,683 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 262 transitions. Word has length 49 [2018-11-23 09:00:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:00:15,683 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 262 transitions. [2018-11-23 09:00:15,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 09:00:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 262 transitions. [2018-11-23 09:00:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 09:00:15,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:00:15,684 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:00:15,684 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:00:15,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:00:15,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1264339310, now seen corresponding path program 2 times [2018-11-23 09:00:15,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:00:15,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:00:15,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:00:15,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:00:15,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:00:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:00:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:00:16,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:00:16,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:00:16,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 09:00:16,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:00:16,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:00:16,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:00:16,212 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 28 treesize of output 23 [2018-11-23 09:00:16,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:00:16,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 37 [2018-11-23 09:00:16,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:00:16,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:00:16,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:00:16,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-23 09:00:16,285 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 31 treesize of output 24 [2018-11-23 09:00:16,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:00:16,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:00:16,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:00:16,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2018-11-23 09:00:16,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:00:16,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:00:16,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:00:16,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2018-11-23 09:00:16,363 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 29 treesize of output 22 [2018-11-23 09:00:16,364 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:00:16,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:00:16,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:00:16,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 49 [2018-11-23 09:00:16,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:00:16,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:00:16,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:00:16,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-11-23 09:00:16,530 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 26 treesize of output 18 [2018-11-23 09:00:16,531 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 09:00:16,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:00:16,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:00:16,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:00:16,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 09:00:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:00:16,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:00:16,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2018-11-23 09:00:16,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 09:00:16,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 09:00:16,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1409, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 09:00:16,588 INFO L87 Difference]: Start difference. First operand 227 states and 262 transitions. Second operand 40 states. [2018-11-23 09:00:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:00:40,301 INFO L93 Difference]: Finished difference Result 490 states and 571 transitions. [2018-11-23 09:00:40,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-23 09:00:40,302 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 50 [2018-11-23 09:00:40,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:00:40,303 INFO L225 Difference]: With dead ends: 490 [2018-11-23 09:00:40,303 INFO L226 Difference]: Without dead ends: 452 [2018-11-23 09:00:40,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2334 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=876, Invalid=6606, Unknown=0, NotChecked=0, Total=7482 [2018-11-23 09:00:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-11-23 09:00:40,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 278. [2018-11-23 09:00:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-11-23 09:00:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 323 transitions. [2018-11-23 09:00:40,382 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 323 transitions. Word has length 50 [2018-11-23 09:00:40,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:00:40,382 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 323 transitions. [2018-11-23 09:00:40,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 09:00:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 323 transitions. [2018-11-23 09:00:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 09:00:40,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:00:40,383 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:00:40,383 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:00:40,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:00:40,383 INFO L82 PathProgramCache]: Analyzing trace with hash -891213096, now seen corresponding path program 3 times [2018-11-23 09:00:40,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:00:40,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:00:40,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:00:40,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:00:40,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:00:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:00:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:00:40,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:00:40,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:00:40,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 09:00:40,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 09:00:40,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:00:40,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:00:40,815 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 28 treesize of output 23 [2018-11-23 09:00:40,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:00:40,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 37 [2018-11-23 09:00:40,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:00:40,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:00:40,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:00:40,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-11-23 09:00:40,912 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 46 treesize of output 37 [2018-11-23 09:00:40,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:00:40,914 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:00:40,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:00:40,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2018-11-23 09:00:40,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:00:40,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:00:40,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:00:40,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:30 [2018-11-23 09:00:41,080 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 32 treesize of output 24 [2018-11-23 09:00:41,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:00:41,082 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:00:41,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:00:41,083 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:00:41,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 38 [2018-11-23 09:00:41,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:00:41,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:00:41,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:00:41,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-11-23 09:00:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:00:41,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:00:41,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-11-23 09:00:41,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 09:00:41,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 09:00:41,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 09:00:41,146 INFO L87 Difference]: Start difference. First operand 278 states and 323 transitions. Second operand 36 states. [2018-11-23 09:01:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:01:06,054 INFO L93 Difference]: Finished difference Result 404 states and 470 transitions. [2018-11-23 09:01:06,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 09:01:06,054 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 50 [2018-11-23 09:01:06,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:01:06,055 INFO L225 Difference]: With dead ends: 404 [2018-11-23 09:01:06,056 INFO L226 Difference]: Without dead ends: 402 [2018-11-23 09:01:06,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=518, Invalid=3904, Unknown=0, NotChecked=0, Total=4422 [2018-11-23 09:01:06,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-23 09:01:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 297. [2018-11-23 09:01:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-23 09:01:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 347 transitions. [2018-11-23 09:01:06,131 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 347 transitions. Word has length 50 [2018-11-23 09:01:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:01:06,132 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 347 transitions. [2018-11-23 09:01:06,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 09:01:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 347 transitions. [2018-11-23 09:01:06,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 09:01:06,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:01:06,133 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:01:06,133 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:01:06,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:01:06,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1007295364, now seen corresponding path program 4 times [2018-11-23 09:01:06,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:01:06,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:01:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:01:06,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:01:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:01:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:01:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:01:06,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:01:06,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:01:06,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:01:06,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:01:06,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:01:06,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:01:06,436 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 23 treesize of output 18 [2018-11-23 09:01:06,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:06,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 27 [2018-11-23 09:01:06,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:01:06,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:06,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:06,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-23 09:01:06,614 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 26 treesize of output 18 [2018-11-23 09:01:06,616 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 09:01:06,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:01:06,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:06,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:06,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 09:01:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:01:06,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:01:06,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-11-23 09:01:06,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 09:01:06,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 09:01:06,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2018-11-23 09:01:06,664 INFO L87 Difference]: Start difference. First operand 297 states and 347 transitions. Second operand 30 states. [2018-11-23 09:01:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:01:27,387 INFO L93 Difference]: Finished difference Result 388 states and 451 transitions. [2018-11-23 09:01:27,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 09:01:27,387 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 52 [2018-11-23 09:01:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:01:27,388 INFO L225 Difference]: With dead ends: 388 [2018-11-23 09:01:27,388 INFO L226 Difference]: Without dead ends: 386 [2018-11-23 09:01:27,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=1847, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 09:01:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-11-23 09:01:27,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 303. [2018-11-23 09:01:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-23 09:01:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 355 transitions. [2018-11-23 09:01:27,517 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 355 transitions. Word has length 52 [2018-11-23 09:01:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:01:27,518 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 355 transitions. [2018-11-23 09:01:27,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 09:01:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 355 transitions. [2018-11-23 09:01:27,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 09:01:27,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:01:27,523 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:01:27,523 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:01:27,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:01:27,523 INFO L82 PathProgramCache]: Analyzing trace with hash 745072839, now seen corresponding path program 6 times [2018-11-23 09:01:27,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:01:27,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:01:27,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:01:27,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:01:27,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:01:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:01:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:01:28,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:01:28,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:01:28,059 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 09:01:28,084 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 09:01:28,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:01:28,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:01:28,126 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 [2018-11-23 09:01:28,128 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 [2018-11-23 09:01:28,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:01:28,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:28,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:28,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-23 09:01:28,211 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 28 treesize of output 23 [2018-11-23 09:01:28,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:28,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 37 [2018-11-23 09:01:28,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:01:28,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:28,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:28,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-23 09:01:28,286 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 32 treesize of output 25 [2018-11-23 09:01:28,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:28,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:28,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:28,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-23 09:01:28,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:01:28,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:28,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:28,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-23 09:01:28,525 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 26 treesize of output 18 [2018-11-23 09:01:28,527 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 09:01:28,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:01:28,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:28,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:28,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 09:01:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:01:28,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:01:28,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2018-11-23 09:01:28,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 09:01:28,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 09:01:28,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 09:01:28,581 INFO L87 Difference]: Start difference. First operand 303 states and 355 transitions. Second operand 39 states. [2018-11-23 09:01:49,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:01:49,477 INFO L93 Difference]: Finished difference Result 419 states and 482 transitions. [2018-11-23 09:01:49,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 09:01:49,477 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 53 [2018-11-23 09:01:49,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:01:49,478 INFO L225 Difference]: With dead ends: 419 [2018-11-23 09:01:49,478 INFO L226 Difference]: Without dead ends: 417 [2018-11-23 09:01:49,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=424, Invalid=3358, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 09:01:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-11-23 09:01:49,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 305. [2018-11-23 09:01:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-23 09:01:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 354 transitions. [2018-11-23 09:01:49,651 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 354 transitions. Word has length 53 [2018-11-23 09:01:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:01:49,652 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 354 transitions. [2018-11-23 09:01:49,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 09:01:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 354 transitions. [2018-11-23 09:01:49,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 09:01:49,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:01:49,653 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:01:49,653 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:01:49,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:01:49,653 INFO L82 PathProgramCache]: Analyzing trace with hash -175042453, now seen corresponding path program 7 times [2018-11-23 09:01:49,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:01:49,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:01:49,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:01:49,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:01:49,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:01:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:01:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 09:01:49,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:01:49,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:01:49,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:01:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:01:49,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:01:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 09:01:49,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:01:49,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-11-23 09:01:49,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 09:01:49,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 09:01:49,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-23 09:01:49,935 INFO L87 Difference]: Start difference. First operand 305 states and 354 transitions. Second operand 15 states. [2018-11-23 09:01:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:01:50,189 INFO L93 Difference]: Finished difference Result 434 states and 507 transitions. [2018-11-23 09:01:50,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 09:01:50,189 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-11-23 09:01:50,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:01:50,190 INFO L225 Difference]: With dead ends: 434 [2018-11-23 09:01:50,190 INFO L226 Difference]: Without dead ends: 365 [2018-11-23 09:01:50,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-11-23 09:01:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-11-23 09:01:50,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 300. [2018-11-23 09:01:50,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-23 09:01:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 348 transitions. [2018-11-23 09:01:50,290 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 348 transitions. Word has length 55 [2018-11-23 09:01:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:01:50,290 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 348 transitions. [2018-11-23 09:01:50,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 09:01:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 348 transitions. [2018-11-23 09:01:50,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 09:01:50,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:01:50,291 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:01:50,292 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:01:50,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:01:50,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1983848057, now seen corresponding path program 1 times [2018-11-23 09:01:50,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:01:50,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:01:50,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:01:50,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:01:50,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:01:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:01:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:01:51,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:01:51,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:01:51,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:01:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:01:51,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:01:51,137 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 28 treesize of output 23 [2018-11-23 09:01:51,139 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 37 [2018-11-23 09:01:51,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:01:51,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:51,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:51,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-23 09:01:51,184 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 33 treesize of output 26 [2018-11-23 09:01:51,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 61 [2018-11-23 09:01:51,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:01:51,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:51,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:51,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2018-11-23 09:01:51,292 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 56 treesize of output 45 [2018-11-23 09:01:51,305 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 09:01:51,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:01:51,306 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:01:51,307 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,307 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 98 [2018-11-23 09:01:51,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 09:01:51,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:51,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:51,322 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:64, output treesize:44 [2018-11-23 09:01:51,437 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 53 treesize of output 40 [2018-11-23 09:01:51,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,440 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:01:51,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,442 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:01:51,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 98 [2018-11-23 09:01:51,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:01:51,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:51,460 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. [2018-11-23 09:01:51,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:47 [2018-11-23 09:01:51,580 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 54 treesize of output 43 [2018-11-23 09:01:51,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:01:51,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 117 [2018-11-23 09:01:51,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 09:01:51,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 09:01:51,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 09:01:51,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:79 [2018-11-23 09:01:51,783 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 26 treesize of output 18 [2018-11-23 09:01:51,785 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 09:01:51,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:01:51,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:51,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:01:51,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 09:01:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 9 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:01:51,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:01:51,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 45 [2018-11-23 09:01:51,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 09:01:51,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 09:01:51,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1775, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 09:01:51,853 INFO L87 Difference]: Start difference. First operand 300 states and 348 transitions. Second operand 45 states. [2018-11-23 09:02:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:02:10,864 INFO L93 Difference]: Finished difference Result 533 states and 619 transitions. [2018-11-23 09:02:10,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-23 09:02:10,864 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 54 [2018-11-23 09:02:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:02:10,865 INFO L225 Difference]: With dead ends: 533 [2018-11-23 09:02:10,865 INFO L226 Difference]: Without dead ends: 531 [2018-11-23 09:02:10,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 30 SyntacticMatches, 11 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3250 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1035, Invalid=9267, Unknown=0, NotChecked=0, Total=10302 [2018-11-23 09:02:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-11-23 09:02:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 398. [2018-11-23 09:02:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-11-23 09:02:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 458 transitions. [2018-11-23 09:02:11,026 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 458 transitions. Word has length 54 [2018-11-23 09:02:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:02:11,026 INFO L480 AbstractCegarLoop]: Abstraction has 398 states and 458 transitions. [2018-11-23 09:02:11,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 09:02:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 458 transitions. [2018-11-23 09:02:11,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 09:02:11,027 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:02:11,027 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:02:11,027 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:02:11,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:02:11,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2098824215, now seen corresponding path program 4 times [2018-11-23 09:02:11,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:02:11,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:02:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:02:11,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:02:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:02:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:02:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:02:12,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:02:12,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:02:12,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:02:12,133 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:02:12,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:02:12,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:02:12,256 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 38 treesize of output 31 [2018-11-23 09:02:12,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 47 [2018-11-23 09:02:12,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:12,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:12,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:12,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-11-23 09:02:12,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,423 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-11-23 09:02:12,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-23 09:02:12,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:12,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:12,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:02:12,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:41 [2018-11-23 09:02:12,459 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 42 treesize of output 33 [2018-11-23 09:02:12,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 91 [2018-11-23 09:02:12,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-23 09:02:12,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 09:02:12,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 09:02:12,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:137 [2018-11-23 09:02:12,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,773 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 67 [2018-11-23 09:02:12,775 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,777 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:02:12,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,779 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:02:12,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 132 [2018-11-23 09:02:12,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:12,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:12,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:12,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:58 [2018-11-23 09:02:12,887 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 59 treesize of output 48 [2018-11-23 09:02:12,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:12,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 144 [2018-11-23 09:02:12,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 09:02:12,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 09:02:12,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 09:02:12,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:99 [2018-11-23 09:02:13,055 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 38 treesize of output 31 [2018-11-23 09:02:13,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:13,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:13,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:13,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:13,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 75 [2018-11-23 09:02:13,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:13,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:13,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:13,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:23 [2018-11-23 09:02:13,254 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 28 treesize of output 20 [2018-11-23 09:02:13,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:13,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 09:02:13,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:13,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:13,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:13,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-23 09:02:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 5 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:02:13,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:02:13,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 51 [2018-11-23 09:02:13,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 09:02:13,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 09:02:13,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2333, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 09:02:13,345 INFO L87 Difference]: Start difference. First operand 398 states and 458 transitions. Second operand 51 states. [2018-11-23 09:02:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:02:14,969 INFO L93 Difference]: Finished difference Result 427 states and 490 transitions. [2018-11-23 09:02:14,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 09:02:14,969 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 54 [2018-11-23 09:02:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:02:14,970 INFO L225 Difference]: With dead ends: 427 [2018-11-23 09:02:14,970 INFO L226 Difference]: Without dead ends: 410 [2018-11-23 09:02:14,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 25 SyntacticMatches, 15 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2195 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=441, Invalid=4961, Unknown=0, NotChecked=0, Total=5402 [2018-11-23 09:02:14,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-11-23 09:02:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 387. [2018-11-23 09:02:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-11-23 09:02:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 446 transitions. [2018-11-23 09:02:15,165 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 446 transitions. Word has length 54 [2018-11-23 09:02:15,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:02:15,166 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 446 transitions. [2018-11-23 09:02:15,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 09:02:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 446 transitions. [2018-11-23 09:02:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 09:02:15,167 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:02:15,168 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:02:15,168 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:02:15,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:02:15,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2049125808, now seen corresponding path program 5 times [2018-11-23 09:02:15,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:02:15,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:02:15,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:02:15,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:02:15,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:02:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:02:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 1 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:02:15,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:02:15,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:02:15,405 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 09:02:15,452 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 09:02:15,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:02:15,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:02:15,548 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 [2018-11-23 09:02:15,549 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 [2018-11-23 09:02:15,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:15,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:15,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:15,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-11-23 09:02:15,622 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 [2018-11-23 09:02:15,624 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 [2018-11-23 09:02:15,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:15,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:15,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:15,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:10 [2018-11-23 09:02:15,682 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:02:15,683 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 23 treesize of output 34 [2018-11-23 09:02:15,686 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:02:15,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-11-23 09:02:15,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:15,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:15,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:15,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:10 [2018-11-23 09:02:15,842 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 28 treesize of output 23 [2018-11-23 09:02:15,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:15,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 37 [2018-11-23 09:02:15,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:15,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:15,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:02:15,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-23 09:02:16,113 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 32 treesize of output 24 [2018-11-23 09:02:16,115 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:02:16,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:16,116 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:02:16,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 40 [2018-11-23 09:02:16,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:16,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:16,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:16,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-11-23 09:02:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:02:16,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:02:16,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 41 [2018-11-23 09:02:16,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 09:02:16,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 09:02:16,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1513, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 09:02:16,183 INFO L87 Difference]: Start difference. First operand 387 states and 446 transitions. Second operand 41 states. [2018-11-23 09:02:45,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:02:45,719 INFO L93 Difference]: Finished difference Result 815 states and 956 transitions. [2018-11-23 09:02:45,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-23 09:02:45,719 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 55 [2018-11-23 09:02:45,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:02:45,720 INFO L225 Difference]: With dead ends: 815 [2018-11-23 09:02:45,720 INFO L226 Difference]: Without dead ends: 760 [2018-11-23 09:02:45,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2966 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=746, Invalid=8760, Unknown=0, NotChecked=0, Total=9506 [2018-11-23 09:02:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-11-23 09:02:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 447. [2018-11-23 09:02:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-11-23 09:02:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 523 transitions. [2018-11-23 09:02:45,895 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 523 transitions. Word has length 55 [2018-11-23 09:02:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:02:45,895 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 523 transitions. [2018-11-23 09:02:45,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 09:02:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 523 transitions. [2018-11-23 09:02:45,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 09:02:45,897 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:02:45,897 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:02:45,897 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:02:45,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:02:45,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1811316562, now seen corresponding path program 2 times [2018-11-23 09:02:45,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:02:45,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:02:45,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:02:45,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:02:45,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:02:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:02:46,322 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 1 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:02:46,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:02:46,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:02:46,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 09:02:46,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:02:46,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:02:46,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:02:46,528 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 38 treesize of output 31 [2018-11-23 09:02:46,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:46,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 47 [2018-11-23 09:02:46,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:46,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:46,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:46,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-11-23 09:02:46,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:46,720 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-23 09:02:46,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:46,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:46,724 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:02:46,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 73 [2018-11-23 09:02:46,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:46,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:46,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 09:02:46,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:43 [2018-11-23 09:02:46,843 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 40 treesize of output 33 [2018-11-23 09:02:46,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:46,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:46,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:46,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:46,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 100 [2018-11-23 09:02:46,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:46,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:46,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 09:02:46,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:38 [2018-11-23 09:02:47,117 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 28 [2018-11-23 09:02:47,120 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:47,120 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:02:47,121 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:47,122 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:02:47,123 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:47,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-11-23 09:02:47,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:47,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:47,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:47,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:5 [2018-11-23 09:02:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:02:47,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:02:47,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26] total 44 [2018-11-23 09:02:47,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 09:02:47,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 09:02:47,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1717, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 09:02:47,209 INFO L87 Difference]: Start difference. First operand 447 states and 523 transitions. Second operand 44 states. [2018-11-23 09:02:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:02:48,775 INFO L93 Difference]: Finished difference Result 538 states and 625 transitions. [2018-11-23 09:02:48,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 09:02:48,775 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 55 [2018-11-23 09:02:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:02:48,777 INFO L225 Difference]: With dead ends: 538 [2018-11-23 09:02:48,777 INFO L226 Difference]: Without dead ends: 536 [2018-11-23 09:02:48,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=405, Invalid=3501, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 09:02:48,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-23 09:02:48,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 474. [2018-11-23 09:02:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-11-23 09:02:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 553 transitions. [2018-11-23 09:02:48,966 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 553 transitions. Word has length 55 [2018-11-23 09:02:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:02:48,966 INFO L480 AbstractCegarLoop]: Abstraction has 474 states and 553 transitions. [2018-11-23 09:02:48,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 09:02:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 553 transitions. [2018-11-23 09:02:48,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 09:02:48,967 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:02:48,968 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:02:48,968 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:02:48,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:02:48,968 INFO L82 PathProgramCache]: Analyzing trace with hash -797020350, now seen corresponding path program 3 times [2018-11-23 09:02:48,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:02:48,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:02:48,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:02:48,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:02:48,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:02:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:02:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:02:49,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:02:49,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c48acdfe-f46a-4124-918f-83aeeb16ee2d/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:02:49,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 09:02:49,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 09:02:49,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:02:49,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:02:49,794 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 38 treesize of output 31 [2018-11-23 09:02:49,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:49,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 47 [2018-11-23 09:02:49,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:49,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:49,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:49,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-11-23 09:02:49,969 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:49,969 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-11-23 09:02:49,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:49,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:49,974 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:02:49,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 72 [2018-11-23 09:02:49,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:49,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:49,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:49,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-23 09:02:50,087 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 34 treesize of output 27 [2018-11-23 09:02:50,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:50,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:50,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:50,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:50,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-23 09:02:50,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:50,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:50,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:50,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:24 [2018-11-23 09:02:50,226 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 34 treesize of output 27 [2018-11-23 09:02:50,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:50,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:50,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:50,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:50,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-23 09:02:50,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:50,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:50,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:50,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2018-11-23 09:02:50,462 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 28 treesize of output 20 [2018-11-23 09:02:50,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:02:50,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 09:02:50,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:02:50,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:50,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:02:50,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-23 09:02:50,567 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 1 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:02:50,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:02:50,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 47 [2018-11-23 09:02:50,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 09:02:50,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 09:02:50,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1957, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 09:02:50,588 INFO L87 Difference]: Start difference. First operand 474 states and 553 transitions. Second operand 47 states. [2018-11-23 09:02:51,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:02:51,889 INFO L93 Difference]: Finished difference Result 623 states and 722 transitions. [2018-11-23 09:02:51,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 09:02:51,890 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 55 [2018-11-23 09:02:51,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:02:51,892 INFO L225 Difference]: With dead ends: 623 [2018-11-23 09:02:51,892 INFO L226 Difference]: Without dead ends: 585 [2018-11-23 09:02:51,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=466, Invalid=3824, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 09:02:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-11-23 09:02:52,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 490. [2018-11-23 09:02:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-11-23 09:02:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 573 transitions. [2018-11-23 09:02:52,047 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 573 transitions. Word has length 55 [2018-11-23 09:02:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:02:52,047 INFO L480 AbstractCegarLoop]: Abstraction has 490 states and 573 transitions. [2018-11-23 09:02:52,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 09:02:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 573 transitions. [2018-11-23 09:02:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 09:02:52,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:02:52,049 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:02:52,049 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:02:52,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:02:52,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1963459190, now seen corresponding path program 4 times [2018-11-23 09:02:52,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:02:52,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:02:52,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:02:52,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:02:52,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:02:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:02:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:02:52,109 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=4294967303, |#NULL.offset|=4294967301, |old(#NULL.base)|=4294967303, |old(#NULL.offset)|=4294967301] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4294967303, |old(#NULL.offset)|=4294967301] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4294967303, |old(#NULL.offset)|=4294967301] [?] RET #76#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 1; VAL [main_~j~0=1, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; VAL [main_~i~0=0, main_~j~0=1, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~short4 := ~i~0 >= 0; VAL [main_~i~0=0, main_~j~0=1, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short4|=true, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; VAL [main_~i~0=0, main_~j~0=1, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=(- 7), |main_#t~short4|=false, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !#t~short4;havoc #t~mem3;havoc #t~short4; VAL [main_~i~0=0, main_~j~0=1, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [main_~i~0=0, main_~j~0=1, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=0, main_~j~0=2, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; VAL [main_~i~0=1, main_~j~0=2, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~short4 := ~i~0 >= 0; VAL [main_~i~0=1, main_~j~0=2, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short4|=true, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; VAL [main_~i~0=1, main_~j~0=2, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=0, |main_#t~short4|=false, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !#t~short4;havoc #t~mem3;havoc #t~short4; VAL [main_~i~0=1, main_~j~0=2, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [main_~i~0=1, main_~j~0=2, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=1, main_~j~0=3, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; VAL [main_~i~0=2, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~short4 := ~i~0 >= 0; VAL [main_~i~0=2, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short4|=true, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; VAL [main_~i~0=2, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=0, |main_#t~short4|=true, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !!#t~short4;havoc #t~mem3;havoc #t~short4; VAL [main_~i~0=2, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !(~i~0 < 2); VAL [main_~i~0=2, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] ~i~0 := ~i~0 - 1; VAL [main_~i~0=1, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~short4 := ~i~0 >= 0; VAL [main_~i~0=1, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short4|=true, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; VAL [main_~i~0=1, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=0, |main_#t~short4|=true, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !!#t~short4;havoc #t~mem3;havoc #t~short4; VAL [main_~i~0=1, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume ~i~0 < 2;call #t~mem5 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem5; VAL [main_~i~0=1, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] ~i~0 := ~i~0 - 1; VAL [main_~i~0=0, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~short4 := ~i~0 >= 0; VAL [main_~i~0=0, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short4|=true, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; VAL [main_~i~0=0, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=(- 7), |main_#t~short4|=false, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !#t~short4;havoc #t~mem3;havoc #t~short4; VAL [main_~i~0=0, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [main_~i~0=0, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] ~k~0 := 1; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=1, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=1, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=(- 7), |main_#t~mem8|=(- 3), |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] RET #80#return; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=1, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=(- 7), |main_#t~mem8|=(- 3), |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] havoc #t~mem8;havoc #t~mem7; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=1, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=2, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=2, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=(- 3), |main_#t~mem8|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] RET #80#return; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=2, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=(- 3), |main_#t~mem8|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] havoc #t~mem8;havoc #t~mem7; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=2, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=3, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=3, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_#t~mem8|=(- 3), |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4294967303, #NULL.offset=4294967301, old(#NULL.base)=4294967303, old(#NULL.offset)=4294967301] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967303, old(#NULL.offset)=4294967301] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967303, old(#NULL.offset)=4294967301] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L11] ~SIZE~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~i~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L12] havoc ~key~0; [L13] call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L14] ~j~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~j~0=1, ~SIZE~0=4294967300] [L14-L23] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L15] call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=-7, #t~short4=false, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] assume !#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L22] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L15] call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, #t~short4=false, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] assume !#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L22] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L15] call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] assume !!#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18-L19] assume !(~i~0 < 2); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] assume !!#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18-L19] assume ~i~0 < 2; [L19] call #t~mem5 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L19] call write~int(#t~mem5, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); [L19] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=-7, #t~short4=false, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] assume !#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L22] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L14-L23] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L24] ~k~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24-L25] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296); [L25] call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4); [L25] call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24-L25] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296); [L25] call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4); [L25] call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L24-L25] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296); [L25] call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4); [L25] call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=-3, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4294967303, #NULL.offset=4294967301, old(#NULL.base)=4294967303, old(#NULL.offset)=4294967301] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967303, old(#NULL.offset)=4294967301] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967303, old(#NULL.offset)=4294967301] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L11] ~SIZE~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~i~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L12] havoc ~key~0; [L13] call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L14] ~j~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~j~0=1, ~SIZE~0=4294967300] [L14-L23] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L15] call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=-7, #t~short4=false, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] assume !#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L22] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L15] call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, #t~short4=false, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] assume !#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L22] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L15] call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] assume !!#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18-L19] assume !(~i~0 < 2); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] assume !!#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18-L19] assume ~i~0 < 2; [L19] call #t~mem5 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L19] call write~int(#t~mem5, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); [L19] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=-7, #t~short4=false, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] assume !#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L22] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L14-L23] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L24] ~k~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24-L25] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296); [L25] call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4); [L25] call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24-L25] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296); [L25] call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4); [L25] call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L24-L25] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296); [L25] call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4); [L25] call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=-3, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967303, #NULL!offset=4294967301, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L11] ~SIZE~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~i~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L12] havoc ~key~0; [L13] FCALL call ~#v~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L14] ~j~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~j~0=1, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND FALSE !(~i~0 < 2) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND TRUE ~i~0 < 2 [L19] FCALL call #t~mem5 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L19] FCALL call write~int(#t~mem5, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); [L19] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L14-L23] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L24] ~k~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967303, #NULL!offset=4294967301, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L11] ~SIZE~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~i~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L12] havoc ~key~0; [L13] FCALL call ~#v~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L14] ~j~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~j~0=1, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND FALSE !(~i~0 < 2) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND TRUE ~i~0 < 2 [L19] FCALL call #t~mem5 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L19] FCALL call write~int(#t~mem5, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); [L19] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L14-L23] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L24] ~k~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967303, #NULL!offset=4294967301, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L11] ~SIZE~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~i~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L12] havoc ~key~0; [L13] FCALL call ~#v~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L14] ~j~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~j~0=1, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND FALSE !(~i~0 < 2) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND TRUE ~i~0 < 2 [L19] FCALL call #t~mem5 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L19] FCALL call write~int(#t~mem5, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); [L19] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L14-L23] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L24] ~k~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967303, #NULL!offset=4294967301, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L11] ~SIZE~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~i~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L12] havoc ~key~0; [L13] FCALL call ~#v~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L14] ~j~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~j~0=1, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND FALSE !(~i~0 < 2) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND TRUE ~i~0 < 2 [L19] FCALL call #t~mem5 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L19] FCALL call write~int(#t~mem5, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); [L19] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L14-L23] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L24] ~k~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L11] unsigned int SIZE=__VERIFIER_nondet_uint(); [L12] int i, j, k, key; [L13] int v[SIZE]; [L14] j=1 VAL [j=1, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=1, k=0, SIZE=4, v={4294967302:0}, v[i]=-7] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=0, j=1, k=0, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=0, j=2, k=0, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=1, j=2, k=0, SIZE=4, v={4294967302:0}, v[i]=0] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=1, j=2, k=0, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=1, j=3, k=0, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=2, j=3, k=-3, SIZE=4, v={4294967302:0}, v[i]=0] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) VAL [i=2, j=3, k=-3, SIZE=4, v={4294967302:0}] [L20] i = i - 1 VAL [i=1, j=3, k=-3, SIZE=4, v={4294967302:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=1, j=3, k=-3, SIZE=4, v={4294967302:0}, v[i]=0] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR v[i] [L19] v[i+1] = v[i] [L20] i = i - 1 VAL [i=0, j=3, k=-3, SIZE=4, v={4294967302:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=3, k=-3, SIZE=4, v={4294967302:0}, v[i]=-7] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=0, j=3, k=-3, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=0, j=4, k=-3, SIZE=4, v={4294967302:0}] [L14] COND FALSE !(j= 0; VAL [main_~i~0=0, main_~j~0=1, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short4|=true, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; VAL [main_~i~0=0, main_~j~0=1, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=(- 7), |main_#t~short4|=false, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !#t~short4;havoc #t~mem3;havoc #t~short4; VAL [main_~i~0=0, main_~j~0=1, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [main_~i~0=0, main_~j~0=1, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=0, main_~j~0=2, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; VAL [main_~i~0=1, main_~j~0=2, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~short4 := ~i~0 >= 0; VAL [main_~i~0=1, main_~j~0=2, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short4|=true, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; VAL [main_~i~0=1, main_~j~0=2, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=0, |main_#t~short4|=false, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !#t~short4;havoc #t~mem3;havoc #t~short4; VAL [main_~i~0=1, main_~j~0=2, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [main_~i~0=1, main_~j~0=2, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=1, main_~j~0=3, main_~key~0=0, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~j~0 - 1; VAL [main_~i~0=2, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~short4 := ~i~0 >= 0; VAL [main_~i~0=2, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short4|=true, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; VAL [main_~i~0=2, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=0, |main_#t~short4|=true, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !!#t~short4;havoc #t~mem3;havoc #t~short4; VAL [main_~i~0=2, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !(~i~0 < 2); VAL [main_~i~0=2, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] ~i~0 := ~i~0 - 1; VAL [main_~i~0=1, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~short4 := ~i~0 >= 0; VAL [main_~i~0=1, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short4|=true, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; VAL [main_~i~0=1, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=0, |main_#t~short4|=true, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !!#t~short4;havoc #t~mem3;havoc #t~short4; VAL [main_~i~0=1, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume ~i~0 < 2;call #t~mem5 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem5; VAL [main_~i~0=1, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] ~i~0 := ~i~0 - 1; VAL [main_~i~0=0, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~short4 := ~i~0 >= 0; VAL [main_~i~0=0, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short4|=true, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume #t~short4;call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short4 := #t~mem3 > ~key~0; VAL [main_~i~0=0, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=(- 7), |main_#t~short4|=false, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !#t~short4;havoc #t~mem3;havoc #t~short4; VAL [main_~i~0=0, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [main_~i~0=0, main_~j~0=3, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] ~k~0 := 1; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=1, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=1, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=(- 7), |main_#t~mem8|=(- 3), |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] RET #80#return; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=1, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=(- 7), |main_#t~mem8|=(- 3), |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] havoc #t~mem8;havoc #t~mem7; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=1, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=2, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=2, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=(- 3), |main_#t~mem8|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=1] [?] RET #80#return; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=2, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=(- 3), |main_#t~mem8|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] havoc #t~mem8;havoc #t~mem7; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=2, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=3, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [main_~i~0=0, main_~j~0=4, main_~key~0=(- 3), main_~k~0=3, main_~SIZE~0=4294967300, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7|=0, |main_#t~mem8|=(- 3), |main_~#v~0.base|=4294967302, |main_~#v~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4294967303, #NULL.offset=4294967301, old(#NULL.base)=4294967303, old(#NULL.offset)=4294967301] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967303, old(#NULL.offset)=4294967301] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967303, old(#NULL.offset)=4294967301] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L11] ~SIZE~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~i~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L12] havoc ~key~0; [L13] call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L14] ~j~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~j~0=1, ~SIZE~0=4294967300] [L14-L23] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L15] call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=-7, #t~short4=false, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] assume !#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L22] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L15] call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, #t~short4=false, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] assume !#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L22] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L15] call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] assume !!#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18-L19] assume !(~i~0 < 2); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] assume !!#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18-L19] assume ~i~0 < 2; [L19] call #t~mem5 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L19] call write~int(#t~mem5, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); [L19] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=-7, #t~short4=false, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] assume !#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L22] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L14-L23] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L24] ~k~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24-L25] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296); [L25] call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4); [L25] call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24-L25] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296); [L25] call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4); [L25] call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L24-L25] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296); [L25] call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4); [L25] call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=-3, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4294967303, #NULL.offset=4294967301, old(#NULL.base)=4294967303, old(#NULL.offset)=4294967301] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967303, old(#NULL.offset)=4294967301] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967303, old(#NULL.offset)=4294967301] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L11] ~SIZE~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~i~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L12] havoc ~key~0; [L13] call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L14] ~j~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~j~0=1, ~SIZE~0=4294967300] [L14-L23] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L15] call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=-7, #t~short4=false, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] assume !#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L22] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L15] call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, #t~short4=false, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] assume !#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L22] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L15] call #t~mem2 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] assume !!#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18-L19] assume !(~i~0 < 2); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] assume !!#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18-L19] assume ~i~0 < 2; [L19] call #t~mem5 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L19] call write~int(#t~mem5, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); [L19] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] assume #t~short4; [L17] call #t~mem3 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=-7, #t~short4=false, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] assume !#t~short4; [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L22] call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L14-L23] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L24] ~k~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24-L25] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296); [L25] call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4); [L25] call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24-L25] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296); [L25] call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4); [L25] call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L4-L6] assume !(0 == ~cond); VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L3-L8] ensures true; VAL [#in~cond=1, #NULL.base=0, #NULL.offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL.base=0, #NULL.offset=0, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L24-L25] assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296); [L25] call #t~mem7 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4); [L25] call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=-3, ~#v~0.base=4294967302, ~#v~0.offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967303, #NULL!offset=4294967301, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L11] ~SIZE~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~i~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L12] havoc ~key~0; [L13] FCALL call ~#v~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L14] ~j~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~j~0=1, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND FALSE !(~i~0 < 2) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND TRUE ~i~0 < 2 [L19] FCALL call #t~mem5 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L19] FCALL call write~int(#t~mem5, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); [L19] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L14-L23] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L24] ~k~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967303, #NULL!offset=4294967301, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L11] ~SIZE~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~i~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L12] havoc ~key~0; [L13] FCALL call ~#v~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L14] ~j~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~j~0=1, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND FALSE !(~i~0 < 2) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND TRUE ~i~0 < 2 [L19] FCALL call #t~mem5 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L19] FCALL call write~int(#t~mem5, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); [L19] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L14-L23] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L24] ~k~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967303, #NULL!offset=4294967301, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L11] ~SIZE~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~i~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L12] havoc ~key~0; [L13] FCALL call ~#v~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L14] ~j~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~j~0=1, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND FALSE !(~i~0 < 2) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND TRUE ~i~0 < 2 [L19] FCALL call #t~mem5 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L19] FCALL call write~int(#t~mem5, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); [L19] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L14-L23] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L24] ~k~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967303, #NULL!offset=4294967301, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967303, old(#NULL!offset)=4294967301] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L11] ~SIZE~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12] havoc ~i~0; [L12] havoc ~j~0; [L12] havoc ~k~0; [L12] havoc ~key~0; [L13] FCALL call ~#v~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L14] ~j~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~j~0=1, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=1, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=2, ~key~0=0, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=0, ~SIZE~0=4294967300] [L14-L23] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L15] FCALL call #t~mem2 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~j~0 }, 4); [L15] ~key~0 := #t~mem2; [L15] havoc #t~mem2; [L16] ~i~0 := ~j~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND FALSE !(~i~0 < 2) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=2, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND FALSE !(!#t~short4) [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L18] COND TRUE ~i~0 < 2 [L19] FCALL call #t~mem5 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L19] FCALL call write~int(#t~mem5, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); [L19] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=1, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L20] ~i~0 := ~i~0 - 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] #t~short4 := ~i~0 >= 0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 > ~key~0; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=-7, #t~short4=false, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L17-L21] COND TRUE !#t~short4 [L17] havoc #t~mem3; [L17] havoc #t~short4; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L22] FCALL call write~int(~key~0, { base: ~#v~0!base, offset: ~#v~0!offset + 4 * (1 + ~i~0) }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=3, ~key~0=-3, ~SIZE~0=4294967300] [L14] #t~post1 := ~j~0; [L14] ~j~0 := 1 + #t~post1; [L14] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L14-L23] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~SIZE~0=4294967300] [L24] ~k~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-7, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=1, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L4] COND FALSE !(0 == ~cond) VAL [#in~cond=1, #NULL!base=0, #NULL!offset=0, ~cond=1] [L25] RET call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=-3, #t~mem8=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L25] havoc #t~mem8; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=2, ~SIZE~0=4294967300] [L24] #t~post6 := ~k~0; [L24] ~k~0 := 1 + #t~post6; [L24] havoc #t~post6; VAL [#NULL!base=0, #NULL!offset=0, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L24-L25] COND FALSE !(!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L25] FCALL call #t~mem7 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * (~k~0 - 1) }, 4); [L25] FCALL call #t~mem8 := read~int({ base: ~#v~0!base, offset: ~#v~0!offset + 4 * ~k~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=-3, ~#v~0!base=4294967302, ~#v~0!offset=0, ~i~0=0, ~j~0=4, ~key~0=-3, ~k~0=3, ~SIZE~0=4294967300] [L25] CALL call __VERIFIER_assert((if #t~mem7 <= #t~mem8 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L11] unsigned int SIZE=__VERIFIER_nondet_uint(); [L12] int i, j, k, key; [L13] int v[SIZE]; [L14] j=1 VAL [j=1, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=1, k=0, SIZE=4, v={4294967302:0}, v[i]=-7] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=0, j=1, k=0, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=0, j=2, k=0, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=1, j=2, k=0, SIZE=4, v={4294967302:0}, v[i]=0] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=1, j=2, k=0, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=1, j=3, k=0, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=2, j=3, k=-3, SIZE=4, v={4294967302:0}, v[i]=0] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) VAL [i=2, j=3, k=-3, SIZE=4, v={4294967302:0}] [L20] i = i - 1 VAL [i=1, j=3, k=-3, SIZE=4, v={4294967302:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=1, j=3, k=-3, SIZE=4, v={4294967302:0}, v[i]=0] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR v[i] [L19] v[i+1] = v[i] [L20] i = i - 1 VAL [i=0, j=3, k=-3, SIZE=4, v={4294967302:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=3, k=-3, SIZE=4, v={4294967302:0}, v[i]=-7] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=0, j=3, k=-3, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=0, j=4, k=-3, SIZE=4, v={4294967302:0}] [L14] COND FALSE !(j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=1, k=0, SIZE=4, v={4294967302:0}, v[i]=-7] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=0, j=1, k=0, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=0, j=2, k=0, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=1, j=2, k=0, SIZE=4, v={4294967302:0}, v[i]=0] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=1, j=2, k=0, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=1, j=3, k=0, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=2, j=3, k=-3, SIZE=4, v={4294967302:0}, v[i]=0] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) VAL [i=2, j=3, k=-3, SIZE=4, v={4294967302:0}] [L20] i = i - 1 VAL [i=1, j=3, k=-3, SIZE=4, v={4294967302:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=1, j=3, k=-3, SIZE=4, v={4294967302:0}, v[i]=0] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR v[i] [L19] v[i+1] = v[i] [L20] i = i - 1 VAL [i=0, j=3, k=-3, SIZE=4, v={4294967302:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=3, k=-3, SIZE=4, v={4294967302:0}, v[i]=-7] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=0, j=3, k=-3, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=0, j=4, k=-3, SIZE=4, v={4294967302:0}] [L14] COND FALSE !(j