./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label44_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label44_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/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 06d11383001c52cfbf19a51eafe2dc3d238c9679 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 00:15:56,342 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 00:15:56,343 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 00:15:56,349 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 00:15:56,349 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 00:15:56,350 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 00:15:56,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 00:15:56,352 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 00:15:56,352 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 00:15:56,353 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 00:15:56,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 00:15:56,354 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 00:15:56,354 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 00:15:56,355 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 00:15:56,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 00:15:56,356 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 00:15:56,356 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 00:15:56,357 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 00:15:56,358 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 00:15:56,359 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 00:15:56,359 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 00:15:56,360 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 00:15:56,361 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 00:15:56,361 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 00:15:56,362 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 00:15:56,362 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 00:15:56,363 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 00:15:56,363 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 00:15:56,363 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 00:15:56,364 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 00:15:56,364 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 00:15:56,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 00:15:56,365 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 00:15:56,365 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 00:15:56,365 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 00:15:56,366 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 00:15:56,366 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 00:15:56,373 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 00:15:56,373 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 00:15:56,374 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 00:15:56,374 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 00:15:56,374 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 00:15:56,374 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 00:15:56,374 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 00:15:56,374 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 00:15:56,374 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 00:15:56,375 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 00:15:56,375 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 00:15:56,375 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 00:15:56,375 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 00:15:56,375 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 00:15:56,375 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 00:15:56,376 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 00:15:56,376 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 00:15:56,376 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 00:15:56,376 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 00:15:56,376 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 00:15:56,376 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 00:15:56,376 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 00:15:56,376 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 00:15:56,377 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 00:15:56,377 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 00:15:56,377 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 00:15:56,377 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 00:15:56,377 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 00:15:56,377 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 00:15:56,377 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 00:15:56,377 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 00:15:56,378 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 00:15:56,378 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 00:15:56,378 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 00:15:56,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 00:15:56,378 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 00:15:56,378 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_3d5bb695-a015-4aa1-8748-1164ea699e39/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 -> 06d11383001c52cfbf19a51eafe2dc3d238c9679 [2018-12-02 00:15:56,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 00:15:56,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 00:15:56,404 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 00:15:56,405 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 00:15:56,405 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 00:15:56,405 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem11_label44_true-unreach-call.c [2018-12-02 00:15:56,439 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/bin-2019/utaipan/data/fba6d2a6d/62f179012b2d4686880d3a3e6fb6925a/FLAG25d465dfd [2018-12-02 00:15:56,906 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 00:15:56,906 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/sv-benchmarks/c/eca-rers2012/Problem11_label44_true-unreach-call.c [2018-12-02 00:15:56,914 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/bin-2019/utaipan/data/fba6d2a6d/62f179012b2d4686880d3a3e6fb6925a/FLAG25d465dfd [2018-12-02 00:15:56,923 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/bin-2019/utaipan/data/fba6d2a6d/62f179012b2d4686880d3a3e6fb6925a [2018-12-02 00:15:56,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 00:15:56,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 00:15:56,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 00:15:56,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 00:15:56,929 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 00:15:56,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:15:56" (1/1) ... [2018-12-02 00:15:56,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d10e54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:56, skipping insertion in model container [2018-12-02 00:15:56,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:15:56" (1/1) ... [2018-12-02 00:15:56,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 00:15:56,968 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 00:15:57,200 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:15:57,202 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 00:15:57,329 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:15:57,339 INFO L195 MainTranslator]: Completed translation [2018-12-02 00:15:57,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:57 WrapperNode [2018-12-02 00:15:57,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 00:15:57,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 00:15:57,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 00:15:57,340 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 00:15:57,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:57" (1/1) ... [2018-12-02 00:15:57,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:57" (1/1) ... [2018-12-02 00:15:57,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 00:15:57,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 00:15:57,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 00:15:57,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 00:15:57,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:57" (1/1) ... [2018-12-02 00:15:57,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:57" (1/1) ... [2018-12-02 00:15:57,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:57" (1/1) ... [2018-12-02 00:15:57,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:57" (1/1) ... [2018-12-02 00:15:57,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:57" (1/1) ... [2018-12-02 00:15:57,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:57" (1/1) ... [2018-12-02 00:15:57,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:57" (1/1) ... [2018-12-02 00:15:57,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 00:15:57,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 00:15:57,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 00:15:57,415 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 00:15:57,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/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-12-02 00:15:57,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 00:15:57,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 00:15:57,449 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-02 00:15:57,449 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-02 00:15:57,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 00:15:57,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 00:15:57,449 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 00:15:57,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 00:15:58,391 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 00:15:58,391 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 00:15:58,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:15:58 BoogieIcfgContainer [2018-12-02 00:15:58,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 00:15:58,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 00:15:58,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 00:15:58,394 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 00:15:58,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:15:56" (1/3) ... [2018-12-02 00:15:58,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185fa3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:15:58, skipping insertion in model container [2018-12-02 00:15:58,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:15:57" (2/3) ... [2018-12-02 00:15:58,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185fa3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:15:58, skipping insertion in model container [2018-12-02 00:15:58,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:15:58" (3/3) ... [2018-12-02 00:15:58,396 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label44_true-unreach-call.c [2018-12-02 00:15:58,402 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 00:15:58,407 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 00:15:58,417 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 00:15:58,439 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 00:15:58,439 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 00:15:58,439 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 00:15:58,439 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 00:15:58,439 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 00:15:58,439 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 00:15:58,439 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 00:15:58,439 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 00:15:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2018-12-02 00:15:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 00:15:58,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:15:58,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:15:58,460 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:15:58,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:15:58,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1276641867, now seen corresponding path program 1 times [2018-12-02 00:15:58,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:15:58,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:15:58,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:15:58,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:15:58,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:15:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:15:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:15:58,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:15:58,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:15:58,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:15:58,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:15:58,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:15:58,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:15:58,638 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2018-12-02 00:15:59,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:15:59,657 INFO L93 Difference]: Finished difference Result 975 states and 1750 transitions. [2018-12-02 00:15:59,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 00:15:59,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-02 00:15:59,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:15:59,673 INFO L225 Difference]: With dead ends: 975 [2018-12-02 00:15:59,673 INFO L226 Difference]: Without dead ends: 616 [2018-12-02 00:15:59,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:15:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-12-02 00:15:59,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 422. [2018-12-02 00:15:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-02 00:15:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 607 transitions. [2018-12-02 00:15:59,721 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 607 transitions. Word has length 32 [2018-12-02 00:15:59,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:15:59,721 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 607 transitions. [2018-12-02 00:15:59,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:15:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 607 transitions. [2018-12-02 00:15:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 00:15:59,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:15:59,724 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:15:59,724 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:15:59,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:15:59,724 INFO L82 PathProgramCache]: Analyzing trace with hash 201462154, now seen corresponding path program 1 times [2018-12-02 00:15:59,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:15:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:15:59,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:15:59,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:15:59,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:15:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:15:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:15:59,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:15:59,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:15:59,828 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:15:59,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:15:59,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:15:59,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:15:59,830 INFO L87 Difference]: Start difference. First operand 422 states and 607 transitions. Second operand 6 states. [2018-12-02 00:16:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:16:00,568 INFO L93 Difference]: Finished difference Result 1241 states and 1811 transitions. [2018-12-02 00:16:00,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 00:16:00,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-02 00:16:00,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:16:00,572 INFO L225 Difference]: With dead ends: 1241 [2018-12-02 00:16:00,572 INFO L226 Difference]: Without dead ends: 825 [2018-12-02 00:16:00,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:16:00,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2018-12-02 00:16:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 814. [2018-12-02 00:16:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2018-12-02 00:16:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1163 transitions. [2018-12-02 00:16:00,599 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1163 transitions. Word has length 104 [2018-12-02 00:16:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:16:00,599 INFO L480 AbstractCegarLoop]: Abstraction has 814 states and 1163 transitions. [2018-12-02 00:16:00,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:16:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1163 transitions. [2018-12-02 00:16:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 00:16:00,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:16:00,601 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:16:00,601 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:16:00,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:16:00,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1596761827, now seen corresponding path program 1 times [2018-12-02 00:16:00,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:16:00,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:16:00,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:16:00,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:16:00,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:16:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:16:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:16:00,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:16:00,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 00:16:00,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:16:00,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:16:00,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:16:00,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:16:00,751 INFO L87 Difference]: Start difference. First operand 814 states and 1163 transitions. Second operand 7 states. [2018-12-02 00:16:01,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:16:01,839 INFO L93 Difference]: Finished difference Result 2084 states and 3017 transitions. [2018-12-02 00:16:01,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 00:16:01,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2018-12-02 00:16:01,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:16:01,846 INFO L225 Difference]: With dead ends: 2084 [2018-12-02 00:16:01,846 INFO L226 Difference]: Without dead ends: 1276 [2018-12-02 00:16:01,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-02 00:16:01,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2018-12-02 00:16:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1213. [2018-12-02 00:16:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2018-12-02 00:16:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1599 transitions. [2018-12-02 00:16:01,884 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1599 transitions. Word has length 105 [2018-12-02 00:16:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:16:01,884 INFO L480 AbstractCegarLoop]: Abstraction has 1213 states and 1599 transitions. [2018-12-02 00:16:01,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:16:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1599 transitions. [2018-12-02 00:16:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-02 00:16:01,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:16:01,886 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:16:01,886 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:16:01,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:16:01,886 INFO L82 PathProgramCache]: Analyzing trace with hash -741406572, now seen corresponding path program 1 times [2018-12-02 00:16:01,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:16:01,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:16:01,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:16:01,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:16:01,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:16:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:16:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:16:02,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:16:02,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:16:02,023 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-12-02 00:16:02,025 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [165], [167], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 00:16:02,059 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:16:02,059 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:16:02,572 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 00:16:02,573 INFO L272 AbstractInterpreter]: Visited 138 different actions 401 times. Merged at 4 different actions 7 times. Never widened. Performed 5613 root evaluator evaluations with a maximum evaluation depth of 9. Performed 5613 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-02 00:16:02,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:16:02,581 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 00:16:02,790 INFO L227 lantSequenceWeakener]: Weakened 160 states. On average, predicates are now at 75.12% of their original sizes. [2018-12-02 00:16:02,790 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 00:16:02,860 INFO L418 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2018-12-02 00:16:02,860 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 00:16:02,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 00:16:02,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2018-12-02 00:16:02,861 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:16:02,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 00:16:02,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 00:16:02,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-02 00:16:02,862 INFO L87 Difference]: Start difference. First operand 1213 states and 1599 transitions. Second operand 12 states. [2018-12-02 00:17:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:17:24,374 INFO L93 Difference]: Finished difference Result 3795 states and 5044 transitions. [2018-12-02 00:17:24,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 00:17:24,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 163 [2018-12-02 00:17:24,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:17:24,380 INFO L225 Difference]: With dead ends: 3795 [2018-12-02 00:17:24,380 INFO L226 Difference]: Without dead ends: 2588 [2018-12-02 00:17:24,381 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 176 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2018-12-02 00:17:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2588 states. [2018-12-02 00:17:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2588 to 2565. [2018-12-02 00:17:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2565 states. [2018-12-02 00:17:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3285 transitions. [2018-12-02 00:17:24,413 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3285 transitions. Word has length 163 [2018-12-02 00:17:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:17:24,414 INFO L480 AbstractCegarLoop]: Abstraction has 2565 states and 3285 transitions. [2018-12-02 00:17:24,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 00:17:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3285 transitions. [2018-12-02 00:17:24,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-12-02 00:17:24,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:17:24,416 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:17:24,416 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:17:24,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:17:24,416 INFO L82 PathProgramCache]: Analyzing trace with hash 478710564, now seen corresponding path program 1 times [2018-12-02 00:17:24,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:17:24,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:17:24,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:17:24,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:17:24,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:17:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:17:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 00:17:24,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:17:24,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:17:24,539 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-12-02 00:17:24,539 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [165], [167], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 00:17:24,542 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:17:24,542 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:17:24,887 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:17:24,887 INFO L272 AbstractInterpreter]: Visited 125 different actions 368 times. Merged at 6 different actions 15 times. Never widened. Performed 4915 root evaluator evaluations with a maximum evaluation depth of 18. Performed 4915 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 3 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-02 00:17:24,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:17:24,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:17:24,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:17:24,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/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-12-02 00:17:24,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:17:24,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:17:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:17:24,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:17:27,041 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 Int)) (let ((.cse1 (* 9 v_prenex_4))) (let ((.cse0 (div .cse1 10))) (and (not (= 0 (mod (+ .cse0 30) 90))) (<= 0 (+ .cse0 58979)) (< (+ .cse0 58980) 0) (<= c_~a23~0 (+ (mod (+ .cse0 29) 90) 48)) (= (mod .cse1 10) 0) (<= |c_old(~a23~0)| v_prenex_4))))) (exists ((v_prenex_15 Int)) (let ((.cse4 (* 9 v_prenex_15))) (let ((.cse3 (div .cse4 10))) (let ((.cse2 (mod (+ .cse3 29) 90))) (and (<= |c_old(~a23~0)| v_prenex_15) (= .cse2 0) (= 0 (mod (+ .cse3 30) 90)) (<= c_~a23~0 (+ .cse2 48)) (= (mod .cse4 10) 0)))))) (exists ((v_prenex_1 Int)) (let ((.cse5 (* 9 v_prenex_1))) (let ((.cse6 (div .cse5 10))) (let ((.cse7 (mod (+ .cse6 29) 90))) (and (<= 0 .cse5) (< (+ .cse6 58979) 0) (<= (+ c_~a23~0 42) .cse7) (<= 0 (+ .cse6 58980)) (not (= .cse7 0)) (<= |c_old(~a23~0)| v_prenex_1)))))) (exists ((v_prenex_23 Int)) (let ((.cse9 (* 9 v_prenex_23))) (let ((.cse8 (div .cse9 10))) (and (<= |c_old(~a23~0)| v_prenex_23) (<= c_~a23~0 (+ (mod (+ .cse8 30) 90) 48)) (< .cse9 0) (not (= (mod .cse9 10) 0)) (= (mod (+ .cse8 29) 90) 0) (<= 0 (+ .cse8 58980)))))) (exists ((v_prenex_8 Int)) (let ((.cse10 (* 9 v_prenex_8))) (let ((.cse11 (div .cse10 10))) (and (<= 0 .cse10) (<= 0 (+ .cse11 58979)) (<= |c_old(~a23~0)| v_prenex_8) (<= c_~a23~0 (+ (mod (+ .cse11 29) 90) 48)) (= 0 (mod (+ .cse11 30) 90)))))) (exists ((v_prenex_16 Int)) (let ((.cse14 (* 9 v_prenex_16))) (let ((.cse13 (div .cse14 10))) (let ((.cse12 (mod (+ .cse13 29) 90))) (and (<= |c_old(~a23~0)| v_prenex_16) (<= (+ c_~a23~0 42) .cse12) (< (+ .cse13 58979) 0) (not (= .cse12 0)) (= 0 (mod (+ .cse13 30) 90)) (<= 0 .cse14)))))) (exists ((v_prenex_14 Int)) (let ((.cse17 (* 9 v_prenex_14))) (let ((.cse16 (div .cse17 10))) (let ((.cse15 (mod (+ .cse16 29) 90))) (and (= .cse15 0) (<= |c_old(~a23~0)| v_prenex_14) (<= c_~a23~0 (+ .cse15 48)) (< (+ .cse16 58980) 0) (not (= 0 (mod (+ .cse16 30) 90))) (<= 0 .cse17)))))) (exists ((v_prenex_7 Int)) (let ((.cse18 (* 9 v_prenex_7))) (let ((.cse19 (div .cse18 10))) (and (<= 0 .cse18) (<= 0 (+ .cse19 58979)) (<= c_~a23~0 (+ (mod (+ .cse19 29) 90) 48)) (<= |c_old(~a23~0)| v_prenex_7) (not (= 0 (mod (+ .cse19 30) 90))) (< (+ .cse19 58980) 0))))) (exists ((v_prenex_3 Int)) (let ((.cse20 (* 9 v_prenex_3))) (let ((.cse22 (div .cse20 10))) (let ((.cse21 (mod (+ .cse22 29) 90))) (and (= (mod .cse20 10) 0) (<= (+ c_~a23~0 42) .cse21) (not (= .cse21 0)) (<= |c_old(~a23~0)| v_prenex_3) (= 0 (mod (+ .cse22 30) 90)) (< (+ .cse22 58979) 0)))))) (exists ((v_prenex_24 Int)) (let ((.cse24 (* 9 v_prenex_24))) (let ((.cse23 (div .cse24 10))) (let ((.cse25 (mod (+ .cse23 30) 90))) (and (not (= (mod (+ .cse23 29) 90) 0)) (<= |c_old(~a23~0)| v_prenex_24) (not (= (mod .cse24 10) 0)) (< (+ .cse23 58979) 0) (< (+ .cse23 58980) 0) (<= (+ c_~a23~0 42) .cse25) (< .cse24 0) (not (= 0 .cse25))))))) (exists ((v_prenex_2 Int)) (let ((.cse27 (* 9 v_prenex_2))) (let ((.cse28 (div .cse27 10))) (let ((.cse26 (mod (+ .cse28 29) 90))) (and (<= c_~a23~0 (+ .cse26 48)) (<= |c_old(~a23~0)| v_prenex_2) (<= 0 .cse27) (= .cse26 0) (= 0 (mod (+ .cse28 30) 90))))))) (exists ((v_prenex_6 Int)) (let ((.cse30 (* 9 v_prenex_6))) (let ((.cse29 (div .cse30 10))) (let ((.cse31 (mod (+ .cse29 30) 90))) (and (< (+ .cse29 58979) 0) (not (= (mod (+ .cse29 29) 90) 0)) (< .cse30 0) (not (= (mod .cse30 10) 0)) (= 0 .cse31) (<= c_~a23~0 (+ .cse31 48)) (<= |c_old(~a23~0)| v_prenex_6)))))) (exists ((v_prenex_17 Int)) (let ((.cse32 (* 9 v_prenex_17))) (let ((.cse34 (div .cse32 10))) (let ((.cse33 (mod (+ .cse34 30) 90))) (and (< .cse32 0) (= 0 .cse33) (<= |c_old(~a23~0)| v_prenex_17) (<= c_~a23~0 (+ .cse33 48)) (= (mod (+ .cse34 29) 90) 0) (not (= (mod .cse32 10) 0))))))) (exists ((v_prenex_20 Int)) (let ((.cse35 (* 9 v_prenex_20))) (let ((.cse36 (div .cse35 10))) (and (not (= (mod .cse35 10) 0)) (<= c_~a23~0 (+ (mod (+ .cse36 30) 90) 48)) (<= |c_old(~a23~0)| v_prenex_20) (<= 0 (+ .cse36 58979)) (<= 0 (+ .cse36 58980)) (< .cse35 0))))) (exists ((v_prenex_22 Int)) (let ((.cse39 (* 9 v_prenex_22))) (let ((.cse38 (div .cse39 10))) (let ((.cse37 (mod (+ .cse38 29) 90))) (and (<= (+ c_~a23~0 42) .cse37) (<= |c_old(~a23~0)| v_prenex_22) (not (= 0 (mod (+ .cse38 30) 90))) (< (+ .cse38 58980) 0) (not (= .cse37 0)) (= (mod .cse39 10) 0) (< (+ .cse38 58979) 0)))))) (exists ((v_prenex_10 Int)) (let ((.cse40 (* 9 v_prenex_10))) (let ((.cse41 (div .cse40 10))) (and (< .cse40 0) (not (= (mod (+ .cse41 29) 90) 0)) (not (= (mod .cse40 10) 0)) (< (+ .cse41 58979) 0) (<= c_~a23~0 (+ (mod (+ .cse41 30) 90) 48)) (<= 0 (+ .cse41 58980)) (<= |c_old(~a23~0)| v_prenex_10))))) (exists ((v_prenex_26 Int)) (let ((.cse43 (* 9 v_prenex_26))) (let ((.cse42 (div .cse43 10))) (and (<= |c_old(~a23~0)| v_prenex_26) (<= 0 (+ .cse42 58980)) (<= 0 (+ .cse42 58979)) (<= c_~a23~0 (+ (mod (+ .cse42 29) 90) 48)) (<= 0 .cse43))))) (exists ((v_prenex_19 Int)) (let ((.cse46 (* 9 v_prenex_19))) (let ((.cse44 (div .cse46 10))) (let ((.cse45 (mod (+ .cse44 29) 90))) (and (<= 0 (+ .cse44 58980)) (< (+ .cse44 58979) 0) (<= (+ c_~a23~0 42) .cse45) (= (mod .cse46 10) 0) (not (= .cse45 0)) (<= |c_old(~a23~0)| v_prenex_19)))))) (exists ((v_prenex_13 Int)) (let ((.cse49 (* 9 v_prenex_13))) (let ((.cse48 (div .cse49 10))) (let ((.cse47 (mod (+ .cse48 29) 90))) (and (= .cse47 0) (<= c_~a23~0 (+ .cse47 48)) (<= |c_old(~a23~0)| v_prenex_13) (<= 0 (+ .cse48 58980)) (<= 0 .cse49)))))) (exists ((v_prenex_9 Int)) (let ((.cse51 (* 9 v_prenex_9))) (let ((.cse50 (div .cse51 10))) (and (<= |c_old(~a23~0)| v_prenex_9) (= 0 (mod (+ .cse50 30) 90)) (<= c_~a23~0 (+ (mod (+ .cse50 29) 90) 48)) (<= 0 (+ .cse50 58979)) (= (mod .cse51 10) 0))))) (exists ((v_prenex_25 Int)) (let ((.cse53 (* 9 v_prenex_25))) (let ((.cse54 (div .cse53 10))) (let ((.cse52 (mod (+ .cse54 29) 90))) (and (= .cse52 0) (= (mod .cse53 10) 0) (<= |c_old(~a23~0)| v_prenex_25) (<= c_~a23~0 (+ .cse52 48)) (not (= 0 (mod (+ .cse54 30) 90))) (< (+ .cse54 58980) 0)))))) (exists ((v_prenex_12 Int)) (let ((.cse56 (* 9 v_prenex_12))) (let ((.cse55 (div .cse56 10))) (and (<= |c_old(~a23~0)| v_prenex_12) (<= 0 (+ .cse55 58980)) (<= c_~a23~0 (+ (mod (+ .cse55 29) 90) 48)) (<= 0 (+ .cse55 58979)) (= (mod .cse56 10) 0))))) (exists ((v_prenex_18 Int)) (let ((.cse57 (* 9 v_prenex_18))) (let ((.cse59 (div .cse57 10))) (let ((.cse58 (mod (+ .cse59 29) 90))) (and (<= 0 .cse57) (not (= .cse58 0)) (< (+ .cse59 58979) 0) (< (+ .cse59 58980) 0) (not (= 0 (mod (+ .cse59 30) 90))) (<= |c_old(~a23~0)| v_prenex_18) (<= (+ c_~a23~0 42) .cse58)))))) (exists ((v_~a23~0_478 Int)) (let ((.cse60 (* 9 v_~a23~0_478))) (let ((.cse62 (div .cse60 10))) (let ((.cse61 (mod (+ .cse62 30) 90))) (and (not (= (mod .cse60 10) 0)) (<= (+ c_~a23~0 42) .cse61) (not (= 0 .cse61)) (< (+ .cse62 58980) 0) (<= 0 (+ .cse62 58979)) (< .cse60 0) (<= |c_old(~a23~0)| v_~a23~0_478)))))) (exists ((v_prenex_21 Int)) (let ((.cse64 (* 9 v_prenex_21))) (let ((.cse65 (div .cse64 10))) (let ((.cse63 (mod (+ .cse65 29) 90))) (and (= .cse63 0) (<= |c_old(~a23~0)| v_prenex_21) (= (mod .cse64 10) 0) (<= c_~a23~0 (+ .cse63 48)) (<= 0 (+ .cse65 58980))))))) (exists ((v_prenex_11 Int)) (let ((.cse68 (* 9 v_prenex_11))) (let ((.cse66 (div .cse68 10))) (let ((.cse67 (mod (+ .cse66 30) 90))) (and (<= 0 (+ .cse66 58979)) (<= c_~a23~0 (+ .cse67 48)) (<= |c_old(~a23~0)| v_prenex_11) (< .cse68 0) (= 0 .cse67) (not (= (mod .cse68 10) 0))))))) (exists ((v_prenex_5 Int)) (let ((.cse71 (* 9 v_prenex_5))) (let ((.cse69 (div .cse71 10))) (let ((.cse70 (mod (+ .cse69 30) 90))) (and (= (mod (+ .cse69 29) 90) 0) (not (= 0 .cse70)) (< (+ .cse69 58980) 0) (<= (+ c_~a23~0 42) .cse70) (not (= (mod .cse71 10) 0)) (<= |c_old(~a23~0)| v_prenex_5) (< .cse71 0))))))) is different from true [2018-12-02 00:17:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 70 trivial. 2 not checked. [2018-12-02 00:17:27,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:17:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 00:17:27,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 00:17:27,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 6] total 9 [2018-12-02 00:17:27,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:17:27,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:17:27,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:17:27,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2018-12-02 00:17:27,418 INFO L87 Difference]: Start difference. First operand 2565 states and 3285 transitions. Second operand 3 states. [2018-12-02 00:17:27,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:17:27,924 INFO L93 Difference]: Finished difference Result 5324 states and 7093 transitions. [2018-12-02 00:17:27,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:17:27,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2018-12-02 00:17:27,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:17:27,931 INFO L225 Difference]: With dead ends: 5324 [2018-12-02 00:17:27,931 INFO L226 Difference]: Without dead ends: 3145 [2018-12-02 00:17:27,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 440 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2018-12-02 00:17:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2018-12-02 00:17:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 2951. [2018-12-02 00:17:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2951 states. [2018-12-02 00:17:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 3838 transitions. [2018-12-02 00:17:27,974 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 3838 transitions. Word has length 221 [2018-12-02 00:17:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:17:27,974 INFO L480 AbstractCegarLoop]: Abstraction has 2951 states and 3838 transitions. [2018-12-02 00:17:27,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:17:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 3838 transitions. [2018-12-02 00:17:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-02 00:17:27,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:17:27,977 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 00:17:27,977 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:17:27,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:17:27,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1533919463, now seen corresponding path program 1 times [2018-12-02 00:17:27,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:17:27,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:17:27,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:17:27,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:17:27,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:17:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:17:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 46 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:17:28,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:17:28,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:17:28,112 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-12-02 00:17:28,112 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [165], [167], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 00:17:28,115 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:17:28,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:17:28,419 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 00:17:28,419 INFO L272 AbstractInterpreter]: Visited 124 different actions 486 times. Merged at 6 different actions 20 times. Never widened. Performed 6730 root evaluator evaluations with a maximum evaluation depth of 16. Performed 6730 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-02 00:17:28,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:17:28,420 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 00:17:28,586 INFO L227 lantSequenceWeakener]: Weakened 231 states. On average, predicates are now at 80.03% of their original sizes. [2018-12-02 00:17:28,586 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 00:17:28,620 INFO L418 sIntCurrentIteration]: We unified 233 AI predicates to 233 [2018-12-02 00:17:28,620 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 00:17:28,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 00:17:28,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-12-02 00:17:28,621 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:17:28,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 00:17:28,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 00:17:28,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 00:17:28,621 INFO L87 Difference]: Start difference. First operand 2951 states and 3838 transitions. Second operand 10 states. [2018-12-02 00:18:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:18:32,953 INFO L93 Difference]: Finished difference Result 6954 states and 9498 transitions. [2018-12-02 00:18:32,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 00:18:32,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 234 [2018-12-02 00:18:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:18:32,966 INFO L225 Difference]: With dead ends: 6954 [2018-12-02 00:18:32,966 INFO L226 Difference]: Without dead ends: 5162 [2018-12-02 00:18:32,969 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 244 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-12-02 00:18:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5162 states. [2018-12-02 00:18:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5162 to 4915. [2018-12-02 00:18:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4915 states. [2018-12-02 00:18:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4915 states to 4915 states and 6524 transitions. [2018-12-02 00:18:33,038 INFO L78 Accepts]: Start accepts. Automaton has 4915 states and 6524 transitions. Word has length 234 [2018-12-02 00:18:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:18:33,039 INFO L480 AbstractCegarLoop]: Abstraction has 4915 states and 6524 transitions. [2018-12-02 00:18:33,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 00:18:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4915 states and 6524 transitions. [2018-12-02 00:18:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-02 00:18:33,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:18:33,041 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:18:33,041 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:18:33,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:18:33,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1505560500, now seen corresponding path program 1 times [2018-12-02 00:18:33,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:18:33,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:18:33,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:18:33,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:18:33,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:18:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:18:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-02 00:18:33,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:18:33,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:18:33,109 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:18:33,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:18:33,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:18:33,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:18:33,110 INFO L87 Difference]: Start difference. First operand 4915 states and 6524 transitions. Second operand 4 states. [2018-12-02 00:18:34,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:18:34,041 INFO L93 Difference]: Finished difference Result 10414 states and 14107 transitions. [2018-12-02 00:18:34,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 00:18:34,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 249 [2018-12-02 00:18:34,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:18:34,053 INFO L225 Difference]: With dead ends: 10414 [2018-12-02 00:18:34,053 INFO L226 Difference]: Without dead ends: 5695 [2018-12-02 00:18:34,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:18:34,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5695 states. [2018-12-02 00:18:34,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5695 to 5114. [2018-12-02 00:18:34,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5114 states. [2018-12-02 00:18:34,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 6760 transitions. [2018-12-02 00:18:34,123 INFO L78 Accepts]: Start accepts. Automaton has 5114 states and 6760 transitions. Word has length 249 [2018-12-02 00:18:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:18:34,124 INFO L480 AbstractCegarLoop]: Abstraction has 5114 states and 6760 transitions. [2018-12-02 00:18:34,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:18:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand 5114 states and 6760 transitions. [2018-12-02 00:18:34,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-12-02 00:18:34,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:18:34,127 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:18:34,127 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:18:34,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:18:34,127 INFO L82 PathProgramCache]: Analyzing trace with hash 920892640, now seen corresponding path program 1 times [2018-12-02 00:18:34,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:18:34,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:18:34,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:18:34,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:18:34,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:18:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:18:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 7 proven. 46 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-02 00:18:34,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:18:34,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:18:34,243 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 276 with the following transitions: [2018-12-02 00:18:34,244 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [165], [167], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [924], [928], [932], [936], [940], [944], [948], [952], [956], [960], [971], [975], [979], [983], [986], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 00:18:34,246 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:18:34,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:18:34,508 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:18:34,508 INFO L272 AbstractInterpreter]: Visited 180 different actions 533 times. Merged at 6 different actions 15 times. Never widened. Performed 7334 root evaluator evaluations with a maximum evaluation depth of 14. Performed 7334 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Found 3 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-02 00:18:34,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:18:34,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:18:34,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:18:34,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/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-12-02 00:18:34,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:18:34,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:18:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:18:34,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:18:39,037 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2018-12-02 00:18:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 7 proven. 46 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-02 00:18:39,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:18:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-02 00:18:39,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 00:18:39,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 6] total 9 [2018-12-02 00:18:39,171 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:18:39,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:18:39,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:18:39,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=47, Unknown=2, NotChecked=0, Total=72 [2018-12-02 00:18:39,172 INFO L87 Difference]: Start difference. First operand 5114 states and 6760 transitions. Second operand 3 states. [2018-12-02 00:18:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:18:39,832 INFO L93 Difference]: Finished difference Result 11733 states and 16177 transitions. [2018-12-02 00:18:39,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:18:39,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2018-12-02 00:18:39,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:18:39,856 INFO L225 Difference]: With dead ends: 11733 [2018-12-02 00:18:39,856 INFO L226 Difference]: Without dead ends: 6817 [2018-12-02 00:18:39,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 549 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=23, Invalid=47, Unknown=2, NotChecked=0, Total=72 [2018-12-02 00:18:39,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6817 states. [2018-12-02 00:18:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6817 to 6437. [2018-12-02 00:18:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6437 states. [2018-12-02 00:18:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6437 states to 6437 states and 8429 transitions. [2018-12-02 00:18:39,942 INFO L78 Accepts]: Start accepts. Automaton has 6437 states and 8429 transitions. Word has length 275 [2018-12-02 00:18:39,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:18:39,942 INFO L480 AbstractCegarLoop]: Abstraction has 6437 states and 8429 transitions. [2018-12-02 00:18:39,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:18:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 6437 states and 8429 transitions. [2018-12-02 00:18:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-12-02 00:18:39,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:18:39,948 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:18:39,948 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:18:39,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:18:39,949 INFO L82 PathProgramCache]: Analyzing trace with hash -813373261, now seen corresponding path program 1 times [2018-12-02 00:18:39,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:18:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:18:39,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:18:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:18:39,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:18:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:18:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 245 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 00:18:40,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:18:40,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:18:40,085 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 318 with the following transitions: [2018-12-02 00:18:40,085 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [165], [167], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [602], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 00:18:40,086 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:18:40,087 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:18:40,433 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:18:40,433 INFO L272 AbstractInterpreter]: Visited 126 different actions 371 times. Merged at 6 different actions 15 times. Never widened. Performed 4924 root evaluator evaluations with a maximum evaluation depth of 18. Performed 4924 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 3 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-02 00:18:40,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:18:40,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:18:40,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:18:40,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/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-12-02 00:18:40,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:18:40,441 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:18:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:18:40,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:18:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 245 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 00:18:40,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:18:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 245 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 00:18:40,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 00:18:40,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-12-02 00:18:40,677 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 00:18:40,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 00:18:40,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 00:18:40,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:18:40,678 INFO L87 Difference]: Start difference. First operand 6437 states and 8429 transitions. Second operand 9 states. [2018-12-02 00:18:42,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:18:42,158 INFO L93 Difference]: Finished difference Result 13449 states and 21487 transitions. [2018-12-02 00:18:42,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 00:18:42,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 317 [2018-12-02 00:18:42,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:18:42,197 INFO L225 Difference]: With dead ends: 13449 [2018-12-02 00:18:42,197 INFO L226 Difference]: Without dead ends: 7974 [2018-12-02 00:18:42,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 639 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2018-12-02 00:18:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2018-12-02 00:18:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7473. [2018-12-02 00:18:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7473 states. [2018-12-02 00:18:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7473 states to 7473 states and 9709 transitions. [2018-12-02 00:18:42,353 INFO L78 Accepts]: Start accepts. Automaton has 7473 states and 9709 transitions. Word has length 317 [2018-12-02 00:18:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:18:42,354 INFO L480 AbstractCegarLoop]: Abstraction has 7473 states and 9709 transitions. [2018-12-02 00:18:42,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 00:18:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 7473 states and 9709 transitions. [2018-12-02 00:18:42,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-12-02 00:18:42,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:18:42,360 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:18:42,360 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:18:42,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:18:42,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1008048846, now seen corresponding path program 1 times [2018-12-02 00:18:42,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:18:42,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:18:42,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:18:42,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:18:42,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:18:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:18:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 246 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-02 00:18:42,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:18:42,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 00:18:42,508 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 319 with the following transitions: [2018-12-02 00:18:42,508 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [165], [167], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [514], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [602], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 00:18:42,509 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 00:18:42,510 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 00:18:42,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 00:18:42,777 INFO L272 AbstractInterpreter]: Visited 126 different actions 369 times. Merged at 6 different actions 13 times. Never widened. Performed 4874 root evaluator evaluations with a maximum evaluation depth of 16. Performed 4874 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-02 00:18:42,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:18:42,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 00:18:42,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:18:42,779 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/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-12-02 00:18:42,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:18:42,784 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 00:18:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:18:42,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:18:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 246 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-02 00:18:42,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 00:18:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 246 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-02 00:18:42,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 00:18:42,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-12-02 00:18:42,967 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 00:18:42,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:18:42,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:18:42,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:18:42,968 INFO L87 Difference]: Start difference. First operand 7473 states and 9709 transitions. Second operand 6 states. [2018-12-02 00:18:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:18:43,644 INFO L93 Difference]: Finished difference Result 15443 states and 21157 transitions. [2018-12-02 00:18:43,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 00:18:43,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 318 [2018-12-02 00:18:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:18:43,665 INFO L225 Difference]: With dead ends: 15443 [2018-12-02 00:18:43,665 INFO L226 Difference]: Without dead ends: 9512 [2018-12-02 00:18:43,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 637 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-02 00:18:43,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9512 states. [2018-12-02 00:18:43,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9512 to 9047. [2018-12-02 00:18:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9047 states. [2018-12-02 00:18:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9047 states to 9047 states and 11262 transitions. [2018-12-02 00:18:43,794 INFO L78 Accepts]: Start accepts. Automaton has 9047 states and 11262 transitions. Word has length 318 [2018-12-02 00:18:43,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:18:43,794 INFO L480 AbstractCegarLoop]: Abstraction has 9047 states and 11262 transitions. [2018-12-02 00:18:43,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:18:43,794 INFO L276 IsEmpty]: Start isEmpty. Operand 9047 states and 11262 transitions. [2018-12-02 00:18:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-12-02 00:18:43,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:18:43,802 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:18:43,802 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:18:43,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:18:43,802 INFO L82 PathProgramCache]: Analyzing trace with hash -651238102, now seen corresponding path program 1 times [2018-12-02 00:18:43,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:18:43,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:18:43,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:18:43,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:18:43,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:18:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:18:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-12-02 00:18:43,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:18:43,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:18:43,908 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:18:43,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:18:43,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:18:43,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:18:43,909 INFO L87 Difference]: Start difference. First operand 9047 states and 11262 transitions. Second operand 3 states. [2018-12-02 00:18:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:18:44,455 INFO L93 Difference]: Finished difference Result 18453 states and 23150 transitions. [2018-12-02 00:18:44,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:18:44,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 386 [2018-12-02 00:18:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:18:44,470 INFO L225 Difference]: With dead ends: 18453 [2018-12-02 00:18:44,471 INFO L226 Difference]: Without dead ends: 10562 [2018-12-02 00:18:44,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:18:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10562 states. [2018-12-02 00:18:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10562 to 10174. [2018-12-02 00:18:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10174 states. [2018-12-02 00:18:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10174 states to 10174 states and 12295 transitions. [2018-12-02 00:18:44,606 INFO L78 Accepts]: Start accepts. Automaton has 10174 states and 12295 transitions. Word has length 386 [2018-12-02 00:18:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:18:44,606 INFO L480 AbstractCegarLoop]: Abstraction has 10174 states and 12295 transitions. [2018-12-02 00:18:44,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:18:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 10174 states and 12295 transitions. [2018-12-02 00:18:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-12-02 00:18:44,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:18:44,614 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 00:18:44,614 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:18:44,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:18:44,614 INFO L82 PathProgramCache]: Analyzing trace with hash -29335036, now seen corresponding path program 1 times [2018-12-02 00:18:44,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:18:44,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:18:44,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:18:44,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:18:44,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:18:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:18:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-12-02 00:18:44,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:18:44,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:18:44,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:18:44,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:18:44,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:18:44,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:18:44,730 INFO L87 Difference]: Start difference. First operand 10174 states and 12295 transitions. Second operand 4 states. [2018-12-02 00:18:45,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:18:45,147 INFO L93 Difference]: Finished difference Result 18799 states and 22761 transitions. [2018-12-02 00:18:45,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:18:45,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 429 [2018-12-02 00:18:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:18:45,148 INFO L225 Difference]: With dead ends: 18799 [2018-12-02 00:18:45,148 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 00:18:45,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:18:45,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 00:18:45,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 00:18:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 00:18:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 00:18:45,161 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 429 [2018-12-02 00:18:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:18:45,161 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 00:18:45,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:18:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 00:18:45,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 00:18:45,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 00:18:45,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,472 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 449 DAG size of output: 219 [2018-12-02 00:18:45,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 00:18:45,630 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 412 DAG size of output: 165 [2018-12-02 00:18:46,182 WARN L180 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 62 [2018-12-02 00:18:46,636 WARN L180 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 59 [2018-12-02 00:18:46,941 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 63 [2018-12-02 00:18:46,942 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a29~0 |old(~a29~0)|) (= ~a23~0 |old(~a23~0)|) (= |old(~a25~0)| ~a25~0) (= ~a4~0 |old(~a4~0)|)) [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,943 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,944 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-12-02 00:18:46,945 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,946 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 22 1026) the Hoare annotation is: (let ((.cse2 (not (= 1 ~a3~0))) (.cse3 (= |calculate_output_#in~input| 0)) (.cse5 (< 138 |old(~a23~0)|)) (.cse7 (= 9 |old(~a25~0)|)) (.cse1 (not (= 15 ~a8~0))) (.cse4 (< 140 |old(~a29~0)|)) (.cse6 (not (= 1 |old(~a4~0)|))) (.cse0 (and (= ~a29~0 |old(~a29~0)|) (= ~a23~0 |old(~a23~0)|) (= |old(~a25~0)| ~a25~0) (= ~a4~0 |old(~a4~0)|)))) (and (or .cse0 (or .cse1 .cse2 (not (= 12 |old(~a25~0)|))) .cse3) (or .cse1 .cse0 .cse4 .cse5) (or .cse1 (or (= 13 |old(~a25~0)|) (<= |old(~a29~0)| 245)) .cse0) (or .cse1 .cse2 .cse4 (= 0 |old(~a25~0)|) .cse3 (not (= 0 (mod |old(~a25~0)| 2))) .cse0) (or .cse1 (<= |old(~a23~0)| 306) .cse6 .cse0) (or .cse1 .cse6 .cse5 .cse0) (or .cse0 .cse1 .cse7 .cse5) (or .cse0 .cse1 .cse6 .cse7) (or .cse1 .cse4 .cse6 .cse0))) [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,947 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,948 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,949 INFO L448 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-12-02 00:18:46,949 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-12-02 00:18:46,949 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-12-02 00:18:46,949 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,949 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,949 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,949 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,949 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,949 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,949 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,949 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,949 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,949 INFO L448 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,949 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,950 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-12-02 00:18:46,950 INFO L448 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-12-02 00:18:46,950 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-12-02 00:18:46,950 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-12-02 00:18:46,950 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-12-02 00:18:46,950 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,950 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,950 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,950 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,950 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,950 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,950 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,950 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-12-02 00:18:46,950 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-12-02 00:18:46,951 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-12-02 00:18:46,951 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,951 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,951 INFO L448 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,951 INFO L448 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-12-02 00:18:46,951 INFO L448 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-12-02 00:18:46,951 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,951 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,951 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,951 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,951 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,951 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-12-02 00:18:46,951 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-12-02 00:18:46,951 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,951 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,952 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-12-02 00:18:46,952 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-12-02 00:18:46,952 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,952 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,952 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,952 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,952 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,952 INFO L448 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,952 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-12-02 00:18:46,952 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-12-02 00:18:46,952 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-12-02 00:18:46,952 INFO L448 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-12-02 00:18:46,952 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,952 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,952 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,953 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,953 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,953 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,953 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,953 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,953 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-12-02 00:18:46,953 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-12-02 00:18:46,953 INFO L448 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-12-02 00:18:46,953 INFO L448 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-12-02 00:18:46,953 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-12-02 00:18:46,953 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-12-02 00:18:46,953 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,953 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,953 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,953 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,954 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,955 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,956 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,956 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,956 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-12-02 00:18:46,956 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-12-02 00:18:46,956 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-12-02 00:18:46,956 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,956 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-12-02 00:18:46,956 INFO L448 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-12-02 00:18:46,956 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,956 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,956 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,956 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,956 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,956 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,957 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-12-02 00:18:46,957 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-12-02 00:18:46,957 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-12-02 00:18:46,957 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,957 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,957 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,957 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,957 INFO L448 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-12-02 00:18:46,957 INFO L448 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-12-02 00:18:46,957 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,957 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,957 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-12-02 00:18:46,957 INFO L448 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,957 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,957 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2018-12-02 00:18:46,958 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 00:18:46,958 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a23~0 312) (= ~a8~0 15) (= ~a29~0 130) (= 1 ~a4~0) (= ~a25~0 10) (= ~a3~0 1)) [2018-12-02 00:18:46,958 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 00:18:46,958 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 00:18:46,958 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 1028 1044) the Hoare annotation is: (or (not (= 10 |old(~a25~0)|)) (not (= 15 ~a8~0)) (not (= 1 ~a3~0)) (not (= 312 |old(~a23~0)|)) (not (= 1 |old(~a4~0)|)) (and (= ~a29~0 |old(~a29~0)|) (= ~a25~0 10) (= ~a23~0 312) (= ~a4~0 |old(~a4~0)|)) (not (= 130 |old(~a29~0)|))) [2018-12-02 00:18:46,958 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 1028 1044) no Hoare annotation was computed. [2018-12-02 00:18:46,958 INFO L444 ceAbstractionStarter]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse0 (not (= 9 ~a25~0))) (.cse1 (<= ~a23~0 138)) (.cse2 (= 1 ~a4~0)) (.cse3 (<= ~a29~0 140)) (.cse4 (not (= main_~input~0 0)))) (or (not (= 10 |old(~a25~0)|)) (and .cse0 .cse1) (and (not (= ~a25~0 13)) (< 245 ~a29~0)) (not (= 130 |old(~a29~0)|)) (not (= 1 ~a3~0)) (and .cse1 .cse2) (and .cse0 .cse2) (and .cse1 .cse3) (and (< 306 ~a23~0) .cse2) (not (= 312 |old(~a23~0)|)) (and .cse2 .cse3) (and .cse4 (= (mod ~a25~0 2) 0) (not (= ~a25~0 0)) .cse3) (and .cse4 (= ~a25~0 12)) (not (= 15 ~a8~0)) (not (= 1 |old(~a4~0)|)))) [2018-12-02 00:18:46,958 INFO L448 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2018-12-02 00:18:46,958 INFO L448 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-12-02 00:18:46,959 INFO L444 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse0 (not (= 9 ~a25~0))) (.cse1 (<= ~a23~0 138)) (.cse2 (= 1 ~a4~0)) (.cse3 (<= ~a29~0 140))) (or (not (= 10 |old(~a25~0)|)) (and .cse0 .cse1) (and (not (= ~a25~0 13)) (< 245 ~a29~0)) (not (= 130 |old(~a29~0)|)) (not (= 1 ~a3~0)) (and .cse1 .cse2) (and .cse0 .cse2) (and .cse1 .cse3) (= ~a25~0 12) (and (< 306 ~a23~0) .cse2) (not (= 312 |old(~a23~0)|)) (and (= (mod ~a25~0 2) 0) (not (= ~a25~0 0)) .cse3) (and .cse2 .cse3) (not (= 15 ~a8~0)) (not (= 1 |old(~a4~0)|)))) [2018-12-02 00:18:46,959 INFO L448 ceAbstractionStarter]: For program point L1034-3(lines 1028 1044) no Hoare annotation was computed. [2018-12-02 00:18:46,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:18:46 BoogieIcfgContainer [2018-12-02 00:18:46,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 00:18:46,968 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 00:18:46,968 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 00:18:46,968 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 00:18:46,968 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:15:58" (3/4) ... [2018-12-02 00:18:46,971 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 00:18:46,976 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 00:18:46,976 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-12-02 00:18:46,976 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 00:18:46,987 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 00:18:46,988 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 00:18:47,009 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(10 == \old(a25)) || (!(9 == a25) && a23 <= 138)) || (!(a25 == 13) && 245 < a29)) || !(130 == \old(a29))) || !(1 == a3)) || (a23 <= 138 && 1 == a4)) || (!(9 == a25) && 1 == a4)) || (a23 <= 138 && a29 <= 140)) || a25 == 12) || (306 < a23 && 1 == a4)) || !(312 == \old(a23))) || ((a25 % 2 == 0 && !(a25 == 0)) && a29 <= 140)) || (1 == a4 && a29 <= 140)) || !(15 == a8)) || !(1 == \old(a4)) [2018-12-02 00:18:47,078 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3d5bb695-a015-4aa1-8748-1164ea699e39/bin-2019/utaipan/witness.graphml [2018-12-02 00:18:47,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 00:18:47,078 INFO L168 Benchmark]: Toolchain (without parser) took 170153.22 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 947.0 MB in the beginning and 670.3 MB in the end (delta: 276.7 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-12-02 00:18:47,079 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:18:47,079 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2018-12-02 00:18:47,079 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.73 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-02 00:18:47,079 INFO L168 Benchmark]: Boogie Preprocessor took 50.79 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-02 00:18:47,079 INFO L168 Benchmark]: RCFGBuilder took 976.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 933.2 MB in the end (delta: 178.8 MB). Peak memory consumption was 178.8 MB. Max. memory is 11.5 GB. [2018-12-02 00:18:47,079 INFO L168 Benchmark]: TraceAbstraction took 168575.08 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 933.2 MB in the beginning and 670.3 MB in the end (delta: 262.9 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2018-12-02 00:18:47,080 INFO L168 Benchmark]: Witness Printer took 110.16 ms. Allocated memory is still 4.9 GB. Free memory is still 670.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:18:47,081 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 413.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.73 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.79 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 976.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 933.2 MB in the end (delta: 178.8 MB). Peak memory consumption was 178.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 168575.08 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 933.2 MB in the beginning and 670.3 MB in the end (delta: 262.9 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 110.16 ms. Allocated memory is still 4.9 GB. Free memory is still 670.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 84]: 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: 1034]: Loop Invariant Derived loop invariant: (((((((((((((!(10 == \old(a25)) || (!(9 == a25) && a23 <= 138)) || (!(a25 == 13) && 245 < a29)) || !(130 == \old(a29))) || !(1 == a3)) || (a23 <= 138 && 1 == a4)) || (!(9 == a25) && 1 == a4)) || (a23 <= 138 && a29 <= 140)) || a25 == 12) || (306 < a23 && 1 == a4)) || !(312 == \old(a23))) || ((a25 % 2 == 0 && !(a25 == 0)) && a29 <= 140)) || (1 == a4 && a29 <= 140)) || !(15 == a8)) || !(1 == \old(a4)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 292 locations, 1 error locations. SAFE Result, 168.5s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 154.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1718 SDtfs, 7909 SDslu, 1207 SDs, 0 SdLazy, 14195 SolverSat, 2552 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 123.7s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 2781 GetRequests, 2660 SyntacticMatches, 13 SemanticMatches, 108 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10174occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 6 AbstIntIterations, 2 AbstIntStrong, 0.9970499153134498 AbsIntWeakeningRatio, 0.1291139240506329 AbsIntAvgWeakeningVarsNumRemoved, 16.90886075949367 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 3047 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 282 PreInvPairs, 384 NumberOfFragments, 515 HoareAnnotationTreeSize, 282 FomulaSimplifications, 61200 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 19258 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 3964 NumberOfCodeBlocks, 3964 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 5075 ConstructedInterpolants, 4 QuantifiedInterpolants, 4127428 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2040 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 3481/3786 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...