./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label49.c -s /tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95000caaa926e46a44fd070da2a40a84b9e2d593 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 06:03:39,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 06:03:39,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 06:03:39,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 06:03:39,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 06:03:39,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 06:03:39,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 06:03:39,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 06:03:39,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 06:03:39,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 06:03:39,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 06:03:39,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 06:03:39,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 06:03:39,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 06:03:39,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 06:03:39,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 06:03:39,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 06:03:39,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 06:03:39,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 06:03:39,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 06:03:39,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 06:03:39,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 06:03:39,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 06:03:39,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 06:03:39,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 06:03:39,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 06:03:39,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 06:03:39,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 06:03:39,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 06:03:39,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 06:03:39,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 06:03:39,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 06:03:39,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 06:03:39,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 06:03:39,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 06:03:39,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 06:03:39,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 06:03:39,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 06:03:39,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 06:03:39,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 06:03:39,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 06:03:39,837 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 06:03:39,849 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 06:03:39,849 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 06:03:39,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 06:03:39,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 06:03:39,851 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 06:03:39,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 06:03:39,851 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 06:03:39,851 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 06:03:39,852 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 06:03:39,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 06:03:39,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 06:03:39,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 06:03:39,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 06:03:39,857 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 06:03:39,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 06:03:39,857 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 06:03:39,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 06:03:39,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 06:03:39,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 06:03:39,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 06:03:39,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 06:03:39,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:03:39,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 06:03:39,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 06:03:39,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 06:03:39,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 06:03:39,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 06:03:39,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 06:03:39,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95000caaa926e46a44fd070da2a40a84b9e2d593 [2019-11-20 06:03:40,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 06:03:40,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 06:03:40,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 06:03:40,044 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 06:03:40,044 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 06:03:40,045 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label49.c [2019-11-20 06:03:40,110 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/bin/uautomizer/data/90d4e295f/c64b66eabe774321bff4641e112f450c/FLAG036fbf4b3 [2019-11-20 06:03:40,641 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 06:03:40,648 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/sv-benchmarks/c/eca-rers2012/Problem02_label49.c [2019-11-20 06:03:40,664 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/bin/uautomizer/data/90d4e295f/c64b66eabe774321bff4641e112f450c/FLAG036fbf4b3 [2019-11-20 06:03:41,122 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/bin/uautomizer/data/90d4e295f/c64b66eabe774321bff4641e112f450c [2019-11-20 06:03:41,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 06:03:41,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 06:03:41,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 06:03:41,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 06:03:41,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 06:03:41,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:03:41" (1/1) ... [2019-11-20 06:03:41,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c43b09c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:41, skipping insertion in model container [2019-11-20 06:03:41,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:03:41" (1/1) ... [2019-11-20 06:03:41,139 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 06:03:41,191 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 06:03:41,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:03:41,721 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 06:03:41,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:03:41,847 INFO L192 MainTranslator]: Completed translation [2019-11-20 06:03:41,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:41 WrapperNode [2019-11-20 06:03:41,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 06:03:41,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 06:03:41,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 06:03:41,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 06:03:41,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:41" (1/1) ... [2019-11-20 06:03:41,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:41" (1/1) ... [2019-11-20 06:03:41,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 06:03:41,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 06:03:41,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 06:03:41,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 06:03:41,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:41" (1/1) ... [2019-11-20 06:03:41,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:41" (1/1) ... [2019-11-20 06:03:41,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:41" (1/1) ... [2019-11-20 06:03:41,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:41" (1/1) ... [2019-11-20 06:03:41,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:41" (1/1) ... [2019-11-20 06:03:41,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:41" (1/1) ... [2019-11-20 06:03:41,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:41" (1/1) ... [2019-11-20 06:03:41,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 06:03:41,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 06:03:41,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 06:03:41,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 06:03:42,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:03:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 06:03:42,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 06:03:43,119 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 06:03:43,119 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 06:03:43,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:03:43 BoogieIcfgContainer [2019-11-20 06:03:43,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 06:03:43,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 06:03:43,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 06:03:43,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 06:03:43,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:03:41" (1/3) ... [2019-11-20 06:03:43,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527b3e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:03:43, skipping insertion in model container [2019-11-20 06:03:43,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:41" (2/3) ... [2019-11-20 06:03:43,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527b3e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:03:43, skipping insertion in model container [2019-11-20 06:03:43,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:03:43" (3/3) ... [2019-11-20 06:03:43,126 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label49.c [2019-11-20 06:03:43,134 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 06:03:43,141 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 06:03:43,151 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 06:03:43,189 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 06:03:43,189 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 06:03:43,189 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 06:03:43,189 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 06:03:43,190 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 06:03:43,190 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 06:03:43,190 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 06:03:43,190 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 06:03:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-20 06:03:43,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 06:03:43,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:03:43,238 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:03:43,238 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:03:43,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:03:43,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1378216101, now seen corresponding path program 1 times [2019-11-20 06:03:43,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:03:43,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909770825] [2019-11-20 06:03:43,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:03:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:03:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:03:43,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909770825] [2019-11-20 06:03:43,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:03:43,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:03:43,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107580693] [2019-11-20 06:03:43,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:03:43,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:03:43,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:03:43,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:03:43,753 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-20 06:03:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:03:45,166 INFO L93 Difference]: Finished difference Result 775 states and 1353 transitions. [2019-11-20 06:03:45,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:03:45,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-11-20 06:03:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:03:45,184 INFO L225 Difference]: With dead ends: 775 [2019-11-20 06:03:45,184 INFO L226 Difference]: Without dead ends: 460 [2019-11-20 06:03:45,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:03:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-20 06:03:45,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 308. [2019-11-20 06:03:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-20 06:03:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 451 transitions. [2019-11-20 06:03:45,273 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 451 transitions. Word has length 125 [2019-11-20 06:03:45,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:03:45,274 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 451 transitions. [2019-11-20 06:03:45,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:03:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 451 transitions. [2019-11-20 06:03:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-20 06:03:45,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:03:45,277 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:03:45,277 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:03:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:03:45,278 INFO L82 PathProgramCache]: Analyzing trace with hash 427040720, now seen corresponding path program 1 times [2019-11-20 06:03:45,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:03:45,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083269924] [2019-11-20 06:03:45,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:03:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:03:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:03:45,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083269924] [2019-11-20 06:03:45,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:03:45,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:03:45,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946032390] [2019-11-20 06:03:45,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:03:45,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:03:45,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:03:45,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:03:45,557 INFO L87 Difference]: Start difference. First operand 308 states and 451 transitions. Second operand 4 states. [2019-11-20 06:03:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:03:46,395 INFO L93 Difference]: Finished difference Result 977 states and 1474 transitions. [2019-11-20 06:03:46,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:03:46,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-11-20 06:03:46,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:03:46,404 INFO L225 Difference]: With dead ends: 977 [2019-11-20 06:03:46,404 INFO L226 Difference]: Without dead ends: 588 [2019-11-20 06:03:46,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:03:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-11-20 06:03:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 448. [2019-11-20 06:03:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-20 06:03:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 621 transitions. [2019-11-20 06:03:46,432 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 621 transitions. Word has length 129 [2019-11-20 06:03:46,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:03:46,432 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 621 transitions. [2019-11-20 06:03:46,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:03:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 621 transitions. [2019-11-20 06:03:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 06:03:46,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:03:46,437 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 06:03:46,437 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:03:46,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:03:46,437 INFO L82 PathProgramCache]: Analyzing trace with hash 349951226, now seen corresponding path program 1 times [2019-11-20 06:03:46,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:03:46,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473438240] [2019-11-20 06:03:46,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:03:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:03:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:03:46,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473438240] [2019-11-20 06:03:46,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:03:46,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:03:46,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497211183] [2019-11-20 06:03:46,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:03:46,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:03:46,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:03:46,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:03:46,513 INFO L87 Difference]: Start difference. First operand 448 states and 621 transitions. Second operand 4 states. [2019-11-20 06:03:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:03:47,370 INFO L93 Difference]: Finished difference Result 1753 states and 2444 transitions. [2019-11-20 06:03:47,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:03:47,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-20 06:03:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:03:47,377 INFO L225 Difference]: With dead ends: 1753 [2019-11-20 06:03:47,378 INFO L226 Difference]: Without dead ends: 1307 [2019-11-20 06:03:47,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:03:47,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2019-11-20 06:03:47,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 871. [2019-11-20 06:03:47,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2019-11-20 06:03:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1168 transitions. [2019-11-20 06:03:47,410 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1168 transitions. Word has length 143 [2019-11-20 06:03:47,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:03:47,410 INFO L462 AbstractCegarLoop]: Abstraction has 871 states and 1168 transitions. [2019-11-20 06:03:47,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:03:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1168 transitions. [2019-11-20 06:03:47,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-20 06:03:47,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:03:47,415 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-11-20 06:03:47,415 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:03:47,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:03:47,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1893011715, now seen corresponding path program 1 times [2019-11-20 06:03:47,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:03:47,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464523636] [2019-11-20 06:03:47,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:03:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:03:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 06:03:47,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464523636] [2019-11-20 06:03:47,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:03:47,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:03:47,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241456489] [2019-11-20 06:03:47,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:03:47,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:03:47,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:03:47,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:03:47,491 INFO L87 Difference]: Start difference. First operand 871 states and 1168 transitions. Second operand 4 states. [2019-11-20 06:03:48,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:03:48,347 INFO L93 Difference]: Finished difference Result 3287 states and 4394 transitions. [2019-11-20 06:03:48,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:03:48,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-20 06:03:48,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:03:48,362 INFO L225 Difference]: With dead ends: 3287 [2019-11-20 06:03:48,363 INFO L226 Difference]: Without dead ends: 2418 [2019-11-20 06:03:48,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:03:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2019-11-20 06:03:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2132. [2019-11-20 06:03:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-11-20 06:03:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2647 transitions. [2019-11-20 06:03:48,427 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2647 transitions. Word has length 155 [2019-11-20 06:03:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:03:48,428 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2647 transitions. [2019-11-20 06:03:48,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:03:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2647 transitions. [2019-11-20 06:03:48,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-20 06:03:48,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:03:48,434 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-20 06:03:48,434 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:03:48,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:03:48,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1809702189, now seen corresponding path program 1 times [2019-11-20 06:03:48,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:03:48,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522299] [2019-11-20 06:03:48,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:03:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:03:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 06:03:48,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522299] [2019-11-20 06:03:48,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:03:48,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:03:48,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919776263] [2019-11-20 06:03:48,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:03:48,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:03:48,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:03:48,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:03:48,550 INFO L87 Difference]: Start difference. First operand 2132 states and 2647 transitions. Second operand 4 states. [2019-11-20 06:03:49,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:03:49,469 INFO L93 Difference]: Finished difference Result 5395 states and 6742 transitions. [2019-11-20 06:03:49,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:03:49,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-20 06:03:49,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:03:49,484 INFO L225 Difference]: With dead ends: 5395 [2019-11-20 06:03:49,484 INFO L226 Difference]: Without dead ends: 3265 [2019-11-20 06:03:49,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:03:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2019-11-20 06:03:49,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 2133. [2019-11-20 06:03:49,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-11-20 06:03:49,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2588 transitions. [2019-11-20 06:03:49,540 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2588 transitions. Word has length 158 [2019-11-20 06:03:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:03:49,542 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 2588 transitions. [2019-11-20 06:03:49,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:03:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2588 transitions. [2019-11-20 06:03:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 06:03:49,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:03:49,547 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:03:49,547 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:03:49,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:03:49,548 INFO L82 PathProgramCache]: Analyzing trace with hash 312992377, now seen corresponding path program 1 times [2019-11-20 06:03:49,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:03:49,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145687277] [2019-11-20 06:03:49,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:03:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:03:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:03:49,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145687277] [2019-11-20 06:03:49,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:03:49,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:03:49,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499832177] [2019-11-20 06:03:49,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:03:49,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:03:49,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:03:49,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:03:49,627 INFO L87 Difference]: Start difference. First operand 2133 states and 2588 transitions. Second operand 3 states. [2019-11-20 06:03:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:03:50,043 INFO L93 Difference]: Finished difference Result 4549 states and 5472 transitions. [2019-11-20 06:03:50,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:03:50,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-20 06:03:50,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:03:50,055 INFO L225 Difference]: With dead ends: 4549 [2019-11-20 06:03:50,055 INFO L226 Difference]: Without dead ends: 2278 [2019-11-20 06:03:50,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:03:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-11-20 06:03:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2133. [2019-11-20 06:03:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-11-20 06:03:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 2495 transitions. [2019-11-20 06:03:50,097 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 2495 transitions. Word has length 165 [2019-11-20 06:03:50,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:03:50,097 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 2495 transitions. [2019-11-20 06:03:50,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:03:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2495 transitions. [2019-11-20 06:03:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 06:03:50,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:03:50,102 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:03:50,102 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:03:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:03:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2122414462, now seen corresponding path program 1 times [2019-11-20 06:03:50,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:03:50,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234632149] [2019-11-20 06:03:50,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:03:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:03:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 06:03:50,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234632149] [2019-11-20 06:03:50,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:03:50,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 06:03:50,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102815601] [2019-11-20 06:03:50,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:03:50,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:03:50,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:03:50,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:03:50,164 INFO L87 Difference]: Start difference. First operand 2133 states and 2495 transitions. Second operand 3 states. [2019-11-20 06:03:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:03:50,571 INFO L93 Difference]: Finished difference Result 4681 states and 5436 transitions. [2019-11-20 06:03:50,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:03:50,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-11-20 06:03:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:03:50,581 INFO L225 Difference]: With dead ends: 4681 [2019-11-20 06:03:50,582 INFO L226 Difference]: Without dead ends: 1990 [2019-11-20 06:03:50,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 06:03:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2019-11-20 06:03:50,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1850. [2019-11-20 06:03:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2019-11-20 06:03:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2047 transitions. [2019-11-20 06:03:50,619 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2047 transitions. Word has length 174 [2019-11-20 06:03:50,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:03:50,619 INFO L462 AbstractCegarLoop]: Abstraction has 1850 states and 2047 transitions. [2019-11-20 06:03:50,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:03:50,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2047 transitions. [2019-11-20 06:03:50,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 06:03:50,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:03:50,625 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:03:50,625 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:03:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:03:50,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1776115291, now seen corresponding path program 1 times [2019-11-20 06:03:50,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:03:50,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416514619] [2019-11-20 06:03:50,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:03:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:03:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 06:03:50,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416514619] [2019-11-20 06:03:50,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617051882] [2019-11-20 06:03:50,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:03:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:03:50,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 06:03:50,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:03:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-20 06:03:51,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 06:03:51,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-20 06:03:51,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917020684] [2019-11-20 06:03:51,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 06:03:51,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:03:51,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 06:03:51,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:03:51,006 INFO L87 Difference]: Start difference. First operand 1850 states and 2047 transitions. Second operand 3 states. [2019-11-20 06:03:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:03:51,428 INFO L93 Difference]: Finished difference Result 3697 states and 4091 transitions. [2019-11-20 06:03:51,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 06:03:51,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-20 06:03:51,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:03:51,437 INFO L225 Difference]: With dead ends: 3697 [2019-11-20 06:03:51,438 INFO L226 Difference]: Without dead ends: 1849 [2019-11-20 06:03:51,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-20 06:03:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2019-11-20 06:03:51,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1429. [2019-11-20 06:03:51,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-11-20 06:03:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1533 transitions. [2019-11-20 06:03:51,467 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1533 transitions. Word has length 188 [2019-11-20 06:03:51,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:03:51,468 INFO L462 AbstractCegarLoop]: Abstraction has 1429 states and 1533 transitions. [2019-11-20 06:03:51,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 06:03:51,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1533 transitions. [2019-11-20 06:03:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-20 06:03:51,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:03:51,473 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:03:51,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 06:03:51,677 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:03:51,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:03:51,678 INFO L82 PathProgramCache]: Analyzing trace with hash 360926504, now seen corresponding path program 1 times [2019-11-20 06:03:51,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:03:51,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991042464] [2019-11-20 06:03:51,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:03:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:03:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:03:51,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991042464] [2019-11-20 06:03:51,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:03:51,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 06:03:51,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712602492] [2019-11-20 06:03:51,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 06:03:51,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:03:51,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 06:03:51,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-20 06:03:51,865 INFO L87 Difference]: Start difference. First operand 1429 states and 1533 transitions. Second operand 7 states. [2019-11-20 06:03:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:03:53,061 INFO L93 Difference]: Finished difference Result 3741 states and 4045 transitions. [2019-11-20 06:03:53,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 06:03:53,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2019-11-20 06:03:53,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:03:53,070 INFO L225 Difference]: With dead ends: 3741 [2019-11-20 06:03:53,070 INFO L226 Difference]: Without dead ends: 2031 [2019-11-20 06:03:53,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:03:53,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2019-11-20 06:03:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 1429. [2019-11-20 06:03:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-11-20 06:03:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1503 transitions. [2019-11-20 06:03:53,110 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1503 transitions. Word has length 198 [2019-11-20 06:03:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:03:53,111 INFO L462 AbstractCegarLoop]: Abstraction has 1429 states and 1503 transitions. [2019-11-20 06:03:53,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 06:03:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1503 transitions. [2019-11-20 06:03:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-20 06:03:53,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:03:53,118 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:03:53,118 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:03:53,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:03:53,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1134644622, now seen corresponding path program 1 times [2019-11-20 06:03:53,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:03:53,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95222514] [2019-11-20 06:03:53,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:03:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:03:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:03:53,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95222514] [2019-11-20 06:03:53,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:03:53,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:03:53,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479705264] [2019-11-20 06:03:53,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:03:53,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:03:53,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:03:53,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:03:53,259 INFO L87 Difference]: Start difference. First operand 1429 states and 1503 transitions. Second operand 4 states. [2019-11-20 06:03:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:03:53,974 INFO L93 Difference]: Finished difference Result 3140 states and 3298 transitions. [2019-11-20 06:03:53,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:03:53,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-20 06:03:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:03:53,982 INFO L225 Difference]: With dead ends: 3140 [2019-11-20 06:03:53,982 INFO L226 Difference]: Without dead ends: 1573 [2019-11-20 06:03:53,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:03:53,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2019-11-20 06:03:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1429. [2019-11-20 06:03:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-11-20 06:03:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1489 transitions. [2019-11-20 06:03:54,014 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1489 transitions. Word has length 202 [2019-11-20 06:03:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:03:54,014 INFO L462 AbstractCegarLoop]: Abstraction has 1429 states and 1489 transitions. [2019-11-20 06:03:54,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:03:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1489 transitions. [2019-11-20 06:03:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-20 06:03:54,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:03:54,019 INFO L410 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:03:54,019 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:03:54,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:03:54,019 INFO L82 PathProgramCache]: Analyzing trace with hash -135469808, now seen corresponding path program 1 times [2019-11-20 06:03:54,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 06:03:54,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501614631] [2019-11-20 06:03:54,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 06:03:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:03:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 06:03:54,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501614631] [2019-11-20 06:03:54,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:03:54,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 06:03:54,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802088427] [2019-11-20 06:03:54,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 06:03:54,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 06:03:54,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 06:03:54,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:03:54,171 INFO L87 Difference]: Start difference. First operand 1429 states and 1489 transitions. Second operand 4 states. [2019-11-20 06:03:54,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:03:54,849 INFO L93 Difference]: Finished difference Result 3276 states and 3429 transitions. [2019-11-20 06:03:54,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 06:03:54,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-11-20 06:03:54,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:03:54,850 INFO L225 Difference]: With dead ends: 3276 [2019-11-20 06:03:54,851 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 06:03:54,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 06:03:54,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 06:03:54,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 06:03:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 06:03:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 06:03:54,854 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2019-11-20 06:03:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:03:54,855 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 06:03:54,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 06:03:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 06:03:54,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 06:03:54,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 06:03:54,995 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-11-20 06:03:55,161 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-11-20 06:03:55,898 WARN L191 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 47 [2019-11-20 06:03:56,447 WARN L191 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 47 [2019-11-20 06:03:56,449 INFO L444 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,449 INFO L444 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,449 INFO L444 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,449 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-20 06:03:56,449 INFO L444 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-20 06:03:56,449 INFO L444 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-20 06:03:56,449 INFO L444 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-20 06:03:56,449 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-20 06:03:56,449 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-20 06:03:56,449 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-20 06:03:56,449 INFO L444 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,449 INFO L444 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,450 INFO L444 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,450 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-20 06:03:56,450 INFO L444 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-20 06:03:56,450 INFO L444 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-20 06:03:56,450 INFO L444 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-20 06:03:56,450 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-20 06:03:56,450 INFO L444 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-20 06:03:56,450 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-20 06:03:56,450 INFO L444 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,450 INFO L444 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,450 INFO L444 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,450 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-20 06:03:56,450 INFO L444 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-20 06:03:56,450 INFO L444 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-20 06:03:56,451 INFO L444 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-20 06:03:56,451 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-20 06:03:56,451 INFO L444 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,451 INFO L444 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,451 INFO L444 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,451 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-20 06:03:56,451 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-20 06:03:56,451 INFO L444 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-20 06:03:56,451 INFO L444 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-20 06:03:56,451 INFO L444 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-20 06:03:56,451 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-20 06:03:56,451 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-20 06:03:56,451 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-20 06:03:56,451 INFO L444 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,452 INFO L444 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,452 INFO L444 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,452 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-20 06:03:56,452 INFO L444 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-20 06:03:56,452 INFO L444 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-20 06:03:56,452 INFO L444 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-20 06:03:56,452 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-20 06:03:56,452 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-20 06:03:56,452 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-20 06:03:56,452 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-20 06:03:56,452 INFO L444 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,452 INFO L444 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,452 INFO L444 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,453 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-20 06:03:56,453 INFO L444 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-20 06:03:56,453 INFO L444 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-20 06:03:56,453 INFO L444 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-20 06:03:56,453 INFO L444 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-20 06:03:56,453 INFO L444 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-20 06:03:56,453 INFO L444 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-20 06:03:56,453 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-20 06:03:56,453 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-20 06:03:56,453 INFO L444 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,453 INFO L444 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,454 INFO L444 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,454 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-20 06:03:56,454 INFO L444 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-20 06:03:56,454 INFO L444 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-20 06:03:56,454 INFO L444 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-20 06:03:56,454 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-20 06:03:56,454 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-20 06:03:56,454 INFO L444 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,454 INFO L444 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,454 INFO L444 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,454 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-20 06:03:56,454 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-20 06:03:56,455 INFO L444 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-20 06:03:56,455 INFO L444 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-20 06:03:56,455 INFO L444 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-20 06:03:56,455 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 06:03:56,455 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-20 06:03:56,455 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-20 06:03:56,455 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-20 06:03:56,455 INFO L444 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,455 INFO L444 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,455 INFO L444 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,455 INFO L444 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-20 06:03:56,455 INFO L444 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-20 06:03:56,456 INFO L444 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-20 06:03:56,456 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-20 06:03:56,456 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-20 06:03:56,456 INFO L444 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,456 INFO L444 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,456 INFO L444 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,456 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-20 06:03:56,456 INFO L444 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-20 06:03:56,456 INFO L444 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-20 06:03:56,456 INFO L444 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 547) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-20 06:03:56,457 INFO L444 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-20 06:03:56,458 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-20 06:03:56,458 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse3 (= ~a25~0 1))) (let ((.cse1 (= ~a28~0 7)) (.cse6 (not .cse3)) (.cse11 (not (= 1 ~a11~0))) (.cse0 (= ~a19~0 1))) (let ((.cse2 (= ~a11~0 1)) (.cse9 (= ~a28~0 9)) (.cse10 (not .cse0)) (.cse5 (and .cse6 .cse11)) (.cse7 (not (= ~a28~0 11))) (.cse8 (not .cse1)) (.cse12 (= ~a17~0 8)) (.cse13 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (<= ~a19~0 0))) (or (and .cse4 .cse5) (and .cse4 .cse6 .cse7))) (and .cse8 .cse0 .cse6 .cse2) (and .cse9 (and .cse10 .cse3 .cse2)) (and (not .cse9) (and .cse10 .cse11 .cse7)) (and .cse10 .cse6 .cse1) (and .cse8 (and .cse5 .cse7)) (and .cse12 .cse0 .cse1 .cse13) (and .cse8 (or (and .cse12 .cse0 .cse13 .cse3) (and .cse0 .cse3 .cse11))))))) [2019-11-20 06:03:56,458 INFO L444 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,458 INFO L444 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,458 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-20 06:03:56,458 INFO L444 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-20 06:03:56,458 INFO L444 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-20 06:03:56,458 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-20 06:03:56,459 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-20 06:03:56,460 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-20 06:03:56,460 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse3 (= ~a25~0 1))) (let ((.cse1 (= ~a28~0 7)) (.cse6 (not .cse3)) (.cse11 (not (= 1 ~a11~0))) (.cse0 (= ~a19~0 1))) (let ((.cse2 (= ~a11~0 1)) (.cse9 (= ~a28~0 9)) (.cse10 (not .cse0)) (.cse5 (and .cse6 .cse11)) (.cse7 (not (= ~a28~0 11))) (.cse8 (not .cse1)) (.cse12 (= ~a17~0 8)) (.cse13 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (<= ~a19~0 0))) (or (and .cse4 .cse5) (and .cse4 .cse6 .cse7))) (and .cse8 .cse0 .cse6 .cse2) (and .cse9 (and .cse10 .cse3 .cse2)) (and (not .cse9) (and .cse10 .cse11 .cse7)) (and .cse10 .cse6 .cse1) (and .cse8 (and .cse5 .cse7)) (and .cse12 .cse0 .cse1 .cse13) (and .cse8 (or (and .cse12 .cse0 .cse13 .cse3) (and .cse0 .cse3 .cse11))))))) [2019-11-20 06:03:56,460 INFO L444 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,460 INFO L444 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,460 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-20 06:03:56,460 INFO L444 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-20 06:03:56,460 INFO L444 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-20 06:03:56,460 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-20 06:03:56,460 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-20 06:03:56,460 INFO L444 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,460 INFO L444 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,461 INFO L444 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-20 06:03:56,461 INFO L444 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-20 06:03:56,461 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-20 06:03:56,461 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-20 06:03:56,461 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-20 06:03:56,461 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-20 06:03:56,461 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-20 06:03:56,461 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-20 06:03:56,461 INFO L444 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-20 06:03:56,461 INFO L444 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,461 INFO L444 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,461 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-20 06:03:56,462 INFO L444 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,462 INFO L444 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-20 06:03:56,462 INFO L444 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-20 06:03:56,462 INFO L444 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-20 06:03:56,462 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-20 06:03:56,462 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-20 06:03:56,462 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 06:03:56,462 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-20 06:03:56,462 INFO L444 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,462 INFO L444 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,462 INFO L444 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,463 INFO L444 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-20 06:03:56,463 INFO L444 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-20 06:03:56,463 INFO L444 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-20 06:03:56,463 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-20 06:03:56,463 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-20 06:03:56,463 INFO L444 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,463 INFO L444 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,463 INFO L444 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,464 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-20 06:03:56,464 INFO L444 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-20 06:03:56,464 INFO L444 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-20 06:03:56,464 INFO L444 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-20 06:03:56,464 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-20 06:03:56,464 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-20 06:03:56,464 INFO L444 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,464 INFO L444 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,465 INFO L444 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,465 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-20 06:03:56,465 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-20 06:03:56,465 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-20 06:03:56,465 INFO L444 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-20 06:03:56,465 INFO L444 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-20 06:03:56,465 INFO L444 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-20 06:03:56,466 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 06:03:56,466 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-20 06:03:56,466 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-20 06:03:56,466 INFO L444 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,466 INFO L444 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,466 INFO L444 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,466 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-20 06:03:56,466 INFO L444 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-20 06:03:56,467 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-20 06:03:56,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:03:56 BoogieIcfgContainer [2019-11-20 06:03:56,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 06:03:56,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 06:03:56,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 06:03:56,490 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 06:03:56,491 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:03:43" (3/4) ... [2019-11-20 06:03:56,494 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 06:03:56,518 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 06:03:56,519 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 06:03:56,718 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_469987a4-83e9-421f-a67e-c96dcd3d4802/bin/uautomizer/witness.graphml [2019-11-20 06:03:56,718 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 06:03:56,720 INFO L168 Benchmark]: Toolchain (without parser) took 15592.49 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 409.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 228.1 MB. Max. memory is 11.5 GB. [2019-11-20 06:03:56,720 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:03:56,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-20 06:03:56,721 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.48 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 06:03:56,721 INFO L168 Benchmark]: Boogie Preprocessor took 52.09 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 06:03:56,722 INFO L168 Benchmark]: RCFGBuilder took 1121.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-11-20 06:03:56,722 INFO L168 Benchmark]: TraceAbstraction took 13368.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -147.2 MB). Peak memory consumption was 415.9 MB. Max. memory is 11.5 GB. [2019-11-20 06:03:56,723 INFO L168 Benchmark]: Witness Printer took 228.44 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-11-20 06:03:56,725 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 719.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.48 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.09 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1121.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13368.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -147.2 MB). Peak memory consumption was 415.9 MB. Max. memory is 11.5 GB. * Witness Printer took 228.44 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 547]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((a19 == 1 && a28 == 7) && a11 == 1) && a25 == 1) || (a19 <= 0 && !(a25 == 1) && !(1 == a11)) || ((a19 <= 0 && !(a25 == 1)) && !(a28 == 11))) || (((!(a28 == 7) && a19 == 1) && !(a25 == 1)) && a11 == 1)) || (a28 == 9 && (!(a19 == 1) && a25 == 1) && a11 == 1)) || (!(a28 == 9) && (!(a19 == 1) && !(1 == a11)) && !(a28 == 11))) || ((!(a19 == 1) && !(a25 == 1)) && a28 == 7)) || (!(a28 == 7) && (!(a25 == 1) && !(1 == a11)) && !(a28 == 11))) || (((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1)) || (!(a28 == 7) && ((((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1) || ((a19 == 1 && a25 == 1) && !(1 == a11)))) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((a19 == 1 && a28 == 7) && a11 == 1) && a25 == 1) || (a19 <= 0 && !(a25 == 1) && !(1 == a11)) || ((a19 <= 0 && !(a25 == 1)) && !(a28 == 11))) || (((!(a28 == 7) && a19 == 1) && !(a25 == 1)) && a11 == 1)) || (a28 == 9 && (!(a19 == 1) && a25 == 1) && a11 == 1)) || (!(a28 == 9) && (!(a19 == 1) && !(1 == a11)) && !(a28 == 11))) || ((!(a19 == 1) && !(a25 == 1)) && a28 == 7)) || (!(a28 == 7) && (!(a25 == 1) && !(1 == a11)) && !(a28 == 11))) || (((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1)) || (!(a28 == 7) && ((((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1) || ((a19 == 1 && a25 == 1) && !(1 == a11)))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 13.2s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 1452 SDtfs, 2865 SDslu, 352 SDs, 0 SdLazy, 6658 SolverSat, 1203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 202 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2133occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 3597 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 325 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5382 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4186 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2048 NumberOfCodeBlocks, 2048 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2036 ConstructedInterpolants, 0 QuantifiedInterpolants, 1121265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 717/720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...