./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label10.c -s /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/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 493bf8cee78cb31244d4d228e02bcd932957f60a ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 15:14:42,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:14:42,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:14:42,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:14:42,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:14:42,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:14:42,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:14:42,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:14:42,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:14:42,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:14:42,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:14:42,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:14:42,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:14:42,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:14:42,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:14:42,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:14:42,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:14:42,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:14:42,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:14:42,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:14:42,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:14:42,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:14:42,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:14:42,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:14:42,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:14:42,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:14:42,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:14:42,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:14:42,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:14:42,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:14:42,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:14:42,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:14:42,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:14:42,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:14:42,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:14:42,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:14:42,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:14:42,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:14:42,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:14:42,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:14:42,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:14:42,873 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 15:14:42,883 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:14:42,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:14:42,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:14:42,884 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:14:42,884 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:14:42,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:14:42,884 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:14:42,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:14:42,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:14:42,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:14:42,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:14:42,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:14:42,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:14:42,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:14:42,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:14:42,885 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:14:42,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:14:42,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:14:42,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:14:42,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:14:42,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:14:42,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:14:42,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:14:42,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:14:42,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:14:42,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:14:42,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:14:42,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:14:42,887 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:14:42,887 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_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/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 -> 493bf8cee78cb31244d4d228e02bcd932957f60a [2019-12-07 15:14:42,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:14:42,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:14:42,996 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:14:42,997 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:14:42,998 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:14:42,998 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label10.c [2019-12-07 15:14:43,042 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/data/464462ee9/918cf155ccf04535b402dc2e5584055d/FLAGaca949b13 [2019-12-07 15:14:43,531 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:14:43,531 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/sv-benchmarks/c/eca-rers2012/Problem11_label10.c [2019-12-07 15:14:43,541 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/data/464462ee9/918cf155ccf04535b402dc2e5584055d/FLAGaca949b13 [2019-12-07 15:14:43,551 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/data/464462ee9/918cf155ccf04535b402dc2e5584055d [2019-12-07 15:14:43,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:14:43,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:14:43,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:14:43,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:14:43,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:14:43,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:14:43" (1/1) ... [2019-12-07 15:14:43,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c98af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:14:43, skipping insertion in model container [2019-12-07 15:14:43,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:14:43" (1/1) ... [2019-12-07 15:14:43,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:14:43,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:14:43,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:14:43,901 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:14:43,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:14:44,002 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:14:44,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:14:44 WrapperNode [2019-12-07 15:14:44,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:14:44,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:14:44,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:14:44,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:14:44,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:14:44" (1/1) ... [2019-12-07 15:14:44,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:14:44" (1/1) ... [2019-12-07 15:14:44,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:14:44,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:14:44,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:14:44,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:14:44,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:14:44" (1/1) ... [2019-12-07 15:14:44,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:14:44" (1/1) ... [2019-12-07 15:14:44,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:14:44" (1/1) ... [2019-12-07 15:14:44,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:14:44" (1/1) ... [2019-12-07 15:14:44,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:14:44" (1/1) ... [2019-12-07 15:14:44,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:14:44" (1/1) ... [2019-12-07 15:14:44,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:14:44" (1/1) ... [2019-12-07 15:14:44,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:14:44,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:14:44,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:14:44,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:14:44,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:14:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/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-12-07 15:14:44,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:14:44,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:14:45,225 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:14:45,226 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 15:14:45,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:14:45 BoogieIcfgContainer [2019-12-07 15:14:45,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:14:45,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:14:45,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:14:45,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:14:45,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:14:43" (1/3) ... [2019-12-07 15:14:45,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fab10cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:14:45, skipping insertion in model container [2019-12-07 15:14:45,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:14:44" (2/3) ... [2019-12-07 15:14:45,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fab10cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:14:45, skipping insertion in model container [2019-12-07 15:14:45,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:14:45" (3/3) ... [2019-12-07 15:14:45,232 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label10.c [2019-12-07 15:14:45,239 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:14:45,244 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 15:14:45,252 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 15:14:45,272 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:14:45,272 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:14:45,272 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:14:45,272 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:14:45,272 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:14:45,272 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:14:45,272 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:14:45,272 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:14:45,288 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-12-07 15:14:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 15:14:45,292 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:14:45,293 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] [2019-12-07 15:14:45,293 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:14:45,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:14:45,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1644072970, now seen corresponding path program 1 times [2019-12-07 15:14:45,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:14:45,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121124732] [2019-12-07 15:14:45,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:14:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:14:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:14:45,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121124732] [2019-12-07 15:14:45,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:14:45,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:14:45,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978925813] [2019-12-07 15:14:45,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:14:45,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:14:45,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:14:45,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:14:45,483 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-12-07 15:14:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:14:46,754 INFO L93 Difference]: Finished difference Result 973 states and 1743 transitions. [2019-12-07 15:14:46,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:14:46,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 15:14:46,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:14:46,767 INFO L225 Difference]: With dead ends: 973 [2019-12-07 15:14:46,767 INFO L226 Difference]: Without dead ends: 607 [2019-12-07 15:14:46,770 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-12-07 15:14:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-07 15:14:46,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2019-12-07 15:14:46,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-07 15:14:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 874 transitions. [2019-12-07 15:14:46,821 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 874 transitions. Word has length 22 [2019-12-07 15:14:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:14:46,821 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 874 transitions. [2019-12-07 15:14:46,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:14:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 874 transitions. [2019-12-07 15:14:46,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 15:14:46,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:14:46,824 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:14:46,824 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:14:46,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:14:46,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1871415266, now seen corresponding path program 1 times [2019-12-07 15:14:46,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:14:46,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998406950] [2019-12-07 15:14:46,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:14:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:14:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:14:46,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998406950] [2019-12-07 15:14:46,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:14:46,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:14:46,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442403069] [2019-12-07 15:14:46,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:14:46,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:14:46,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:14:46,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:14:46,929 INFO L87 Difference]: Start difference. First operand 604 states and 874 transitions. Second operand 4 states. [2019-12-07 15:14:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:14:47,940 INFO L93 Difference]: Finished difference Result 2328 states and 3390 transitions. [2019-12-07 15:14:47,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:14:47,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-12-07 15:14:47,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:14:47,950 INFO L225 Difference]: With dead ends: 2328 [2019-12-07 15:14:47,950 INFO L226 Difference]: Without dead ends: 1726 [2019-12-07 15:14:47,953 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-12-07 15:14:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-12-07 15:14:47,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1710. [2019-12-07 15:14:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-12-07 15:14:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2342 transitions. [2019-12-07 15:14:47,993 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2342 transitions. Word has length 90 [2019-12-07 15:14:47,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:14:47,993 INFO L462 AbstractCegarLoop]: Abstraction has 1710 states and 2342 transitions. [2019-12-07 15:14:47,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:14:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2342 transitions. [2019-12-07 15:14:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 15:14:47,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:14:47,996 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 15:14:47,996 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:14:47,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:14:47,996 INFO L82 PathProgramCache]: Analyzing trace with hash 488148353, now seen corresponding path program 1 times [2019-12-07 15:14:47,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:14:47,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108112113] [2019-12-07 15:14:47,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:14:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:14:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:14:48,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108112113] [2019-12-07 15:14:48,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:14:48,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:14:48,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833851559] [2019-12-07 15:14:48,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:14:48,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:14:48,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:14:48,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:14:48,083 INFO L87 Difference]: Start difference. First operand 1710 states and 2342 transitions. Second operand 3 states. [2019-12-07 15:14:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:14:48,675 INFO L93 Difference]: Finished difference Result 4707 states and 6454 transitions. [2019-12-07 15:14:48,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:14:48,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-12-07 15:14:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:14:48,686 INFO L225 Difference]: With dead ends: 4707 [2019-12-07 15:14:48,686 INFO L226 Difference]: Without dead ends: 2999 [2019-12-07 15:14:48,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-07 15:14:48,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2019-12-07 15:14:48,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2999. [2019-12-07 15:14:48,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-12-07 15:14:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3735 transitions. [2019-12-07 15:14:48,728 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3735 transitions. Word has length 116 [2019-12-07 15:14:48,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:14:48,729 INFO L462 AbstractCegarLoop]: Abstraction has 2999 states and 3735 transitions. [2019-12-07 15:14:48,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:14:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3735 transitions. [2019-12-07 15:14:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-07 15:14:48,730 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:14:48,730 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:14:48,730 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:14:48,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:14:48,731 INFO L82 PathProgramCache]: Analyzing trace with hash 251283053, now seen corresponding path program 1 times [2019-12-07 15:14:48,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:14:48,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423795812] [2019-12-07 15:14:48,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:14:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:14:48,833 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 15:14:48,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423795812] [2019-12-07 15:14:48,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581440574] [2019-12-07 15:14:48,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/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-12-07 15:14:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:14:48,887 INFO L264 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:14:48,894 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:14:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 15:14:48,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:14:48,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-12-07 15:14:48,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671558646] [2019-12-07 15:14:48,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:14:48,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:14:48,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:14:48,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:14:48,940 INFO L87 Difference]: Start difference. First operand 2999 states and 3735 transitions. Second operand 3 states. [2019-12-07 15:14:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:14:49,666 INFO L93 Difference]: Finished difference Result 7658 states and 9369 transitions. [2019-12-07 15:14:49,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:14:49,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-12-07 15:14:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:14:49,683 INFO L225 Difference]: With dead ends: 7658 [2019-12-07 15:14:49,683 INFO L226 Difference]: Without dead ends: 4661 [2019-12-07 15:14:49,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 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-12-07 15:14:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4661 states. [2019-12-07 15:14:49,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4661 to 4660. [2019-12-07 15:14:49,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-07 15:14:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 5631 transitions. [2019-12-07 15:14:49,750 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 5631 transitions. Word has length 144 [2019-12-07 15:14:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:14:49,750 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 5631 transitions. [2019-12-07 15:14:49,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:14:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 5631 transitions. [2019-12-07 15:14:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 15:14:49,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:14:49,752 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:14:49,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:14:49,953 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:14:49,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:14:49,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2122268031, now seen corresponding path program 1 times [2019-12-07 15:14:49,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:14:49,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636111668] [2019-12-07 15:14:49,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:14:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:14:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:14:50,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636111668] [2019-12-07 15:14:50,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:14:50,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:14:50,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682695315] [2019-12-07 15:14:50,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:14:50,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:14:50,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:14:50,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:14:50,028 INFO L87 Difference]: Start difference. First operand 4660 states and 5631 transitions. Second operand 4 states. [2019-12-07 15:14:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:14:51,157 INFO L93 Difference]: Finished difference Result 10812 states and 13165 transitions. [2019-12-07 15:14:51,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:14:51,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 15:14:51,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:14:51,201 INFO L225 Difference]: With dead ends: 10812 [2019-12-07 15:14:51,201 INFO L226 Difference]: Without dead ends: 6338 [2019-12-07 15:14:51,207 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-12-07 15:14:51,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2019-12-07 15:14:51,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 5948. [2019-12-07 15:14:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5948 states. [2019-12-07 15:14:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5948 states to 5948 states and 7113 transitions. [2019-12-07 15:14:51,297 INFO L78 Accepts]: Start accepts. Automaton has 5948 states and 7113 transitions. Word has length 149 [2019-12-07 15:14:51,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:14:51,298 INFO L462 AbstractCegarLoop]: Abstraction has 5948 states and 7113 transitions. [2019-12-07 15:14:51,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:14:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 5948 states and 7113 transitions. [2019-12-07 15:14:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-12-07 15:14:51,301 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:14:51,301 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 15:14:51,301 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:14:51,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:14:51,301 INFO L82 PathProgramCache]: Analyzing trace with hash -205904018, now seen corresponding path program 1 times [2019-12-07 15:14:51,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:14:51,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4798242] [2019-12-07 15:14:51,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:14:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:14:51,467 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:14:51,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4798242] [2019-12-07 15:14:51,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:14:51,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:14:51,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113400908] [2019-12-07 15:14:51,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:14:51,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:14:51,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:14:51,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:14:51,468 INFO L87 Difference]: Start difference. First operand 5948 states and 7113 transitions. Second operand 5 states. [2019-12-07 15:14:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:14:52,880 INFO L93 Difference]: Finished difference Result 14851 states and 17825 transitions. [2019-12-07 15:14:52,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:14:52,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2019-12-07 15:14:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:14:52,908 INFO L225 Difference]: With dead ends: 14851 [2019-12-07 15:14:52,908 INFO L226 Difference]: Without dead ends: 9089 [2019-12-07 15:14:52,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:14:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9089 states. [2019-12-07 15:14:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9089 to 7792. [2019-12-07 15:14:53,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7792 states. [2019-12-07 15:14:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7792 states to 7792 states and 9410 transitions. [2019-12-07 15:14:53,022 INFO L78 Accepts]: Start accepts. Automaton has 7792 states and 9410 transitions. Word has length 234 [2019-12-07 15:14:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:14:53,022 INFO L462 AbstractCegarLoop]: Abstraction has 7792 states and 9410 transitions. [2019-12-07 15:14:53,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:14:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 7792 states and 9410 transitions. [2019-12-07 15:14:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-12-07 15:14:53,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:14:53,025 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 15:14:53,025 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:14:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:14:53,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1458513703, now seen corresponding path program 1 times [2019-12-07 15:14:53,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:14:53,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749728922] [2019-12-07 15:14:53,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:14:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:14:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:14:53,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749728922] [2019-12-07 15:14:53,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:14:53,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:14:53,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925728891] [2019-12-07 15:14:53,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:14:53,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:14:53,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:14:53,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:14:53,134 INFO L87 Difference]: Start difference. First operand 7792 states and 9410 transitions. Second operand 4 states. [2019-12-07 15:14:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:14:54,317 INFO L93 Difference]: Finished difference Result 15396 states and 18626 transitions. [2019-12-07 15:14:54,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:14:54,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2019-12-07 15:14:54,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:14:54,351 INFO L225 Difference]: With dead ends: 15396 [2019-12-07 15:14:54,351 INFO L226 Difference]: Without dead ends: 7790 [2019-12-07 15:14:54,357 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-12-07 15:14:54,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7790 states. [2019-12-07 15:14:54,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7790 to 7606. [2019-12-07 15:14:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-07 15:14:54,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 8865 transitions. [2019-12-07 15:14:54,419 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 8865 transitions. Word has length 234 [2019-12-07 15:14:54,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:14:54,419 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 8865 transitions. [2019-12-07 15:14:54,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:14:54,419 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 8865 transitions. [2019-12-07 15:14:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-12-07 15:14:54,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:14:54,422 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 15:14:54,422 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:14:54,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:14:54,422 INFO L82 PathProgramCache]: Analyzing trace with hash 947970210, now seen corresponding path program 1 times [2019-12-07 15:14:54,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:14:54,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774983940] [2019-12-07 15:14:54,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:14:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:14:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 19 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:14:54,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774983940] [2019-12-07 15:14:54,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36558694] [2019-12-07 15:14:54,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:14:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:14:54,897 INFO L264 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 15:14:54,902 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:14:54,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:14:54,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:14:54,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:14:54,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:14:54,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:14:54,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:14:54,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:14:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 74 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:14:55,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:14:55,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-12-07 15:14:55,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099683617] [2019-12-07 15:14:55,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 15:14:55,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:14:55,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 15:14:55,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:14:55,072 INFO L87 Difference]: Start difference. First operand 7606 states and 8865 transitions. Second operand 11 states. [2019-12-07 15:14:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:14:59,199 INFO L93 Difference]: Finished difference Result 20272 states and 23752 transitions. [2019-12-07 15:14:59,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 15:14:59,199 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 236 [2019-12-07 15:14:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:14:59,217 INFO L225 Difference]: With dead ends: 20272 [2019-12-07 15:14:59,217 INFO L226 Difference]: Without dead ends: 12852 [2019-12-07 15:14:59,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 233 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-12-07 15:14:59,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12852 states. [2019-12-07 15:14:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12852 to 11464. [2019-12-07 15:14:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11464 states. [2019-12-07 15:14:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11464 states to 11464 states and 13099 transitions. [2019-12-07 15:14:59,362 INFO L78 Accepts]: Start accepts. Automaton has 11464 states and 13099 transitions. Word has length 236 [2019-12-07 15:14:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:14:59,362 INFO L462 AbstractCegarLoop]: Abstraction has 11464 states and 13099 transitions. [2019-12-07 15:14:59,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 15:14:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 11464 states and 13099 transitions. [2019-12-07 15:14:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-12-07 15:14:59,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:14:59,369 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 15:14:59,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:14:59,570 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:14:59,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:14:59,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1148903582, now seen corresponding path program 1 times [2019-12-07 15:14:59,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:14:59,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801535253] [2019-12-07 15:14:59,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:14:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:14:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 125 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:14:59,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801535253] [2019-12-07 15:14:59,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303190570] [2019-12-07 15:14:59,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:14:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:14:59,912 INFO L264 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 15:14:59,916 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:15:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:15:00,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:15:00,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-12-07 15:15:00,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315920710] [2019-12-07 15:15:00,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:15:00,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:15:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:15:00,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:15:00,041 INFO L87 Difference]: Start difference. First operand 11464 states and 13099 transitions. Second operand 4 states. [2019-12-07 15:15:00,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:15:00,822 INFO L93 Difference]: Finished difference Result 24401 states and 27912 transitions. [2019-12-07 15:15:00,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:15:00,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-12-07 15:15:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:15:00,836 INFO L225 Difference]: With dead ends: 24401 [2019-12-07 15:15:00,837 INFO L226 Difference]: Without dead ends: 12939 [2019-12-07 15:15:00,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:15:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12939 states. [2019-12-07 15:15:00,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12939 to 11094. [2019-12-07 15:15:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11094 states. [2019-12-07 15:15:00,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11094 states to 11094 states and 12658 transitions. [2019-12-07 15:15:00,939 INFO L78 Accepts]: Start accepts. Automaton has 11094 states and 12658 transitions. Word has length 255 [2019-12-07 15:15:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:15:00,939 INFO L462 AbstractCegarLoop]: Abstraction has 11094 states and 12658 transitions. [2019-12-07 15:15:00,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:15:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 11094 states and 12658 transitions. [2019-12-07 15:15:00,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-12-07 15:15:00,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:15:00,943 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-12-07 15:15:01,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:15:01,144 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:15:01,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:15:01,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1477636383, now seen corresponding path program 1 times [2019-12-07 15:15:01,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:15:01,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162756722] [2019-12-07 15:15:01,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:15:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:15:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-12-07 15:15:01,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162756722] [2019-12-07 15:15:01,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:15:01,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:15:01,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527641700] [2019-12-07 15:15:01,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:15:01,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:15:01,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:15:01,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:15:01,311 INFO L87 Difference]: Start difference. First operand 11094 states and 12658 transitions. Second operand 4 states. [2019-12-07 15:15:03,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:15:03,030 INFO L93 Difference]: Finished difference Result 24049 states and 27405 transitions. [2019-12-07 15:15:03,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:15:03,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-12-07 15:15:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:15:03,043 INFO L225 Difference]: With dead ends: 24049 [2019-12-07 15:15:03,043 INFO L226 Difference]: Without dead ends: 13141 [2019-12-07 15:15:03,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-07 15:15:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13141 states. [2019-12-07 15:15:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13141 to 11462. [2019-12-07 15:15:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11462 states. [2019-12-07 15:15:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11462 states to 11462 states and 12860 transitions. [2019-12-07 15:15:03,143 INFO L78 Accepts]: Start accepts. Automaton has 11462 states and 12860 transitions. Word has length 304 [2019-12-07 15:15:03,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:15:03,144 INFO L462 AbstractCegarLoop]: Abstraction has 11462 states and 12860 transitions. [2019-12-07 15:15:03,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:15:03,144 INFO L276 IsEmpty]: Start isEmpty. Operand 11462 states and 12860 transitions. [2019-12-07 15:15:03,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-12-07 15:15:03,148 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:15:03,148 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 15:15:03,149 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:15:03,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:15:03,149 INFO L82 PathProgramCache]: Analyzing trace with hash 56979324, now seen corresponding path program 1 times [2019-12-07 15:15:03,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:15:03,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350523843] [2019-12-07 15:15:03,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:15:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:15:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 224 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:15:03,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350523843] [2019-12-07 15:15:03,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905520283] [2019-12-07 15:15:03,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:15:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:15:03,489 INFO L264 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 15:15:03,492 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:15:03,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:03,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 59 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 15:15:04,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:15:04,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2019-12-07 15:15:04,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528815594] [2019-12-07 15:15:04,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 15:15:04,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:15:04,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 15:15:04,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:15:04,157 INFO L87 Difference]: Start difference. First operand 11462 states and 12860 transitions. Second operand 9 states. [2019-12-07 15:15:10,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:15:10,152 INFO L93 Difference]: Finished difference Result 27175 states and 30424 transitions. [2019-12-07 15:15:10,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 15:15:10,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 331 [2019-12-07 15:15:10,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:15:10,167 INFO L225 Difference]: With dead ends: 27175 [2019-12-07 15:15:10,167 INFO L226 Difference]: Without dead ends: 15347 [2019-12-07 15:15:10,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-07 15:15:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15347 states. [2019-12-07 15:15:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15347 to 10909. [2019-12-07 15:15:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10909 states. [2019-12-07 15:15:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10909 states to 10909 states and 12066 transitions. [2019-12-07 15:15:10,267 INFO L78 Accepts]: Start accepts. Automaton has 10909 states and 12066 transitions. Word has length 331 [2019-12-07 15:15:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:15:10,267 INFO L462 AbstractCegarLoop]: Abstraction has 10909 states and 12066 transitions. [2019-12-07 15:15:10,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 15:15:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 10909 states and 12066 transitions. [2019-12-07 15:15:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-12-07 15:15:10,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:15:10,272 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 15:15:10,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:15:10,473 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:15:10,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:15:10,474 INFO L82 PathProgramCache]: Analyzing trace with hash -694285539, now seen corresponding path program 1 times [2019-12-07 15:15:10,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:15:10,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328893206] [2019-12-07 15:15:10,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:15:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:15:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 15:15:10,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328893206] [2019-12-07 15:15:10,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:15:10,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:15:10,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213725457] [2019-12-07 15:15:10,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:15:10,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:15:10,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:15:10,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:15:10,676 INFO L87 Difference]: Start difference. First operand 10909 states and 12066 transitions. Second operand 5 states. [2019-12-07 15:15:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:15:12,781 INFO L93 Difference]: Finished difference Result 30478 states and 33633 transitions. [2019-12-07 15:15:12,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:15:12,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 349 [2019-12-07 15:15:12,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:15:12,793 INFO L225 Difference]: With dead ends: 30478 [2019-12-07 15:15:12,794 INFO L226 Difference]: Without dead ends: 18649 [2019-12-07 15:15:12,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:15:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18649 states. [2019-12-07 15:15:12,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18649 to 16798. [2019-12-07 15:15:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16798 states. [2019-12-07 15:15:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16798 states to 16798 states and 18332 transitions. [2019-12-07 15:15:12,936 INFO L78 Accepts]: Start accepts. Automaton has 16798 states and 18332 transitions. Word has length 349 [2019-12-07 15:15:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:15:12,937 INFO L462 AbstractCegarLoop]: Abstraction has 16798 states and 18332 transitions. [2019-12-07 15:15:12,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:15:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 16798 states and 18332 transitions. [2019-12-07 15:15:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-12-07 15:15:12,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:15:12,943 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 15:15:12,943 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:15:12,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:15:12,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1891793115, now seen corresponding path program 1 times [2019-12-07 15:15:12,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:15:12,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360936361] [2019-12-07 15:15:12,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:15:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:15:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 89 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:15:13,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360936361] [2019-12-07 15:15:13,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220360563] [2019-12-07 15:15:13,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:15:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:15:13,627 INFO L264 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 15:15:13,630 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:15:13,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:15:13,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:13,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:13,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 157 proven. 205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:15:14,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:15:14,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-12-07 15:15:14,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381569405] [2019-12-07 15:15:14,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 15:15:14,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:15:14,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 15:15:14,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-07 15:15:14,120 INFO L87 Difference]: Start difference. First operand 16798 states and 18332 transitions. Second operand 15 states. [2019-12-07 15:15:17,182 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-12-07 15:15:18,385 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-12-07 15:15:24,894 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-12-07 15:15:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:15:25,087 INFO L93 Difference]: Finished difference Result 33830 states and 36818 transitions. [2019-12-07 15:15:25,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 15:15:25,089 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 373 [2019-12-07 15:15:25,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:15:25,111 INFO L225 Difference]: With dead ends: 33830 [2019-12-07 15:15:25,111 INFO L226 Difference]: Without dead ends: 19060 [2019-12-07 15:15:25,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=472, Invalid=1508, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 15:15:25,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19060 states. [2019-12-07 15:15:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19060 to 15322. [2019-12-07 15:15:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15322 states. [2019-12-07 15:15:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15322 states to 15322 states and 16687 transitions. [2019-12-07 15:15:25,258 INFO L78 Accepts]: Start accepts. Automaton has 15322 states and 16687 transitions. Word has length 373 [2019-12-07 15:15:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:15:25,258 INFO L462 AbstractCegarLoop]: Abstraction has 15322 states and 16687 transitions. [2019-12-07 15:15:25,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 15:15:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 15322 states and 16687 transitions. [2019-12-07 15:15:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-12-07 15:15:25,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:15:25,265 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 15:15:25,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:15:25,466 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:15:25,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:15:25,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1552182285, now seen corresponding path program 1 times [2019-12-07 15:15:25,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:15:25,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764643413] [2019-12-07 15:15:25,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:15:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:15:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 360 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:15:25,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764643413] [2019-12-07 15:15:25,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636772193] [2019-12-07 15:15:25,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:15:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:15:25,856 INFO L264 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 15:15:25,859 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:15:25,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:25,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 149 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:15:26,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:15:26,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2019-12-07 15:15:26,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716910303] [2019-12-07 15:15:26,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 15:15:26,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:15:26,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 15:15:26,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:15:26,578 INFO L87 Difference]: Start difference. First operand 15322 states and 16687 transitions. Second operand 10 states. [2019-12-07 15:15:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:15:34,990 INFO L93 Difference]: Finished difference Result 33044 states and 35984 transitions. [2019-12-07 15:15:34,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 15:15:34,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 417 [2019-12-07 15:15:34,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:15:35,007 INFO L225 Difference]: With dead ends: 33044 [2019-12-07 15:15:35,007 INFO L226 Difference]: Without dead ends: 19382 [2019-12-07 15:15:35,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-12-07 15:15:35,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19382 states. [2019-12-07 15:15:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19382 to 13478. [2019-12-07 15:15:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13478 states. [2019-12-07 15:15:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13478 states to 13478 states and 14562 transitions. [2019-12-07 15:15:35,145 INFO L78 Accepts]: Start accepts. Automaton has 13478 states and 14562 transitions. Word has length 417 [2019-12-07 15:15:35,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:15:35,145 INFO L462 AbstractCegarLoop]: Abstraction has 13478 states and 14562 transitions. [2019-12-07 15:15:35,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 15:15:35,145 INFO L276 IsEmpty]: Start isEmpty. Operand 13478 states and 14562 transitions. [2019-12-07 15:15:35,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-12-07 15:15:35,151 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:15:35,152 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 15:15:35,352 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:15:35,353 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:15:35,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:15:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2027911698, now seen corresponding path program 1 times [2019-12-07 15:15:35,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:15:35,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733092962] [2019-12-07 15:15:35,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:15:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:15:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-12-07 15:15:35,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733092962] [2019-12-07 15:15:35,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:15:35,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:15:35,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441303035] [2019-12-07 15:15:35,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:15:35,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:15:35,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:15:35,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:15:35,540 INFO L87 Difference]: Start difference. First operand 13478 states and 14562 transitions. Second operand 3 states. [2019-12-07 15:15:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:15:36,217 INFO L93 Difference]: Finished difference Result 26584 states and 28655 transitions. [2019-12-07 15:15:36,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:15:36,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2019-12-07 15:15:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:15:36,228 INFO L225 Difference]: With dead ends: 26584 [2019-12-07 15:15:36,228 INFO L226 Difference]: Without dead ends: 14582 [2019-12-07 15:15:36,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:15:36,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14582 states. [2019-12-07 15:15:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14582 to 12740. [2019-12-07 15:15:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12740 states. [2019-12-07 15:15:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12740 states to 12740 states and 13712 transitions. [2019-12-07 15:15:36,342 INFO L78 Accepts]: Start accepts. Automaton has 12740 states and 13712 transitions. Word has length 417 [2019-12-07 15:15:36,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:15:36,342 INFO L462 AbstractCegarLoop]: Abstraction has 12740 states and 13712 transitions. [2019-12-07 15:15:36,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:15:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 12740 states and 13712 transitions. [2019-12-07 15:15:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2019-12-07 15:15:36,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:15:36,358 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:15:36,358 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:15:36,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:15:36,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1498430217, now seen corresponding path program 1 times [2019-12-07 15:15:36,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:15:36,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414628440] [2019-12-07 15:15:36,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:15:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:15:36,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 859 proven. 20 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-12-07 15:15:36,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414628440] [2019-12-07 15:15:36,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564133375] [2019-12-07 15:15:36,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:15:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:15:36,990 INFO L264 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 15:15:36,994 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:15:37,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:37,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:37,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:37,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:37,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:15:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 697 proven. 440 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 15:15:38,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:15:38,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-12-07 15:15:38,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125042133] [2019-12-07 15:15:38,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 15:15:38,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:15:38,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 15:15:38,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:15:38,225 INFO L87 Difference]: Start difference. First operand 12740 states and 13712 transitions. Second operand 11 states. [2019-12-07 15:15:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:15:47,022 INFO L93 Difference]: Finished difference Result 27149 states and 29197 transitions. [2019-12-07 15:15:47,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 15:15:47,023 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 701 [2019-12-07 15:15:47,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:15:47,026 INFO L225 Difference]: With dead ends: 27149 [2019-12-07 15:15:47,026 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 15:15:47,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2019-12-07 15:15:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 15:15:47,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 15:15:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 15:15:47,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 15:15:47,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 701 [2019-12-07 15:15:47,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:15:47,039 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 15:15:47,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 15:15:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 15:15:47,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 15:15:47,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:15:47,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 15:15:48,050 WARN L192 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 797 DAG size of output: 521 [2019-12-07 15:15:48,726 WARN L192 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 791 DAG size of output: 518 [2019-12-07 15:15:52,994 WARN L192 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 443 DAG size of output: 131 [2019-12-07 15:15:57,373 WARN L192 SmtUtils]: Spent 4.38 s on a formula simplification. DAG size of input: 443 DAG size of output: 131 [2019-12-07 15:15:57,376 INFO L246 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2019-12-07 15:15:57,376 INFO L246 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2019-12-07 15:15:57,376 INFO L246 CegarLoopResult]: For program point L36(line 36) no Hoare annotation was computed. [2019-12-07 15:15:57,376 INFO L249 CegarLoopResult]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-12-07 15:15:57,376 INFO L246 CegarLoopResult]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,376 INFO L246 CegarLoopResult]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,376 INFO L246 CegarLoopResult]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,376 INFO L246 CegarLoopResult]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,376 INFO L246 CegarLoopResult]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,376 INFO L246 CegarLoopResult]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,376 INFO L246 CegarLoopResult]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,377 INFO L246 CegarLoopResult]: For program point L171(line 171) no Hoare annotation was computed. [2019-12-07 15:15:57,377 INFO L246 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2019-12-07 15:15:57,377 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-12-07 15:15:57,377 INFO L246 CegarLoopResult]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,377 INFO L246 CegarLoopResult]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,377 INFO L246 CegarLoopResult]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,377 INFO L246 CegarLoopResult]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,377 INFO L246 CegarLoopResult]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,377 INFO L246 CegarLoopResult]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,377 INFO L246 CegarLoopResult]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,377 INFO L246 CegarLoopResult]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,378 INFO L246 CegarLoopResult]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,378 INFO L246 CegarLoopResult]: For program point L174(line 174) no Hoare annotation was computed. [2019-12-07 15:15:57,378 INFO L246 CegarLoopResult]: For program point L108(line 108) no Hoare annotation was computed. [2019-12-07 15:15:57,378 INFO L246 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2019-12-07 15:15:57,378 INFO L246 CegarLoopResult]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,378 INFO L242 CegarLoopResult]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse22 (= ~a25~0 10))) (let ((.cse25 (+ ~a23~0 43)) (.cse9 (= ~a25~0 11)) (.cse2 (= 1 ~a3~0)) (.cse20 (<= ~a25~0 9)) (.cse3 (= 15 ~a8~0)) (.cse24 (< 277 ~a29~0)) (.cse8 (= 1 ~a4~0)) (.cse18 (not .cse22)) (.cse23 (= ~a25~0 13))) (let ((.cse7 (exists ((v_prenex_4 Int)) (and (<= 0 v_prenex_4) (<= ~a29~0 (+ (mod v_prenex_4 299861) 300139)) (< 277 v_prenex_4)))) (.cse16 (not .cse23)) (.cse13 (<= (+ ~a29~0 292032) 0)) (.cse19 (<= ~a29~0 130)) (.cse0 (= ~a25~0 12)) (.cse11 (<= ~a29~0 275)) (.cse12 (or (and .cse2 .cse3 .cse24 .cse8 .cse9 .cse18) (and .cse2 .cse3 .cse22 .cse24 .cse8) (and .cse2 .cse20 .cse3 .cse24 .cse8 .cse18))) (.cse5 (<= ~a23~0 312)) (.cse6 (< 0 .cse25)) (.cse10 (< 140 ~a29~0)) (.cse21 (<= ~a29~0 245)) (.cse1 (<= ~a4~0 0)) (.cse17 (<= ~a29~0 599998)) (.cse4 (<= .cse25 0))) (or (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse0 .cse1 .cse2 (<= (+ ~a29~0 22) 0) (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse7 .cse3 .cse8 .cse9) (and (or (and .cse0 .cse2 .cse10 .cse11 .cse3) (and .cse2 .cse10 .cse11 .cse3 .cse9)) .cse8) (and .cse7 .cse12) (and .cse0 .cse2 .cse13 .cse3 .cse8) (and .cse6 (<= 13 ~a25~0) .cse2 (exists ((v_~a29~0_504 Int)) (let ((.cse14 (+ v_~a29~0_504 69157))) (and (<= ~a29~0 (+ (mod .cse14 299861) 300138)) (<= 0 .cse14) (<= 130 v_~a29~0_504)))) .cse3 .cse8) (and .cse6 .cse2 .cse10 .cse3 (<= ~a29~0 277) .cse8) (and .cse1 .cse2 .cse11 .cse3 .cse9 .cse4) (and (exists ((v_~a29~0_502 Int)) (let ((.cse15 (mod v_~a29~0_502 299861))) (and (< 140 v_~a29~0_502) (= .cse15 0) (<= (+ .cse15 10250) ~a29~0)))) .cse1 .cse2 .cse16 .cse17 .cse3 .cse4 .cse18) (and .cse0 .cse1 .cse2 .cse13 .cse3) (and .cse0 .cse5 .cse2 .cse19 .cse3 .cse8) (and .cse1 .cse2 .cse16 .cse13 .cse3 .cse4) (and .cse2 .cse20 .cse11 .cse3 .cse8) (and .cse2 .cse3 .cse21 .cse8 .cse22) (and .cse1 .cse2 .cse19 .cse3 .cse22) (and .cse23 .cse2 .cse19 .cse3 .cse8) (and .cse0 .cse1 .cse10 .cse2 .cse11 .cse3) (and .cse12 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse3 .cse21) (and .cse23 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230) .cse2 .cse3 .cse24 .cse8 .cse18) (and .cse2 .cse10 .cse3 .cse21 .cse8) (and .cse1 .cse2 .cse17 .cse3 .cse9 .cse24 .cse4))))) [2019-12-07 15:15:57,378 INFO L246 CegarLoopResult]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,378 INFO L246 CegarLoopResult]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,379 INFO L246 CegarLoopResult]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,379 INFO L246 CegarLoopResult]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,379 INFO L246 CegarLoopResult]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,379 INFO L246 CegarLoopResult]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,379 INFO L246 CegarLoopResult]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,379 INFO L246 CegarLoopResult]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,379 INFO L246 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2019-12-07 15:15:57,379 INFO L246 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2019-12-07 15:15:57,379 INFO L246 CegarLoopResult]: For program point L45(line 45) no Hoare annotation was computed. [2019-12-07 15:15:57,379 INFO L246 CegarLoopResult]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-12-07 15:15:57,379 INFO L246 CegarLoopResult]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L180(line 180) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L48(line 48) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,380 INFO L246 CegarLoopResult]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L183(line 183) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L117(line 117) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,381 INFO L246 CegarLoopResult]: For program point L186(line 186) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L54(line 54) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L189(line 189) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-12-07 15:15:57,382 INFO L246 CegarLoopResult]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L192(line 192) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L60(line 60) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L195(line 195) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L63(line 63) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,383 INFO L246 CegarLoopResult]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 72) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L198(line 198) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L66(line 66) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,384 INFO L246 CegarLoopResult]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L201(line 201) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L204(line 204) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L72(line 72) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,385 INFO L246 CegarLoopResult]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L141(line 141) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L78(line 78) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,386 INFO L246 CegarLoopResult]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L147(line 147) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-12-07 15:15:57,387 INFO L246 CegarLoopResult]: For program point L84(line 84) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L87(line 87) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,388 INFO L246 CegarLoopResult]: For program point L156(line 156) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L159(line 159) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L93(line 93) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,389 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 15:15:57,390 INFO L246 CegarLoopResult]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,390 INFO L246 CegarLoopResult]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,390 INFO L246 CegarLoopResult]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,390 INFO L246 CegarLoopResult]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,390 INFO L246 CegarLoopResult]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,390 INFO L246 CegarLoopResult]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,390 INFO L246 CegarLoopResult]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,390 INFO L246 CegarLoopResult]: For program point L162(line 162) no Hoare annotation was computed. [2019-12-07 15:15:57,390 INFO L246 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2019-12-07 15:15:57,390 INFO L246 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2019-12-07 15:15:57,390 INFO L246 CegarLoopResult]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,390 INFO L246 CegarLoopResult]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-12-07 15:15:57,391 INFO L246 CegarLoopResult]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-12-07 15:15:57,391 INFO L246 CegarLoopResult]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,391 INFO L246 CegarLoopResult]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,391 INFO L246 CegarLoopResult]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,391 INFO L246 CegarLoopResult]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,391 INFO L246 CegarLoopResult]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,391 INFO L246 CegarLoopResult]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,391 INFO L246 CegarLoopResult]: For program point L165(line 165) no Hoare annotation was computed. [2019-12-07 15:15:57,391 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 15:15:57,391 INFO L246 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2019-12-07 15:15:57,391 INFO L246 CegarLoopResult]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,391 INFO L246 CegarLoopResult]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,391 INFO L246 CegarLoopResult]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,392 INFO L242 CegarLoopResult]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse22 (= ~a25~0 10))) (let ((.cse25 (+ ~a23~0 43)) (.cse9 (= ~a25~0 11)) (.cse2 (= 1 ~a3~0)) (.cse20 (<= ~a25~0 9)) (.cse3 (= 15 ~a8~0)) (.cse24 (< 277 ~a29~0)) (.cse8 (= 1 ~a4~0)) (.cse18 (not .cse22)) (.cse23 (= ~a25~0 13))) (let ((.cse7 (exists ((v_prenex_4 Int)) (and (<= 0 v_prenex_4) (<= ~a29~0 (+ (mod v_prenex_4 299861) 300139)) (< 277 v_prenex_4)))) (.cse16 (not .cse23)) (.cse13 (<= (+ ~a29~0 292032) 0)) (.cse19 (<= ~a29~0 130)) (.cse0 (= ~a25~0 12)) (.cse11 (<= ~a29~0 275)) (.cse12 (or (and .cse2 .cse3 .cse24 .cse8 .cse9 .cse18) (and .cse2 .cse3 .cse22 .cse24 .cse8) (and .cse2 .cse20 .cse3 .cse24 .cse8 .cse18))) (.cse5 (<= ~a23~0 312)) (.cse6 (< 0 .cse25)) (.cse10 (< 140 ~a29~0)) (.cse21 (<= ~a29~0 245)) (.cse1 (<= ~a4~0 0)) (.cse17 (<= ~a29~0 599998)) (.cse4 (<= .cse25 0))) (or (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse0 .cse1 .cse2 (<= (+ ~a29~0 22) 0) (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse3 .cse4) (and .cse5 .cse6 .cse2 .cse7 .cse3 .cse8 .cse9) (and (or (and .cse0 .cse2 .cse10 .cse11 .cse3) (and .cse2 .cse10 .cse11 .cse3 .cse9)) .cse8) (and .cse7 .cse12) (and .cse0 .cse2 .cse13 .cse3 .cse8) (and .cse6 (<= 13 ~a25~0) .cse2 (exists ((v_~a29~0_504 Int)) (let ((.cse14 (+ v_~a29~0_504 69157))) (and (<= ~a29~0 (+ (mod .cse14 299861) 300138)) (<= 0 .cse14) (<= 130 v_~a29~0_504)))) .cse3 .cse8) (and .cse6 .cse2 .cse10 .cse3 (<= ~a29~0 277) .cse8) (and .cse1 .cse2 .cse11 .cse3 .cse9 .cse4) (and (exists ((v_~a29~0_502 Int)) (let ((.cse15 (mod v_~a29~0_502 299861))) (and (< 140 v_~a29~0_502) (= .cse15 0) (<= (+ .cse15 10250) ~a29~0)))) .cse1 .cse2 .cse16 .cse17 .cse3 .cse4 .cse18) (and .cse0 .cse1 .cse2 .cse13 .cse3) (and .cse0 .cse5 .cse2 .cse19 .cse3 .cse8) (and .cse1 .cse2 .cse16 .cse13 .cse3 .cse4) (and .cse2 .cse20 .cse11 .cse3 .cse8) (and .cse2 .cse3 .cse21 .cse8 .cse22) (and .cse1 .cse2 .cse19 .cse3 .cse22) (and .cse23 .cse2 .cse19 .cse3 .cse8) (and .cse0 .cse1 .cse10 .cse2 .cse11 .cse3) (and .cse12 .cse4) (and .cse5 .cse1 .cse6 .cse2 .cse3 .cse21) (and .cse23 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230) .cse2 .cse3 .cse24 .cse8 .cse18) (and .cse2 .cse10 .cse3 .cse21 .cse8) (and .cse1 .cse2 .cse17 .cse3 .cse9 .cse24 .cse4))))) [2019-12-07 15:15:57,392 INFO L246 CegarLoopResult]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,392 INFO L246 CegarLoopResult]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-12-07 15:15:57,392 INFO L246 CegarLoopResult]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-12-07 15:15:57,392 INFO L246 CegarLoopResult]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,392 INFO L246 CegarLoopResult]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,392 INFO L246 CegarLoopResult]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-12-07 15:15:57,392 INFO L246 CegarLoopResult]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,392 INFO L246 CegarLoopResult]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,393 INFO L246 CegarLoopResult]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 15:15:57,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:15:57 BoogieIcfgContainer [2019-12-07 15:15:57,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:15:57,437 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:15:57,437 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:15:57,437 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:15:57,438 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:14:45" (3/4) ... [2019-12-07 15:15:57,441 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 15:15:57,463 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 15:15:57,464 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 15:15:57,485 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((!(3 == input) && a25 == 12) && a4 <= 0) && 1 == a3) && a29 + 22 <= 0) && !(1 == input)) && 15 == a8) && a23 + 43 <= 0) || ((((((a23 <= 312 && 0 < a23 + 43) && 1 == a3) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((((a25 == 12 && 1 == a3) && 140 < a29) && a29 <= 275) && 15 == a8) || ((((1 == a3 && 140 < a29) && a29 <= 275) && 15 == a8) && a25 == 11)) && 1 == a4)) || ((\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4) && (((((((1 == a3 && 15 == a8) && 277 < a29) && 1 == a4) && a25 == 11) && !(a25 == 10)) || ((((1 == a3 && 15 == a8) && a25 == 10) && 277 < a29) && 1 == a4)) || (((((1 == a3 && a25 <= 9) && 15 == a8) && 277 < a29) && 1 == a4) && !(a25 == 10))))) || ((((a25 == 12 && 1 == a3) && a29 + 292032 <= 0) && 15 == a8) && 1 == a4)) || (((((0 < a23 + 43 && 13 <= a25) && 1 == a3) && (\exists v_~a29~0_504 : int :: (a29 <= (v_~a29~0_504 + 69157) % 299861 + 300138 && 0 <= v_~a29~0_504 + 69157) && 130 <= v_~a29~0_504)) && 15 == a8) && 1 == a4)) || (((((0 < a23 + 43 && 1 == a3) && 140 < a29) && 15 == a8) && a29 <= 277) && 1 == a4)) || (((((a4 <= 0 && 1 == a3) && a29 <= 275) && 15 == a8) && a25 == 11) && a23 + 43 <= 0)) || ((((((((\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && v_~a29~0_502 % 299861 == 0) && v_~a29~0_502 % 299861 + 10250 <= a29) && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a29 <= 599998) && 15 == a8) && a23 + 43 <= 0) && !(a25 == 10))) || ((((a25 == 12 && a4 <= 0) && 1 == a3) && a29 + 292032 <= 0) && 15 == a8)) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && a29 <= 130) && 15 == a8) && 1 == a4)) || (((((a4 <= 0 && 1 == a3) && !(a25 == 13)) && a29 + 292032 <= 0) && 15 == a8) && a23 + 43 <= 0)) || ((((1 == a3 && a25 <= 9) && a29 <= 275) && 15 == a8) && 1 == a4)) || ((((1 == a3 && 15 == a8) && a29 <= 245) && 1 == a4) && a25 == 10)) || ((((a4 <= 0 && 1 == a3) && a29 <= 130) && 15 == a8) && a25 == 10)) || ((((a25 == 13 && 1 == a3) && a29 <= 130) && 15 == a8) && 1 == a4)) || (((((a25 == 12 && a4 <= 0) && 140 < a29) && 1 == a3) && a29 <= 275) && 15 == a8)) || ((((((((1 == a3 && 15 == a8) && 277 < a29) && 1 == a4) && a25 == 11) && !(a25 == 10)) || ((((1 == a3 && 15 == a8) && a25 == 10) && 277 < a29) && 1 == a4)) || (((((1 == a3 && a25 <= 9) && 15 == a8) && 277 < a29) && 1 == a4) && !(a25 == 10))) && a23 + 43 <= 0)) || (((((a23 <= 312 && a4 <= 0) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && a29 <= 245)) || ((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a3) && 15 == a8) && 277 < a29) && 1 == a4) && !(a25 == 10))) || ((((1 == a3 && 140 < a29) && 15 == a8) && a29 <= 245) && 1 == a4)) || ((((((a4 <= 0 && 1 == a3) && a29 <= 599998) && 15 == a8) && a25 == 11) && 277 < a29) && a23 + 43 <= 0) [2019-12-07 15:15:57,488 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((!(3 == input) && a25 == 12) && a4 <= 0) && 1 == a3) && a29 + 22 <= 0) && !(1 == input)) && 15 == a8) && a23 + 43 <= 0) || ((((((a23 <= 312 && 0 < a23 + 43) && 1 == a3) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((((a25 == 12 && 1 == a3) && 140 < a29) && a29 <= 275) && 15 == a8) || ((((1 == a3 && 140 < a29) && a29 <= 275) && 15 == a8) && a25 == 11)) && 1 == a4)) || ((\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4) && (((((((1 == a3 && 15 == a8) && 277 < a29) && 1 == a4) && a25 == 11) && !(a25 == 10)) || ((((1 == a3 && 15 == a8) && a25 == 10) && 277 < a29) && 1 == a4)) || (((((1 == a3 && a25 <= 9) && 15 == a8) && 277 < a29) && 1 == a4) && !(a25 == 10))))) || ((((a25 == 12 && 1 == a3) && a29 + 292032 <= 0) && 15 == a8) && 1 == a4)) || (((((0 < a23 + 43 && 13 <= a25) && 1 == a3) && (\exists v_~a29~0_504 : int :: (a29 <= (v_~a29~0_504 + 69157) % 299861 + 300138 && 0 <= v_~a29~0_504 + 69157) && 130 <= v_~a29~0_504)) && 15 == a8) && 1 == a4)) || (((((0 < a23 + 43 && 1 == a3) && 140 < a29) && 15 == a8) && a29 <= 277) && 1 == a4)) || (((((a4 <= 0 && 1 == a3) && a29 <= 275) && 15 == a8) && a25 == 11) && a23 + 43 <= 0)) || ((((((((\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && v_~a29~0_502 % 299861 == 0) && v_~a29~0_502 % 299861 + 10250 <= a29) && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a29 <= 599998) && 15 == a8) && a23 + 43 <= 0) && !(a25 == 10))) || ((((a25 == 12 && a4 <= 0) && 1 == a3) && a29 + 292032 <= 0) && 15 == a8)) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && a29 <= 130) && 15 == a8) && 1 == a4)) || (((((a4 <= 0 && 1 == a3) && !(a25 == 13)) && a29 + 292032 <= 0) && 15 == a8) && a23 + 43 <= 0)) || ((((1 == a3 && a25 <= 9) && a29 <= 275) && 15 == a8) && 1 == a4)) || ((((1 == a3 && 15 == a8) && a29 <= 245) && 1 == a4) && a25 == 10)) || ((((a4 <= 0 && 1 == a3) && a29 <= 130) && 15 == a8) && a25 == 10)) || ((((a25 == 13 && 1 == a3) && a29 <= 130) && 15 == a8) && 1 == a4)) || (((((a25 == 12 && a4 <= 0) && 140 < a29) && 1 == a3) && a29 <= 275) && 15 == a8)) || ((((((((1 == a3 && 15 == a8) && 277 < a29) && 1 == a4) && a25 == 11) && !(a25 == 10)) || ((((1 == a3 && 15 == a8) && a25 == 10) && 277 < a29) && 1 == a4)) || (((((1 == a3 && a25 <= 9) && 15 == a8) && 277 < a29) && 1 == a4) && !(a25 == 10))) && a23 + 43 <= 0)) || (((((a23 <= 312 && a4 <= 0) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && a29 <= 245)) || ((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a3) && 15 == a8) && 277 < a29) && 1 == a4) && !(a25 == 10))) || ((((1 == a3 && 140 < a29) && 15 == a8) && a29 <= 245) && 1 == a4)) || ((((((a4 <= 0 && 1 == a3) && a29 <= 599998) && 15 == a8) && a25 == 11) && 277 < a29) && a23 + 43 <= 0) [2019-12-07 15:15:57,570 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_39b86070-1c5c-44cd-9e62-c80bc02d4bf6/bin/uautomizer/witness.graphml [2019-12-07 15:15:57,570 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:15:57,571 INFO L168 Benchmark]: Toolchain (without parser) took 74017.74 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 935.5 MB in the beginning and 999.4 MB in the end (delta: -63.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 15:15:57,571 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:15:57,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -119.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:15:57,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:15:57,572 INFO L168 Benchmark]: Boogie Preprocessor took 66.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:15:57,572 INFO L168 Benchmark]: RCFGBuilder took 1079.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 852.7 MB in the end (delta: 174.2 MB). Peak memory consumption was 174.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:15:57,572 INFO L168 Benchmark]: TraceAbstraction took 72209.43 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 852.7 MB in the beginning and 1.0 GB in the end (delta: -185.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 15:15:57,572 INFO L168 Benchmark]: Witness Printer took 133.28 ms. Allocated memory is still 2.3 GB. Free memory was 1.0 GB in the beginning and 999.4 MB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:15:57,574 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 448.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -119.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1079.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 852.7 MB in the end (delta: 174.2 MB). Peak memory consumption was 174.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 72209.43 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 852.7 MB in the beginning and 1.0 GB in the end (delta: -185.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 133.28 ms. Allocated memory is still 2.3 GB. Free memory was 1.0 GB in the beginning and 999.4 MB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 72]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-12-07 15:15:57,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((!(3 == input) && a25 == 12) && a4 <= 0) && 1 == a3) && a29 + 22 <= 0) && !(1 == input)) && 15 == a8) && a23 + 43 <= 0) || ((((((a23 <= 312 && 0 < a23 + 43) && 1 == a3) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((((a25 == 12 && 1 == a3) && 140 < a29) && a29 <= 275) && 15 == a8) || ((((1 == a3 && 140 < a29) && a29 <= 275) && 15 == a8) && a25 == 11)) && 1 == a4)) || ((\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4) && (((((((1 == a3 && 15 == a8) && 277 < a29) && 1 == a4) && a25 == 11) && !(a25 == 10)) || ((((1 == a3 && 15 == a8) && a25 == 10) && 277 < a29) && 1 == a4)) || (((((1 == a3 && a25 <= 9) && 15 == a8) && 277 < a29) && 1 == a4) && !(a25 == 10))))) || ((((a25 == 12 && 1 == a3) && a29 + 292032 <= 0) && 15 == a8) && 1 == a4)) || (((((0 < a23 + 43 && 13 <= a25) && 1 == a3) && (\exists v_~a29~0_504 : int :: (a29 <= (v_~a29~0_504 + 69157) % 299861 + 300138 && 0 <= v_~a29~0_504 + 69157) && 130 <= v_~a29~0_504)) && 15 == a8) && 1 == a4)) || (((((0 < a23 + 43 && 1 == a3) && 140 < a29) && 15 == a8) && a29 <= 277) && 1 == a4)) || (((((a4 <= 0 && 1 == a3) && a29 <= 275) && 15 == a8) && a25 == 11) && a23 + 43 <= 0)) || ((((((((\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && v_~a29~0_502 % 299861 == 0) && v_~a29~0_502 % 299861 + 10250 <= a29) && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a29 <= 599998) && 15 == a8) && a23 + 43 <= 0) && !(a25 == 10))) || ((((a25 == 12 && a4 <= 0) && 1 == a3) && a29 + 292032 <= 0) && 15 == a8)) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && a29 <= 130) && 15 == a8) && 1 == a4)) || (((((a4 <= 0 && 1 == a3) && !(a25 == 13)) && a29 + 292032 <= 0) && 15 == a8) && a23 + 43 <= 0)) || ((((1 == a3 && a25 <= 9) && a29 <= 275) && 15 == a8) && 1 == a4)) || ((((1 == a3 && 15 == a8) && a29 <= 245) && 1 == a4) && a25 == 10)) || ((((a4 <= 0 && 1 == a3) && a29 <= 130) && 15 == a8) && a25 == 10)) || ((((a25 == 13 && 1 == a3) && a29 <= 130) && 15 == a8) && 1 == a4)) || (((((a25 == 12 && a4 <= 0) && 140 < a29) && 1 == a3) && a29 <= 275) && 15 == a8)) || ((((((((1 == a3 && 15 == a8) && 277 < a29) && 1 == a4) && a25 == 11) && !(a25 == 10)) || ((((1 == a3 && 15 == a8) && a25 == 10) && 277 < a29) && 1 == a4)) || (((((1 == a3 && a25 <= 9) && 15 == a8) && 277 < a29) && 1 == a4) && !(a25 == 10))) && a23 + 43 <= 0)) || (((((a23 <= 312 && a4 <= 0) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && a29 <= 245)) || ((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a3) && 15 == a8) && 277 < a29) && 1 == a4) && !(a25 == 10))) || ((((1 == a3 && 140 < a29) && 15 == a8) && a29 <= 245) && 1 == a4)) || ((((((a4 <= 0 && 1 == a3) && a29 <= 599998) && 15 == a8) && a25 == 11) && 277 < a29) && a23 + 43 <= 0) - InvariantResult [Line: 22]: Loop Invariant [2019-12-07 15:15:57,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2019-12-07 15:15:57,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 15:15:57,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 15:15:57,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((!(3 == input) && a25 == 12) && a4 <= 0) && 1 == a3) && a29 + 22 <= 0) && !(1 == input)) && 15 == a8) && a23 + 43 <= 0) || ((((((a23 <= 312 && 0 < a23 + 43) && 1 == a3) && (\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4)) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((((a25 == 12 && 1 == a3) && 140 < a29) && a29 <= 275) && 15 == a8) || ((((1 == a3 && 140 < a29) && a29 <= 275) && 15 == a8) && a25 == 11)) && 1 == a4)) || ((\exists v_prenex_4 : int :: (0 <= v_prenex_4 && a29 <= v_prenex_4 % 299861 + 300139) && 277 < v_prenex_4) && (((((((1 == a3 && 15 == a8) && 277 < a29) && 1 == a4) && a25 == 11) && !(a25 == 10)) || ((((1 == a3 && 15 == a8) && a25 == 10) && 277 < a29) && 1 == a4)) || (((((1 == a3 && a25 <= 9) && 15 == a8) && 277 < a29) && 1 == a4) && !(a25 == 10))))) || ((((a25 == 12 && 1 == a3) && a29 + 292032 <= 0) && 15 == a8) && 1 == a4)) || (((((0 < a23 + 43 && 13 <= a25) && 1 == a3) && (\exists v_~a29~0_504 : int :: (a29 <= (v_~a29~0_504 + 69157) % 299861 + 300138 && 0 <= v_~a29~0_504 + 69157) && 130 <= v_~a29~0_504)) && 15 == a8) && 1 == a4)) || (((((0 < a23 + 43 && 1 == a3) && 140 < a29) && 15 == a8) && a29 <= 277) && 1 == a4)) || (((((a4 <= 0 && 1 == a3) && a29 <= 275) && 15 == a8) && a25 == 11) && a23 + 43 <= 0)) || ((((((((\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && v_~a29~0_502 % 299861 == 0) && v_~a29~0_502 % 299861 + 10250 <= a29) && a4 <= 0) && 1 == a3) && !(a25 == 13)) && a29 <= 599998) && 15 == a8) && a23 + 43 <= 0) && !(a25 == 10))) || ((((a25 == 12 && a4 <= 0) && 1 == a3) && a29 + 292032 <= 0) && 15 == a8)) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && a29 <= 130) && 15 == a8) && 1 == a4)) || (((((a4 <= 0 && 1 == a3) && !(a25 == 13)) && a29 + 292032 <= 0) && 15 == a8) && a23 + 43 <= 0)) || ((((1 == a3 && a25 <= 9) && a29 <= 275) && 15 == a8) && 1 == a4)) || ((((1 == a3 && 15 == a8) && a29 <= 245) && 1 == a4) && a25 == 10)) || ((((a4 <= 0 && 1 == a3) && a29 <= 130) && 15 == a8) && a25 == 10)) || ((((a25 == 13 && 1 == a3) && a29 <= 130) && 15 == a8) && 1 == a4)) || (((((a25 == 12 && a4 <= 0) && 140 < a29) && 1 == a3) && a29 <= 275) && 15 == a8)) || ((((((((1 == a3 && 15 == a8) && 277 < a29) && 1 == a4) && a25 == 11) && !(a25 == 10)) || ((((1 == a3 && 15 == a8) && a25 == 10) && 277 < a29) && 1 == a4)) || (((((1 == a3 && a25 <= 9) && 15 == a8) && 277 < a29) && 1 == a4) && !(a25 == 10))) && a23 + 43 <= 0)) || (((((a23 <= 312 && a4 <= 0) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && a29 <= 245)) || ((((((a25 == 13 && a29 + 5 * a23 <= 101230) && 1 == a3) && 15 == a8) && 277 < a29) && 1 == a4) && !(a25 == 10))) || ((((1 == a3 && 140 < a29) && 15 == a8) && a29 <= 245) && 1 == a4)) || ((((((a4 <= 0 && 1 == a3) && a29 <= 599998) && 15 == a8) && a25 == 11) && 277 < a29) && a23 + 43 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 61.9s, OverallIterations: 16, TraceHistogramMax: 6, AutomataDifference: 51.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.1s, HoareTripleCheckerStatistics: 1708 SDtfs, 16957 SDslu, 1209 SDs, 0 SdLazy, 43844 SolverSat, 5248 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2636 GetRequests, 2486 SyntacticMatches, 7 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16798occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 24576 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 188 NumberOfFragments, 1227 HoareAnnotationTreeSize, 3 FomulaSimplifications, 306899 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 84494 FormulaSimplificationTreeSizeReductionInter, 8.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 6829 NumberOfCodeBlocks, 6829 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 6806 ConstructedInterpolants, 684 QuantifiedInterpolants, 18740215 SizeOfPredicates, 11 NumberOfNonLiveVariables, 3262 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 4866/6507 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...