./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c --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_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 308e43cca528a064aecd41d099b341627e43bb71 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:06:42,055 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:06:42,056 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:06:42,064 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:06:42,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:06:42,065 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:06:42,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:06:42,068 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:06:42,069 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:06:42,069 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:06:42,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:06:42,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:06:42,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:06:42,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:06:42,072 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:06:42,073 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:06:42,074 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:06:42,075 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:06:42,076 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:06:42,078 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:06:42,078 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:06:42,079 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:06:42,081 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:06:42,081 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:06:42,081 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:06:42,082 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:06:42,083 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:06:42,083 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:06:42,084 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:06:42,084 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:06:42,084 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:06:42,085 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:06:42,085 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:06:42,085 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:06:42,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:06:42,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:06:42,086 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 22:06:42,094 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:06:42,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:06:42,095 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:06:42,095 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:06:42,095 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 22:06:42,095 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 22:06:42,096 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 22:06:42,096 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 22:06:42,096 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 22:06:42,096 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 22:06:42,096 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 22:06:42,096 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 22:06:42,096 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 22:06:42,097 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:06:42,097 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:06:42,097 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:06:42,097 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:06:42,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:06:42,098 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:06:42,098 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:06:42,098 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:06:42,098 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:06:42,098 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:06:42,098 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:06:42,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:06:42,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:06:42,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:06:42,099 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:06:42,099 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:06:42,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:06:42,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:06:42,100 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:06:42,100 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:06:42,100 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 22:06:42,100 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:06:42,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 22:06:42,100 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 22:06:42,100 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 308e43cca528a064aecd41d099b341627e43bb71 [2018-11-22 22:06:42,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:06:42,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:06:42,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:06:42,138 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:06:42,138 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:06:42,138 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c [2018-11-22 22:06:42,181 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/data/33459167d/a4aefadfa62745d0b4edf65491644cbc/FLAG1435b4e8b [2018-11-22 22:06:42,526 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:06:42,526 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/sv-benchmarks/c/ldv-regression/test23_true-unreach-call.c [2018-11-22 22:06:42,532 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/data/33459167d/a4aefadfa62745d0b4edf65491644cbc/FLAG1435b4e8b [2018-11-22 22:06:42,948 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/data/33459167d/a4aefadfa62745d0b4edf65491644cbc [2018-11-22 22:06:42,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:06:42,952 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:06:42,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:06:42,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:06:42,957 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:06:42,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:06:42" (1/1) ... [2018-11-22 22:06:42,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fb40ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:06:42, skipping insertion in model container [2018-11-22 22:06:42,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:06:42" (1/1) ... [2018-11-22 22:06:42,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:06:42,984 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:06:43,116 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:06:43,129 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:06:43,144 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:06:43,160 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:06:43,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:06:43 WrapperNode [2018-11-22 22:06:43,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:06:43,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:06:43,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:06:43,162 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:06:43,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:06:43" (1/1) ... [2018-11-22 22:06:43,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:06:43" (1/1) ... [2018-11-22 22:06:43,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:06:43,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:06:43,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:06:43,183 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:06:43,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:06:43" (1/1) ... [2018-11-22 22:06:43,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:06:43" (1/1) ... [2018-11-22 22:06:43,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:06:43" (1/1) ... [2018-11-22 22:06:43,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:06:43" (1/1) ... [2018-11-22 22:06:43,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:06:43" (1/1) ... [2018-11-22 22:06:43,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:06:43" (1/1) ... [2018-11-22 22:06:43,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:06:43" (1/1) ... [2018-11-22 22:06:43,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:06:43,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:06:43,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:06:43,255 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:06:43,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:06:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/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-22 22:06:43,299 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-22 22:06:43,299 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-22 22:06:43,300 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:06:43,300 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:06:43,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-22 22:06:43,300 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-22 22:06:43,300 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-22 22:06:43,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:06:43,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:06:43,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:06:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:06:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-22 22:06:43,301 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-22 22:06:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:06:43,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:06:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:06:43,493 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:06:43,493 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 22:06:43,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:06:43 BoogieIcfgContainer [2018-11-22 22:06:43,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:06:43,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:06:43,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:06:43,498 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:06:43,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:06:42" (1/3) ... [2018-11-22 22:06:43,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76720ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:06:43, skipping insertion in model container [2018-11-22 22:06:43,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:06:43" (2/3) ... [2018-11-22 22:06:43,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76720ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:06:43, skipping insertion in model container [2018-11-22 22:06:43,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:06:43" (3/3) ... [2018-11-22 22:06:43,503 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_true-unreach-call.c [2018-11-22 22:06:43,512 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:06:43,522 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 22:06:43,538 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 22:06:43,568 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:06:43,569 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:06:43,569 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:06:43,569 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:06:43,569 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:06:43,569 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:06:43,569 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:06:43,570 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:06:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-22 22:06:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 22:06:43,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:06:43,593 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, 1, 1, 1] [2018-11-22 22:06:43,595 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:06:43,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:06:43,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1787337799, now seen corresponding path program 1 times [2018-11-22 22:06:43,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:06:43,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:06:43,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:06:43,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:06:43,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:06:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:06:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 22:06:43,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:06:43,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:06:43,761 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:06:43,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 22:06:43,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 22:06:43,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 22:06:43,775 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-22 22:06:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:06:43,789 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-22 22:06:43,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 22:06:43,791 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-22 22:06:43,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:06:43,797 INFO L225 Difference]: With dead ends: 46 [2018-11-22 22:06:43,797 INFO L226 Difference]: Without dead ends: 28 [2018-11-22 22:06:43,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 22:06:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-22 22:06:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-22 22:06:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-22 22:06:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-22 22:06:43,831 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 30 [2018-11-22 22:06:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:06:43,832 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-22 22:06:43,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 22:06:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-22 22:06:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-22 22:06:43,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:06:43,834 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, 1, 1, 1, 1] [2018-11-22 22:06:43,835 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:06:43,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:06:43,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1425990092, now seen corresponding path program 1 times [2018-11-22 22:06:43,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:06:43,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:06:43,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:06:43,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:06:43,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:06:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:06:44,550 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 27 [2018-11-22 22:06:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 22:06:44,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:06:44,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-22 22:06:44,652 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:06:44,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 22:06:44,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:06:44,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:06:44,654 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2018-11-22 22:06:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:06:45,078 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-22 22:06:45,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 22:06:45,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-22 22:06:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:06:45,081 INFO L225 Difference]: With dead ends: 54 [2018-11-22 22:06:45,081 INFO L226 Difference]: Without dead ends: 46 [2018-11-22 22:06:45,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-22 22:06:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-22 22:06:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2018-11-22 22:06:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-22 22:06:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-22 22:06:45,092 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 31 [2018-11-22 22:06:45,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:06:45,092 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-22 22:06:45,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 22:06:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-22 22:06:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-22 22:06:45,093 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:06:45,094 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:06:45,094 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:06:45,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:06:45,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1848691918, now seen corresponding path program 1 times [2018-11-22 22:06:45,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:06:45,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:06:45,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:06:45,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:06:45,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:06:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:06:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:06:45,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:06:45,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:06:45,172 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-22 22:06:45,173 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [6], [8], [10], [11], [17], [19], [22], [27], [30], [37], [40], [47], [50], [51], [52], [53], [54], [56], [57], [58], [59], [60], [61], [62], [63] [2018-11-22 22:06:45,198 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 22:06:45,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 22:06:45,349 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 22:06:45,350 INFO L272 AbstractInterpreter]: Visited 29 different actions 35 times. Merged at 1 different actions 2 times. Never widened. Performed 325 root evaluator evaluations with a maximum evaluation depth of 5. Performed 325 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 1 different actions. Largest state had 33 variables. [2018-11-22 22:06:45,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:06:45,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 22:06:45,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:06:45,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/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-22 22:06:45,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:06:45,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 22:06:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:06:45,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:06:45,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-22 22:06:45,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-22 22:06:45,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:06:45,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:06:45,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:06:45,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-22 22:06:45,500 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-22 22:06:45,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:06:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:06:45,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:06:45,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2018-11-22 22:06:45,565 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:06:45,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-22 22:06:45,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 22:06:45,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-22 22:06:45,566 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 13 states. [2018-11-22 22:06:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:06:45,723 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-11-22 22:06:45,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 22:06:45,724 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-22 22:06:45,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:06:45,724 INFO L225 Difference]: With dead ends: 56 [2018-11-22 22:06:45,725 INFO L226 Difference]: Without dead ends: 44 [2018-11-22 22:06:45,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-11-22 22:06:45,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-22 22:06:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-11-22 22:06:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-22 22:06:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-22 22:06:45,734 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2018-11-22 22:06:45,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:06:45,734 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-22 22:06:45,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-22 22:06:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-22 22:06:45,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-22 22:06:45,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:06:45,735 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, 1, 1, 1, 1] [2018-11-22 22:06:45,735 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:06:45,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:06:45,735 INFO L82 PathProgramCache]: Analyzing trace with hash 568828240, now seen corresponding path program 1 times [2018-11-22 22:06:45,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:06:45,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:06:45,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:06:45,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:06:45,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:06:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:06:46,204 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 31 [2018-11-22 22:06:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 22:06:46,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:06:46,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-22 22:06:46,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:06:46,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 22:06:46,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:06:46,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:06:46,253 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 12 states. [2018-11-22 22:06:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:06:46,627 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-22 22:06:46,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 22:06:46,627 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-22 22:06:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:06:46,628 INFO L225 Difference]: With dead ends: 54 [2018-11-22 22:06:46,628 INFO L226 Difference]: Without dead ends: 46 [2018-11-22 22:06:46,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-22 22:06:46,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-22 22:06:46,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-11-22 22:06:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-22 22:06:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-22 22:06:46,633 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 31 [2018-11-22 22:06:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:06:46,633 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-22 22:06:46,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 22:06:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-22 22:06:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-22 22:06:46,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:06:46,634 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:06:46,635 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:06:46,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:06:46,635 INFO L82 PathProgramCache]: Analyzing trace with hash -957154489, now seen corresponding path program 1 times [2018-11-22 22:06:46,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:06:46,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:06:46,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:06:46,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:06:46,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:06:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:06:47,031 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 37 [2018-11-22 22:06:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 22:06:47,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:06:47,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:06:47,195 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-11-22 22:06:47,195 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [6], [10], [11], [17], [19], [22], [27], [30], [32], [37], [40], [47], [50], [51], [52], [53], [54], [56], [57], [58], [59], [60], [61], [62], [63] [2018-11-22 22:06:47,197 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 22:06:47,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 22:06:47,248 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 22:06:47,248 INFO L272 AbstractInterpreter]: Visited 29 different actions 32 times. Never merged. Never widened. Performed 301 root evaluator evaluations with a maximum evaluation depth of 5. Performed 301 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 34 variables. [2018-11-22 22:06:47,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:06:47,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 22:06:47,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:06:47,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/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-22 22:06:47,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:06:47,278 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 22:06:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:06:47,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:06:47,462 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-22 22:06:47,464 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-22 22:06:47,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:06:47,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:06:47,476 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-22 22:06:47,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-11-22 22:06:47,541 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 38 treesize of output 32 [2018-11-22 22:06:47,543 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 22:06:47,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-11-22 22:06:47,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:06:47,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:06:47,563 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-22 22:06:47,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2018-11-22 22:06:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:06:47,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:06:47,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-11-22 22:06:47,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-11-22 22:06:47,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:06:47,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:06:47,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 22:06:47,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:15 [2018-11-22 22:06:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:06:47,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:06:47,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 32 [2018-11-22 22:06:47,895 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:06:47,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-22 22:06:47,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-22 22:06:47,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2018-11-22 22:06:47,896 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 23 states. [2018-11-22 22:06:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:06:48,569 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-22 22:06:48,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-22 22:06:48,569 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-11-22 22:06:48,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:06:48,570 INFO L225 Difference]: With dead ends: 60 [2018-11-22 22:06:48,570 INFO L226 Difference]: Without dead ends: 52 [2018-11-22 22:06:48,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=269, Invalid=1801, Unknown=0, NotChecked=0, Total=2070 [2018-11-22 22:06:48,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-22 22:06:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2018-11-22 22:06:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-22 22:06:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-22 22:06:48,579 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 33 [2018-11-22 22:06:48,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:06:48,580 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-22 22:06:48,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-22 22:06:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-22 22:06:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-22 22:06:48,581 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:06:48,581 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:06:48,581 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:06:48,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:06:48,581 INFO L82 PathProgramCache]: Analyzing trace with hash -55973429, now seen corresponding path program 1 times [2018-11-22 22:06:48,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:06:48,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:06:48,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:06:48,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:06:48,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:06:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:06:49,089 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 30 [2018-11-22 22:06:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 22:06:49,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:06:49,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:06:49,333 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-11-22 22:06:49,333 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [10], [11], [17], [19], [22], [27], [30], [32], [37], [40], [47], [50], [51], [52], [53], [54], [56], [57], [58], [59], [60], [61], [62], [63] [2018-11-22 22:06:49,335 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 22:06:49,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 22:06:49,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 22:06:49,376 INFO L272 AbstractInterpreter]: Visited 29 different actions 32 times. Never merged. Never widened. Performed 301 root evaluator evaluations with a maximum evaluation depth of 5. Performed 301 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 34 variables. [2018-11-22 22:06:49,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:06:49,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 22:06:49,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:06:49,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/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-22 22:06:49,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:06:49,387 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 22:06:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:06:49,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:06:49,513 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-22 22:06:49,514 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-22 22:06:49,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:06:49,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:06:49,524 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-22 22:06:49,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2018-11-22 22:06:49,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-11-22 22:06:49,584 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 22:06:49,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-11-22 22:06:49,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:06:49,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:06:49,595 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-22 22:06:49,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:5 [2018-11-22 22:06:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:06:49,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:06:49,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-11-22 22:06:49,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-11-22 22:06:49,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:06:49,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:06:49,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 22:06:49,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:15 [2018-11-22 22:06:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:06:49,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:06:49,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 32 [2018-11-22 22:06:49,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:06:49,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-22 22:06:49,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-22 22:06:49,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2018-11-22 22:06:49,895 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 23 states. [2018-11-22 22:06:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:06:50,615 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-22 22:06:50,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-22 22:06:50,616 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-11-22 22:06:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:06:50,617 INFO L225 Difference]: With dead ends: 62 [2018-11-22 22:06:50,617 INFO L226 Difference]: Without dead ends: 54 [2018-11-22 22:06:50,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 10 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=269, Invalid=1801, Unknown=0, NotChecked=0, Total=2070 [2018-11-22 22:06:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-22 22:06:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-11-22 22:06:50,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-22 22:06:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-22 22:06:50,626 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 33 [2018-11-22 22:06:50,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:06:50,626 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-22 22:06:50,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-22 22:06:50,626 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-22 22:06:50,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-22 22:06:50,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:06:50,628 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:06:50,628 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:06:50,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:06:50,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1263240701, now seen corresponding path program 2 times [2018-11-22 22:06:50,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:06:50,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:06:50,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:06:50,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:06:50,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:06:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:06:51,142 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 44 [2018-11-22 22:06:51,730 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-22 22:06:51,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:06:51,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:06:51,731 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:06:51,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:06:51,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:06:51,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/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-22 22:06:51,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:06:51,737 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 22:06:51,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-22 22:06:51,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:06:51,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:06:51,992 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-22 22:06:51,994 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-22 22:06:51,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:06:51,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:06:52,001 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-22 22:06:52,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-11-22 22:07:08,870 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-22 22:07:09,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-22 22:07:09,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:07:11,597 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 61 treesize of output 55 [2018-11-22 22:07:11,618 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 22:07:11,618 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 22:07:11,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-11-22 22:07:11,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:07:11,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:07:11,630 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-22 22:07:11,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:24 [2018-11-22 22:07:13,711 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-22 22:07:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-22 22:07:16,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:07:16,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 17] total 53 [2018-11-22 22:07:16,248 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:07:16,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-22 22:07:16,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-22 22:07:16,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2577, Unknown=8, NotChecked=0, Total=2756 [2018-11-22 22:07:16,249 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 38 states. [2018-11-22 22:07:17,408 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 91 [2018-11-22 22:07:17,641 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 88 [2018-11-22 22:07:17,953 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 75 [2018-11-22 22:07:18,229 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 75 [2018-11-22 22:07:23,150 WARN L180 SmtUtils]: Spent 4.21 s on a formula simplification that was a NOOP. DAG size: 48 [2018-11-22 22:07:23,723 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 90 [2018-11-22 22:07:23,939 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 87 [2018-11-22 22:07:24,215 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 71 [2018-11-22 22:07:24,527 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2018-11-22 22:07:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:07:25,551 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-22 22:07:25,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-22 22:07:25,551 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-11-22 22:07:25,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:07:25,552 INFO L225 Difference]: With dead ends: 64 [2018-11-22 22:07:25,552 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 22:07:25,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 33.8s TimeCoverageRelationStatistics Valid=1240, Invalid=8258, Unknown=8, NotChecked=0, Total=9506 [2018-11-22 22:07:25,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 22:07:25,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 22:07:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 22:07:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 22:07:25,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-11-22 22:07:25,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:07:25,554 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:07:25,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-22 22:07:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:07:25,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 22:07:25,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 22:07:26,058 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 59 [2018-11-22 22:07:26,414 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 51 [2018-11-22 22:07:26,416 INFO L448 ceAbstractionStarter]: For program point initEXIT(lines 12 19) no Hoare annotation was computed. [2018-11-22 22:07:26,416 INFO L444 ceAbstractionStarter]: At program point initENTRY(lines 12 19) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= (select (select |old(#memory_int)| |~#d1~0.base|) (+ |~#d1~0.offset| 8)) 0)) (= |#memory_int| |old(#memory_int)|) (< 0 |~#d2~0.offset|) (< |~#d1~0.offset| |~#d2~0.offset|) (< (* 5 |~#d2~0.offset|) |~#d1~0.offset|)) [2018-11-22 22:07:26,416 INFO L448 ceAbstractionStarter]: For program point initFINAL(lines 12 19) no Hoare annotation was computed. [2018-11-22 22:07:26,416 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-22 22:07:26,416 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-22 22:07:26,416 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 22:07:26,416 INFO L448 ceAbstractionStarter]: For program point get_dummyFINAL(lines 21 24) no Hoare annotation was computed. [2018-11-22 22:07:26,417 INFO L451 ceAbstractionStarter]: At program point get_dummyENTRY(lines 21 24) the Hoare annotation is: true [2018-11-22 22:07:26,417 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-22 22:07:26,417 INFO L448 ceAbstractionStarter]: For program point get_dummyEXIT(lines 21 24) no Hoare annotation was computed. [2018-11-22 22:07:26,417 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 22:07:26,417 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (+ (* 3 |~#d2~0.offset|) |~#d1~0.offset|))) (and (= (select (select |#memory_int| |~#d1~0.base|) (+ |~#d1~0.offset| 8)) 0) (not (= |~#d1~0.base| |~#d2~0.base|)) (= 0 |~#d1~0.offset|) (<= .cse0 0) (<= 0 .cse0))) [2018-11-22 22:07:26,417 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 22:07:26,417 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 22:07:26,417 INFO L444 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse1 (+ |~#d1~0.offset| 8))) (let ((.cse0 (select (select |old(#memory_int)| |~#d1~0.base|) .cse1))) (or (= |~#d1~0.base| |~#d2~0.base|) (not (= .cse0 0)) (= .cse0 (select (select |#memory_int| |~#d1~0.base|) .cse1)) (< 0 |~#d2~0.offset|) (< |~#d1~0.offset| |~#d2~0.offset|) (< (* 5 |~#d2~0.offset|) |~#d1~0.offset|)))) [2018-11-22 22:07:26,417 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 31 52) no Hoare annotation was computed. [2018-11-22 22:07:26,418 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2018-11-22 22:07:26,418 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 31 52) no Hoare annotation was computed. [2018-11-22 22:07:26,418 INFO L444 ceAbstractionStarter]: At program point L44(lines 32 52) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= (select (select |old(#memory_int)| |~#d1~0.base|) (+ |~#d1~0.offset| 8)) 0)) (< 0 |~#d2~0.offset|) (< |~#d1~0.offset| |~#d2~0.offset|) (< (* 5 |~#d2~0.offset|) |~#d1~0.offset|)) [2018-11-22 22:07:26,418 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2018-11-22 22:07:26,418 INFO L444 ceAbstractionStarter]: At program point L40-3(lines 40 42) the Hoare annotation is: (let ((.cse3 (+ |~#d1~0.offset| 8))) (let ((.cse0 (select (select |old(#memory_int)| |~#d1~0.base|) .cse3))) (or (= |~#d1~0.base| |~#d2~0.base|) (not (= .cse0 0)) (and (exists ((v_main_~i~0_22 Int)) (let ((.cse2 (* 4 v_main_~i~0_22))) (let ((.cse1 (+ main_~pd2~0.offset .cse2 8))) (and (= v_main_~i~0_22 (select (select |#memory_int| main_~pa~0.base) .cse1)) (<= .cse1 main_~pa~0.offset) (<= main_~pa~0.offset (+ .cse2 8)))))) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (<= main_~pd1~0.offset |~#d1~0.offset|) (<= 0 main_~pd2~0.offset) (= main_~pd2~0.base main_~pa~0.base) (= .cse0 (select (select |#memory_int| |~#d1~0.base|) .cse3))) (not (= 0 |~#d1~0.offset|)) (< (+ (* 3 |~#d2~0.offset|) |~#d1~0.offset|) 0) (< |~#d1~0.offset| |~#d2~0.offset|)))) [2018-11-22 22:07:26,418 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 46) no Hoare annotation was computed. [2018-11-22 22:07:26,418 INFO L444 ceAbstractionStarter]: At program point L40-4(lines 40 42) the Hoare annotation is: (let ((.cse7 (+ |~#d1~0.offset| 8))) (let ((.cse6 (select (select |old(#memory_int)| |~#d1~0.base|) .cse7))) (or (and (exists ((main_~pa~0.offset Int) (v_main_~i~0_22 Int)) (let ((.cse3 (select |#memory_int| main_~pd2~0.base)) (.cse1 (* 4 v_main_~i~0_22))) (let ((.cse0 (+ main_~pd2~0.offset .cse1 8)) (.cse2 (select .cse3 main_~pa~0.offset))) (and (<= .cse0 main_~pa~0.offset) (<= main_~pa~0.offset (+ .cse1 8)) (<= .cse2 main_~i~0) (= v_main_~i~0_22 (select .cse3 .cse0)) (<= main_~i~0 .cse2))))) (exists ((v_main_~i~0_22 Int)) (let ((.cse5 (* 4 v_main_~i~0_22))) (let ((.cse4 (+ main_~pd2~0.offset .cse5 8))) (and (= v_main_~i~0_22 (select (select |#memory_int| main_~pa~0.base) .cse4)) (<= .cse4 main_~pa~0.offset) (<= main_~pa~0.offset (+ .cse5 8)))))) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (<= main_~pd1~0.offset |~#d1~0.offset|) (= main_~pd2~0.base main_~pa~0.base) (<= 0 main_~pd2~0.offset) (= .cse6 (select (select |#memory_int| |~#d1~0.base|) .cse7))) (= |~#d1~0.base| |~#d2~0.base|) (not (= .cse6 0)) (not (= 0 |~#d1~0.offset|)) (< (+ (* 3 |~#d2~0.offset|) |~#d1~0.offset|) 0) (< |~#d1~0.offset| |~#d2~0.offset|)))) [2018-11-22 22:07:26,419 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-22 22:07:26,419 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 46) no Hoare annotation was computed. [2018-11-22 22:07:26,419 INFO L444 ceAbstractionStarter]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse2 (+ |~#d1~0.offset| 8))) (let ((.cse0 (select (select |old(#memory_int)| |~#d1~0.base|) .cse2))) (let ((.cse1 (= .cse0 (select (select |#memory_int| |~#d1~0.base|) .cse2)))) (or (= |~#d1~0.base| |~#d2~0.base|) (not (= .cse0 0)) (and (= |~#d2~0.base| main_~pd1~0.base) (= |~#d2~0.offset| main_~pd1~0.offset) .cse1) (and (< 0 (+ main_~pd1~0.offset 1)) (<= main_~pd1~0.offset 0) (= |~#d1~0.base| main_~pd1~0.base) .cse1) (< 0 |~#d2~0.offset|) (< |~#d1~0.offset| |~#d2~0.offset|) (< (* 5 |~#d2~0.offset|) |~#d1~0.offset|))))) [2018-11-22 22:07:26,419 INFO L448 ceAbstractionStarter]: For program point L34-2(line 34) no Hoare annotation was computed. [2018-11-22 22:07:26,419 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 31 52) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= (select (select |old(#memory_int)| |~#d1~0.base|) (+ |~#d1~0.offset| 8)) 0)) (= |#memory_int| |old(#memory_int)|) (< 0 |~#d2~0.offset|) (< |~#d1~0.offset| |~#d2~0.offset|) (< (* 5 |~#d2~0.offset|) |~#d1~0.offset|)) [2018-11-22 22:07:26,419 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-22 22:07:26,419 INFO L448 ceAbstractionStarter]: For program point L43-1(lines 43 45) no Hoare annotation was computed. [2018-11-22 22:07:26,419 INFO L451 ceAbstractionStarter]: At program point checkENTRY(lines 26 29) the Hoare annotation is: true [2018-11-22 22:07:26,419 INFO L448 ceAbstractionStarter]: For program point checkFINAL(lines 26 29) no Hoare annotation was computed. [2018-11-22 22:07:26,419 INFO L448 ceAbstractionStarter]: For program point checkEXIT(lines 26 29) no Hoare annotation was computed. [2018-11-22 22:07:26,426 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,431 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,435 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,435 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,436 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,436 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,436 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,442 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,442 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,443 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,443 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,443 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:07:26 BoogieIcfgContainer [2018-11-22 22:07:26,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:07:26,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:07:26,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:07:26,447 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:07:26,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:06:43" (3/4) ... [2018-11-22 22:07:26,452 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 22:07:26,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-11-22 22:07:26,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 22:07:26,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2018-11-22 22:07:26,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 22:07:26,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-11-22 22:07:26,461 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2018-11-22 22:07:26,462 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-22 22:07:26,462 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-22 22:07:26,462 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-22 22:07:26,462 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 22:07:26,462 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 22:07:26,488 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((d1 == d2 || !(\old(unknown-#memory_int-unknown)[d1][d1 + 8] == 0)) || ((((((\exists v_main_~i~0_22 : int :: (v_main_~i~0_22 == unknown-#memory_int-unknown[pa][pd2 + 4 * v_main_~i~0_22 + 8] && pd2 + 4 * v_main_~i~0_22 + 8 <= pa) && pa <= 4 * v_main_~i~0_22 + 8) && i <= unknown-#memory_int-unknown[pa][pa]) && pd1 <= d1) && 0 <= pd2) && pd2 == pa) && \old(unknown-#memory_int-unknown)[d1][d1 + 8] == unknown-#memory_int-unknown[d1][d1 + 8])) || !(0 == d1)) || 3 * d2 + d1 < 0) || d1 < d2 [2018-11-22 22:07:26,488 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((d1 == d2 || !(\old(unknown-#memory_int-unknown)[d1][d1 + 8] == 0)) || 0 < d2) || d1 < d2) || 5 * d2 < d1 [2018-11-22 22:07:26,505 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3ec6ed2c-8299-497a-b932-9f929043adb6/bin-2019/utaipan/witness.graphml [2018-11-22 22:07:26,505 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:07:26,507 INFO L168 Benchmark]: Toolchain (without parser) took 43554.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.0 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -46.8 MB). Peak memory consumption was 255.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:07:26,508 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:07:26,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.21 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-22 22:07:26,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.07 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:07:26,509 INFO L168 Benchmark]: Boogie Preprocessor took 71.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:07:26,509 INFO L168 Benchmark]: RCFGBuilder took 239.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-22 22:07:26,509 INFO L168 Benchmark]: TraceAbstraction took 42951.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.3 MB). Peak memory consumption was 267.6 MB. Max. memory is 11.5 GB. [2018-11-22 22:07:26,509 INFO L168 Benchmark]: Witness Printer took 59.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:07:26,511 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 208.21 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.07 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 239.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42951.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.3 MB). Peak memory consumption was 267.6 MB. Max. memory is 11.5 GB. * Witness Printer took 59.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant [2018-11-22 22:07:26,519 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,519 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((d1 == d2 || !(\old(unknown-#memory_int-unknown)[d1][d1 + 8] == 0)) || 0 < d2) || d1 < d2) || 5 * d2 < d1 - InvariantResult [Line: 40]: Loop Invariant [2018-11-22 22:07:26,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,521 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,521 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,521 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,521 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,522 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_22,QUANTIFIED] [2018-11-22 22:07:26,523 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,523 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,523 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,524 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 22:07:26,524 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((d1 == d2 || !(\old(unknown-#memory_int-unknown)[d1][d1 + 8] == 0)) || ((((((\exists v_main_~i~0_22 : int :: (v_main_~i~0_22 == unknown-#memory_int-unknown[pa][pd2 + 4 * v_main_~i~0_22 + 8] && pd2 + 4 * v_main_~i~0_22 + 8 <= pa) && pa <= 4 * v_main_~i~0_22 + 8) && i <= unknown-#memory_int-unknown[pa][pa]) && pd1 <= d1) && 0 <= pd2) && pd2 == pa) && \old(unknown-#memory_int-unknown)[d1][d1 + 8] == unknown-#memory_int-unknown[d1][d1 + 8])) || !(0 == d1)) || 3 * d2 + d1 < 0) || d1 < d2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. SAFE Result, 42.8s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 11.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 201 SDtfs, 373 SDslu, 1269 SDs, 0 SdLazy, 1905 SolverSat, 378 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 464 GetRequests, 196 SyntacticMatches, 29 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2623 ImplicationChecksByTransitivity, 38.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 53 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 23 PreInvPairs, 38 NumberOfFragments, 470 HoareAnnotationTreeSize, 23 FomulaSimplifications, 10138 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 7880 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 29.2s InterpolantComputationTime, 360 NumberOfCodeBlocks, 358 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 479 ConstructedInterpolants, 25 QuantifiedInterpolants, 138739 SizeOfPredicates, 47 NumberOfNonLiveVariables, 923 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 45/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...