./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 96aededabe895f84f71d6d614ed1af512bf7353b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:30:16,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:30:16,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:30:16,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:30:16,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:30:16,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:30:16,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:30:16,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:30:16,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:30:16,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:30:16,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:30:16,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:30:16,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:30:16,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:30:16,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:30:16,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:30:16,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:30:16,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:30:16,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:30:16,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:30:16,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:30:16,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:30:16,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:30:16,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:30:16,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:30:16,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:30:16,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:30:16,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:30:16,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:30:16,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:30:16,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:30:16,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:30:16,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:30:16,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:30:16,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:30:16,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:30:16,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:30:16,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:30:16,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:30:16,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:30:16,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:30:16,616 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-12-07 13:30:16,625 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:30:16,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:30:16,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:30:16,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:30:16,627 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:30:16,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:30:16,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:30:16,627 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:30:16,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:30:16,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:30:16,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:30:16,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:30:16,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:30:16,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:30:16,628 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 13:30:16,628 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:30:16,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:30:16,628 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:30:16,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:30:16,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:30:16,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:30:16,629 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:30:16,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:30:16,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:30:16,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:30:16,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:30:16,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:30:16,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:30:16,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:30:16,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:30:16,630 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:30:16,630 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_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/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 ! overflow) ) 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 -> 96aededabe895f84f71d6d614ed1af512bf7353b [2019-12-07 13:30:16,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:30:16,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:30:16,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:30:16,739 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:30:16,740 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:30:16,740 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-12-07 13:30:16,776 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/data/ecacf3f86/be45f767118e4ad9a08aaddc99423078/FLAG529f1c83b [2019-12-07 13:30:17,290 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:30:17,291 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2019-12-07 13:30:17,299 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/data/ecacf3f86/be45f767118e4ad9a08aaddc99423078/FLAG529f1c83b [2019-12-07 13:30:17,772 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/data/ecacf3f86/be45f767118e4ad9a08aaddc99423078 [2019-12-07 13:30:17,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:30:17,775 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:30:17,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:30:17,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:30:17,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:30:17,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:30:17" (1/1) ... [2019-12-07 13:30:17,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@728c9bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:17, skipping insertion in model container [2019-12-07 13:30:17,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:30:17" (1/1) ... [2019-12-07 13:30:17,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:30:17,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:30:18,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:30:18,006 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:30:18,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:30:18,051 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:30:18,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:18 WrapperNode [2019-12-07 13:30:18,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:30:18,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:30:18,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:30:18,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:30:18,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:18" (1/1) ... [2019-12-07 13:30:18,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:18" (1/1) ... [2019-12-07 13:30:18,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:30:18,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:30:18,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:30:18,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:30:18,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:18" (1/1) ... [2019-12-07 13:30:18,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:18" (1/1) ... [2019-12-07 13:30:18,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:18" (1/1) ... [2019-12-07 13:30:18,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:18" (1/1) ... [2019-12-07 13:30:18,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:18" (1/1) ... [2019-12-07 13:30:18,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:18" (1/1) ... [2019-12-07 13:30:18,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:18" (1/1) ... [2019-12-07 13:30:18,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:30:18,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:30:18,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:30:18,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:30:18,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/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 13:30:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:30:18,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:30:18,230 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 13:30:18,534 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 13:30:18,534 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 13:30:18,535 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:30:18,535 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 13:30:18,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:30:18 BoogieIcfgContainer [2019-12-07 13:30:18,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:30:18,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:30:18,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:30:18,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:30:18,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:30:17" (1/3) ... [2019-12-07 13:30:18,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b00659e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:30:18, skipping insertion in model container [2019-12-07 13:30:18,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:30:18" (2/3) ... [2019-12-07 13:30:18,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b00659e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:30:18, skipping insertion in model container [2019-12-07 13:30:18,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:30:18" (3/3) ... [2019-12-07 13:30:18,541 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2019-12-07 13:30:18,547 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:30:18,552 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-12-07 13:30:18,559 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-07 13:30:18,575 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:30:18,575 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:30:18,576 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:30:18,576 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:30:18,576 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:30:18,576 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:30:18,576 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:30:18,576 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:30:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-12-07 13:30:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:30:18,594 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:18,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:18,595 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:18,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1287811732, now seen corresponding path program 1 times [2019-12-07 13:30:18,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:18,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774758412] [2019-12-07 13:30:18,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:18,720 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 13:30:18,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774758412] [2019-12-07 13:30:18,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:18,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:18,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101562475] [2019-12-07 13:30:18,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:18,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:18,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:18,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:18,735 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-12-07 13:30:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:18,872 INFO L93 Difference]: Finished difference Result 323 states and 532 transitions. [2019-12-07 13:30:18,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:18,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 13:30:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:18,882 INFO L225 Difference]: With dead ends: 323 [2019-12-07 13:30:18,883 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 13:30:18,885 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 13:30:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 13:30:18,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-12-07 13:30:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-07 13:30:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2019-12-07 13:30:18,924 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 16 [2019-12-07 13:30:18,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:18,924 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2019-12-07 13:30:18,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2019-12-07 13:30:18,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:30:18,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:18,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:18,926 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:18,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:18,926 INFO L82 PathProgramCache]: Analyzing trace with hash 664085130, now seen corresponding path program 1 times [2019-12-07 13:30:18,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:18,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673212340] [2019-12-07 13:30:18,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:18,962 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 13:30:18,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673212340] [2019-12-07 13:30:18,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:18,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:18,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548454130] [2019-12-07 13:30:18,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:18,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:18,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:18,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:18,964 INFO L87 Difference]: Start difference. First operand 155 states and 230 transitions. Second operand 3 states. [2019-12-07 13:30:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:19,055 INFO L93 Difference]: Finished difference Result 313 states and 462 transitions. [2019-12-07 13:30:19,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:19,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 13:30:19,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:19,057 INFO L225 Difference]: With dead ends: 313 [2019-12-07 13:30:19,057 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 13:30:19,058 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 13:30:19,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 13:30:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 156. [2019-12-07 13:30:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-12-07 13:30:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 231 transitions. [2019-12-07 13:30:19,068 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 231 transitions. Word has length 17 [2019-12-07 13:30:19,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:19,068 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 231 transitions. [2019-12-07 13:30:19,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 231 transitions. [2019-12-07 13:30:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:30:19,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:19,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:19,069 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:19,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:19,069 INFO L82 PathProgramCache]: Analyzing trace with hash 37329238, now seen corresponding path program 1 times [2019-12-07 13:30:19,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:19,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728724151] [2019-12-07 13:30:19,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:19,098 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 13:30:19,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728724151] [2019-12-07 13:30:19,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:19,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:19,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590369461] [2019-12-07 13:30:19,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:19,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:19,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:19,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:19,100 INFO L87 Difference]: Start difference. First operand 156 states and 231 transitions. Second operand 3 states. [2019-12-07 13:30:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:19,189 INFO L93 Difference]: Finished difference Result 315 states and 464 transitions. [2019-12-07 13:30:19,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:19,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 13:30:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:19,191 INFO L225 Difference]: With dead ends: 315 [2019-12-07 13:30:19,191 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 13:30:19,192 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 13:30:19,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 13:30:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2019-12-07 13:30:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 13:30:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2019-12-07 13:30:19,204 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 18 [2019-12-07 13:30:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:19,204 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2019-12-07 13:30:19,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2019-12-07 13:30:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:30:19,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:19,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:19,206 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:19,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:19,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1635395343, now seen corresponding path program 1 times [2019-12-07 13:30:19,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:19,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348665118] [2019-12-07 13:30:19,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:19,235 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 13:30:19,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348665118] [2019-12-07 13:30:19,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:19,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:19,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576967445] [2019-12-07 13:30:19,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:19,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:19,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:19,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:19,236 INFO L87 Difference]: Start difference. First operand 157 states and 232 transitions. Second operand 3 states. [2019-12-07 13:30:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:19,332 INFO L93 Difference]: Finished difference Result 317 states and 466 transitions. [2019-12-07 13:30:19,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:19,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 13:30:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:19,334 INFO L225 Difference]: With dead ends: 317 [2019-12-07 13:30:19,334 INFO L226 Difference]: Without dead ends: 167 [2019-12-07 13:30:19,334 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 13:30:19,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-12-07 13:30:19,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2019-12-07 13:30:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 13:30:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 233 transitions. [2019-12-07 13:30:19,343 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 233 transitions. Word has length 19 [2019-12-07 13:30:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:19,343 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 233 transitions. [2019-12-07 13:30:19,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:19,343 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 233 transitions. [2019-12-07 13:30:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:30:19,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:19,344 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] [2019-12-07 13:30:19,344 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:19,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:19,344 INFO L82 PathProgramCache]: Analyzing trace with hash -811500677, now seen corresponding path program 1 times [2019-12-07 13:30:19,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:19,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605742555] [2019-12-07 13:30:19,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:19,366 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 13:30:19,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605742555] [2019-12-07 13:30:19,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:19,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:19,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316028604] [2019-12-07 13:30:19,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:19,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:19,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:19,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:19,368 INFO L87 Difference]: Start difference. First operand 158 states and 233 transitions. Second operand 3 states. [2019-12-07 13:30:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:19,453 INFO L93 Difference]: Finished difference Result 319 states and 468 transitions. [2019-12-07 13:30:19,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:19,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 13:30:19,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:19,454 INFO L225 Difference]: With dead ends: 319 [2019-12-07 13:30:19,454 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 13:30:19,455 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 13:30:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 13:30:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2019-12-07 13:30:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-12-07 13:30:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 234 transitions. [2019-12-07 13:30:19,464 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 234 transitions. Word has length 20 [2019-12-07 13:30:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:19,465 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 234 transitions. [2019-12-07 13:30:19,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 234 transitions. [2019-12-07 13:30:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 13:30:19,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:19,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:19,467 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:19,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1579118521, now seen corresponding path program 1 times [2019-12-07 13:30:19,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:19,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996939803] [2019-12-07 13:30:19,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:19,480 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 13:30:19,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1904846843] [2019-12-07 13:30:19,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/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 13:30:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:19,520 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:30:19,525 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:19,546 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 13:30:19,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996939803] [2019-12-07 13:30:19,546 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:30:19,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904846843] [2019-12-07 13:30:19,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:19,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:19,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149042545] [2019-12-07 13:30:19,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:19,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:19,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:19,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:19,548 INFO L87 Difference]: Start difference. First operand 159 states and 234 transitions. Second operand 3 states. [2019-12-07 13:30:19,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:19,585 INFO L93 Difference]: Finished difference Result 455 states and 672 transitions. [2019-12-07 13:30:19,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:19,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 13:30:19,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:19,587 INFO L225 Difference]: With dead ends: 455 [2019-12-07 13:30:19,587 INFO L226 Difference]: Without dead ends: 303 [2019-12-07 13:30:19,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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 13:30:19,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-07 13:30:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2019-12-07 13:30:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-12-07 13:30:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 446 transitions. [2019-12-07 13:30:19,601 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 446 transitions. Word has length 39 [2019-12-07 13:30:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:19,601 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 446 transitions. [2019-12-07 13:30:19,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 446 transitions. [2019-12-07 13:30:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 13:30:19,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:19,604 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:19,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:19,807 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:19,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:19,808 INFO L82 PathProgramCache]: Analyzing trace with hash 643824433, now seen corresponding path program 1 times [2019-12-07 13:30:19,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:19,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743840503] [2019-12-07 13:30:19,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:19,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743840503] [2019-12-07 13:30:19,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:19,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:19,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178265917] [2019-12-07 13:30:19,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:19,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:19,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:19,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:19,870 INFO L87 Difference]: Start difference. First operand 299 states and 446 transitions. Second operand 3 states. [2019-12-07 13:30:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:19,961 INFO L93 Difference]: Finished difference Result 653 states and 987 transitions. [2019-12-07 13:30:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:19,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 13:30:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:19,963 INFO L225 Difference]: With dead ends: 653 [2019-12-07 13:30:19,963 INFO L226 Difference]: Without dead ends: 361 [2019-12-07 13:30:19,964 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 13:30:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-12-07 13:30:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2019-12-07 13:30:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-07 13:30:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 550 transitions. [2019-12-07 13:30:19,974 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 550 transitions. Word has length 44 [2019-12-07 13:30:19,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:19,974 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 550 transitions. [2019-12-07 13:30:19,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 550 transitions. [2019-12-07 13:30:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 13:30:19,976 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:19,976 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 13:30:19,976 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:19,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1369957728, now seen corresponding path program 1 times [2019-12-07 13:30:19,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:19,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326763031] [2019-12-07 13:30:19,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:19,984 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 13:30:19,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [652118203] [2019-12-07 13:30:19,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/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 13:30:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:20,019 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:30:20,021 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:30:20,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326763031] [2019-12-07 13:30:20,028 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:30:20,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652118203] [2019-12-07 13:30:20,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:20,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:30:20,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940422999] [2019-12-07 13:30:20,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:20,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:20,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:20,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:20,029 INFO L87 Difference]: Start difference. First operand 361 states and 550 transitions. Second operand 3 states. [2019-12-07 13:30:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:20,060 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2019-12-07 13:30:20,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:20,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 13:30:20,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:20,063 INFO L225 Difference]: With dead ends: 719 [2019-12-07 13:30:20,063 INFO L226 Difference]: Without dead ends: 536 [2019-12-07 13:30:20,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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 13:30:20,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-12-07 13:30:20,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 532. [2019-12-07 13:30:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-12-07 13:30:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 815 transitions. [2019-12-07 13:30:20,078 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 815 transitions. Word has length 55 [2019-12-07 13:30:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:20,078 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 815 transitions. [2019-12-07 13:30:20,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:20,078 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 815 transitions. [2019-12-07 13:30:20,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 13:30:20,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:20,080 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:20,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:20,282 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:20,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:20,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1405602907, now seen corresponding path program 1 times [2019-12-07 13:30:20,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:20,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106991498] [2019-12-07 13:30:20,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:30:20,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106991498] [2019-12-07 13:30:20,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:20,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:20,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159532093] [2019-12-07 13:30:20,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:20,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:20,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:20,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:20,309 INFO L87 Difference]: Start difference. First operand 532 states and 815 transitions. Second operand 3 states. [2019-12-07 13:30:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:20,401 INFO L93 Difference]: Finished difference Result 1111 states and 1694 transitions. [2019-12-07 13:30:20,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:20,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 13:30:20,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:20,404 INFO L225 Difference]: With dead ends: 1111 [2019-12-07 13:30:20,404 INFO L226 Difference]: Without dead ends: 586 [2019-12-07 13:30:20,405 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 13:30:20,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-12-07 13:30:20,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 580. [2019-12-07 13:30:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-07 13:30:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 878 transitions. [2019-12-07 13:30:20,418 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 878 transitions. Word has length 56 [2019-12-07 13:30:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:20,418 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 878 transitions. [2019-12-07 13:30:20,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 878 transitions. [2019-12-07 13:30:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 13:30:20,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:20,419 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:20,419 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:20,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:20,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2147424561, now seen corresponding path program 1 times [2019-12-07 13:30:20,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:20,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289856424] [2019-12-07 13:30:20,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:30:20,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289856424] [2019-12-07 13:30:20,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:20,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:20,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398938737] [2019-12-07 13:30:20,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:20,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:20,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:20,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:20,439 INFO L87 Difference]: Start difference. First operand 580 states and 878 transitions. Second operand 3 states. [2019-12-07 13:30:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:20,537 INFO L93 Difference]: Finished difference Result 1162 states and 1757 transitions. [2019-12-07 13:30:20,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:20,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-07 13:30:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:20,541 INFO L225 Difference]: With dead ends: 1162 [2019-12-07 13:30:20,541 INFO L226 Difference]: Without dead ends: 589 [2019-12-07 13:30:20,542 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 13:30:20,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-12-07 13:30:20,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 583. [2019-12-07 13:30:20,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-12-07 13:30:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 878 transitions. [2019-12-07 13:30:20,563 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 878 transitions. Word has length 57 [2019-12-07 13:30:20,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:20,563 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 878 transitions. [2019-12-07 13:30:20,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 878 transitions. [2019-12-07 13:30:20,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 13:30:20,564 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:20,564 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 13:30:20,565 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:20,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:20,565 INFO L82 PathProgramCache]: Analyzing trace with hash -216125576, now seen corresponding path program 1 times [2019-12-07 13:30:20,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:20,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016856948] [2019-12-07 13:30:20,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:30:20,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016856948] [2019-12-07 13:30:20,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:20,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:20,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500373294] [2019-12-07 13:30:20,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:20,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:20,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:20,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:20,599 INFO L87 Difference]: Start difference. First operand 583 states and 878 transitions. Second operand 3 states. [2019-12-07 13:30:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:20,711 INFO L93 Difference]: Finished difference Result 1291 states and 1970 transitions. [2019-12-07 13:30:20,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:20,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-07 13:30:20,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:20,715 INFO L225 Difference]: With dead ends: 1291 [2019-12-07 13:30:20,715 INFO L226 Difference]: Without dead ends: 715 [2019-12-07 13:30:20,716 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 13:30:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-12-07 13:30:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 709. [2019-12-07 13:30:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-12-07 13:30:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1091 transitions. [2019-12-07 13:30:20,740 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1091 transitions. Word has length 70 [2019-12-07 13:30:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:20,740 INFO L462 AbstractCegarLoop]: Abstraction has 709 states and 1091 transitions. [2019-12-07 13:30:20,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:20,741 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1091 transitions. [2019-12-07 13:30:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 13:30:20,742 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:20,742 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:20,742 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:20,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:20,743 INFO L82 PathProgramCache]: Analyzing trace with hash 380295080, now seen corresponding path program 1 times [2019-12-07 13:30:20,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:20,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680233417] [2019-12-07 13:30:20,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:30:20,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680233417] [2019-12-07 13:30:20,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:20,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:20,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536539406] [2019-12-07 13:30:20,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:20,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:20,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:20,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:20,772 INFO L87 Difference]: Start difference. First operand 709 states and 1091 transitions. Second operand 3 states. [2019-12-07 13:30:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:20,893 INFO L93 Difference]: Finished difference Result 1513 states and 2336 transitions. [2019-12-07 13:30:20,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:20,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 13:30:20,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:20,897 INFO L225 Difference]: With dead ends: 1513 [2019-12-07 13:30:20,897 INFO L226 Difference]: Without dead ends: 811 [2019-12-07 13:30:20,898 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 13:30:20,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-12-07 13:30:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 790. [2019-12-07 13:30:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-12-07 13:30:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1211 transitions. [2019-12-07 13:30:20,918 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1211 transitions. Word has length 71 [2019-12-07 13:30:20,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:20,918 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1211 transitions. [2019-12-07 13:30:20,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:20,918 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1211 transitions. [2019-12-07 13:30:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 13:30:20,919 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:20,919 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:20,919 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:20,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:20,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1769518732, now seen corresponding path program 1 times [2019-12-07 13:30:20,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:20,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328084370] [2019-12-07 13:30:20,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:30:20,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328084370] [2019-12-07 13:30:20,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:20,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:20,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744144532] [2019-12-07 13:30:20,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:20,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:20,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:20,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:20,944 INFO L87 Difference]: Start difference. First operand 790 states and 1211 transitions. Second operand 3 states. [2019-12-07 13:30:21,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:21,063 INFO L93 Difference]: Finished difference Result 1582 states and 2423 transitions. [2019-12-07 13:30:21,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:21,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 13:30:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:21,066 INFO L225 Difference]: With dead ends: 1582 [2019-12-07 13:30:21,067 INFO L226 Difference]: Without dead ends: 799 [2019-12-07 13:30:21,067 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 13:30:21,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-07 13:30:21,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 793. [2019-12-07 13:30:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-12-07 13:30:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1211 transitions. [2019-12-07 13:30:21,088 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1211 transitions. Word has length 71 [2019-12-07 13:30:21,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:21,088 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1211 transitions. [2019-12-07 13:30:21,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1211 transitions. [2019-12-07 13:30:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 13:30:21,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:21,089 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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 13:30:21,090 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:21,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:21,090 INFO L82 PathProgramCache]: Analyzing trace with hash -953703820, now seen corresponding path program 1 times [2019-12-07 13:30:21,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:21,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669143335] [2019-12-07 13:30:21,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:30:21,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669143335] [2019-12-07 13:30:21,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:21,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:21,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904017966] [2019-12-07 13:30:21,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:21,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:21,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:21,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:21,113 INFO L87 Difference]: Start difference. First operand 793 states and 1211 transitions. Second operand 3 states. [2019-12-07 13:30:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:21,235 INFO L93 Difference]: Finished difference Result 1600 states and 2447 transitions. [2019-12-07 13:30:21,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:21,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-07 13:30:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:21,239 INFO L225 Difference]: With dead ends: 1600 [2019-12-07 13:30:21,239 INFO L226 Difference]: Without dead ends: 814 [2019-12-07 13:30:21,240 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 13:30:21,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-12-07 13:30:21,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 793. [2019-12-07 13:30:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-12-07 13:30:21,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1202 transitions. [2019-12-07 13:30:21,260 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1202 transitions. Word has length 72 [2019-12-07 13:30:21,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:21,260 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1202 transitions. [2019-12-07 13:30:21,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1202 transitions. [2019-12-07 13:30:21,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 13:30:21,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:21,261 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:30:21,261 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:21,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:21,261 INFO L82 PathProgramCache]: Analyzing trace with hash -816065300, now seen corresponding path program 1 times [2019-12-07 13:30:21,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:21,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74141611] [2019-12-07 13:30:21,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:21,267 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 13:30:21,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1873746488] [2019-12-07 13:30:21,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/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 13:30:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:21,313 INFO L264 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:30:21,316 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 13:30:21,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74141611] [2019-12-07 13:30:21,329 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:30:21,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873746488] [2019-12-07 13:30:21,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:21,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:30:21,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459637484] [2019-12-07 13:30:21,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:21,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:21,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:21,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:21,330 INFO L87 Difference]: Start difference. First operand 793 states and 1202 transitions. Second operand 3 states. [2019-12-07 13:30:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:21,372 INFO L93 Difference]: Finished difference Result 1583 states and 2396 transitions. [2019-12-07 13:30:21,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:21,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-12-07 13:30:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:21,377 INFO L225 Difference]: With dead ends: 1583 [2019-12-07 13:30:21,377 INFO L226 Difference]: Without dead ends: 1055 [2019-12-07 13:30:21,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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 13:30:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-12-07 13:30:21,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1051. [2019-12-07 13:30:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-12-07 13:30:21,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1597 transitions. [2019-12-07 13:30:21,403 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1597 transitions. Word has length 76 [2019-12-07 13:30:21,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:21,403 INFO L462 AbstractCegarLoop]: Abstraction has 1051 states and 1597 transitions. [2019-12-07 13:30:21,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:21,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1597 transitions. [2019-12-07 13:30:21,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 13:30:21,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:21,405 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:21,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:21,605 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:21,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:21,606 INFO L82 PathProgramCache]: Analyzing trace with hash -174298828, now seen corresponding path program 1 times [2019-12-07 13:30:21,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:21,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062328077] [2019-12-07 13:30:21,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:30:21,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062328077] [2019-12-07 13:30:21,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:21,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:21,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697783485] [2019-12-07 13:30:21,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:21,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:21,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:21,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:21,645 INFO L87 Difference]: Start difference. First operand 1051 states and 1597 transitions. Second operand 3 states. [2019-12-07 13:30:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:21,778 INFO L93 Difference]: Finished difference Result 2279 states and 3475 transitions. [2019-12-07 13:30:21,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:21,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-07 13:30:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:21,783 INFO L225 Difference]: With dead ends: 2279 [2019-12-07 13:30:21,784 INFO L226 Difference]: Without dead ends: 1235 [2019-12-07 13:30:21,785 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 13:30:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-12-07 13:30:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1223. [2019-12-07 13:30:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-07 13:30:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1873 transitions. [2019-12-07 13:30:21,809 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1873 transitions. Word has length 86 [2019-12-07 13:30:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:21,809 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 1873 transitions. [2019-12-07 13:30:21,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1873 transitions. [2019-12-07 13:30:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 13:30:21,811 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:21,811 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:21,811 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:21,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:21,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1676680243, now seen corresponding path program 1 times [2019-12-07 13:30:21,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:21,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778540337] [2019-12-07 13:30:21,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 13:30:21,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778540337] [2019-12-07 13:30:21,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:21,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:21,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626678349] [2019-12-07 13:30:21,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:21,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:21,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:21,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:21,840 INFO L87 Difference]: Start difference. First operand 1223 states and 1873 transitions. Second operand 3 states. [2019-12-07 13:30:21,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:21,990 INFO L93 Difference]: Finished difference Result 2499 states and 3839 transitions. [2019-12-07 13:30:21,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:21,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-12-07 13:30:21,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:21,998 INFO L225 Difference]: With dead ends: 2499 [2019-12-07 13:30:21,998 INFO L226 Difference]: Without dead ends: 1275 [2019-12-07 13:30:21,999 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 13:30:22,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-12-07 13:30:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1263. [2019-12-07 13:30:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-12-07 13:30:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1949 transitions. [2019-12-07 13:30:22,032 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1949 transitions. Word has length 87 [2019-12-07 13:30:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:22,032 INFO L462 AbstractCegarLoop]: Abstraction has 1263 states and 1949 transitions. [2019-12-07 13:30:22,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1949 transitions. [2019-12-07 13:30:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 13:30:22,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:22,034 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 13:30:22,034 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:22,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:22,034 INFO L82 PathProgramCache]: Analyzing trace with hash 538835484, now seen corresponding path program 1 times [2019-12-07 13:30:22,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:22,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738029795] [2019-12-07 13:30:22,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 13:30:22,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738029795] [2019-12-07 13:30:22,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:22,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:22,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270206051] [2019-12-07 13:30:22,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:22,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:22,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:22,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:22,059 INFO L87 Difference]: Start difference. First operand 1263 states and 1949 transitions. Second operand 3 states. [2019-12-07 13:30:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:22,167 INFO L93 Difference]: Finished difference Result 2667 states and 4123 transitions. [2019-12-07 13:30:22,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:22,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 13:30:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:22,174 INFO L225 Difference]: With dead ends: 2667 [2019-12-07 13:30:22,175 INFO L226 Difference]: Without dead ends: 1411 [2019-12-07 13:30:22,176 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 13:30:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-12-07 13:30:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-12-07 13:30:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-12-07 13:30:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2085 transitions. [2019-12-07 13:30:22,214 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2085 transitions. Word has length 97 [2019-12-07 13:30:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:22,214 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2085 transitions. [2019-12-07 13:30:22,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:22,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2085 transitions. [2019-12-07 13:30:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 13:30:22,216 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:22,217 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 13:30:22,217 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:22,217 INFO L82 PathProgramCache]: Analyzing trace with hash 704331080, now seen corresponding path program 1 times [2019-12-07 13:30:22,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:22,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517459943] [2019-12-07 13:30:22,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 13:30:22,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517459943] [2019-12-07 13:30:22,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:22,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:22,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625065194] [2019-12-07 13:30:22,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:22,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:22,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:22,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:22,242 INFO L87 Difference]: Start difference. First operand 1363 states and 2085 transitions. Second operand 3 states. [2019-12-07 13:30:22,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:22,354 INFO L93 Difference]: Finished difference Result 2767 states and 4239 transitions. [2019-12-07 13:30:22,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:22,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 13:30:22,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:22,361 INFO L225 Difference]: With dead ends: 2767 [2019-12-07 13:30:22,361 INFO L226 Difference]: Without dead ends: 1411 [2019-12-07 13:30:22,363 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 13:30:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2019-12-07 13:30:22,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1363. [2019-12-07 13:30:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-12-07 13:30:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2065 transitions. [2019-12-07 13:30:22,397 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2065 transitions. Word has length 98 [2019-12-07 13:30:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:22,398 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 2065 transitions. [2019-12-07 13:30:22,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2065 transitions. [2019-12-07 13:30:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 13:30:22,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:22,399 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-12-07 13:30:22,400 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:22,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:22,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1454055914, now seen corresponding path program 1 times [2019-12-07 13:30:22,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:22,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302926057] [2019-12-07 13:30:22,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:22,408 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 13:30:22,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1904877801] [2019-12-07 13:30:22,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/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 13:30:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:22,455 INFO L264 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:30:22,459 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 13:30:22,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302926057] [2019-12-07 13:30:22,477 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:30:22,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904877801] [2019-12-07 13:30:22,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:22,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:30:22,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604379508] [2019-12-07 13:30:22,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:22,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:22,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:22,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:22,478 INFO L87 Difference]: Start difference. First operand 1363 states and 2065 transitions. Second operand 3 states. [2019-12-07 13:30:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:22,603 INFO L93 Difference]: Finished difference Result 2755 states and 4163 transitions. [2019-12-07 13:30:22,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:22,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-12-07 13:30:22,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:22,609 INFO L225 Difference]: With dead ends: 2755 [2019-12-07 13:30:22,610 INFO L226 Difference]: Without dead ends: 1399 [2019-12-07 13:30:22,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 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 13:30:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-12-07 13:30:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1363. [2019-12-07 13:30:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-12-07 13:30:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1993 transitions. [2019-12-07 13:30:22,644 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1993 transitions. Word has length 116 [2019-12-07 13:30:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:22,644 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1993 transitions. [2019-12-07 13:30:22,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1993 transitions. [2019-12-07 13:30:22,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 13:30:22,646 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:22,646 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-12-07 13:30:22,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:22,846 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:22,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:22,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2083865546, now seen corresponding path program 1 times [2019-12-07 13:30:22,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:22,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391872877] [2019-12-07 13:30:22,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 13:30:22,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391872877] [2019-12-07 13:30:22,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:22,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:22,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873626348] [2019-12-07 13:30:22,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:22,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:22,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:22,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:22,877 INFO L87 Difference]: Start difference. First operand 1363 states and 1993 transitions. Second operand 3 states. [2019-12-07 13:30:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:22,989 INFO L93 Difference]: Finished difference Result 2827 states and 4135 transitions. [2019-12-07 13:30:22,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:22,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-12-07 13:30:22,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:22,995 INFO L225 Difference]: With dead ends: 2827 [2019-12-07 13:30:22,995 INFO L226 Difference]: Without dead ends: 1471 [2019-12-07 13:30:22,996 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 13:30:22,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-12-07 13:30:23,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-12-07 13:30:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-12-07 13:30:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2117 transitions. [2019-12-07 13:30:23,021 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2117 transitions. Word has length 117 [2019-12-07 13:30:23,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:23,021 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2117 transitions. [2019-12-07 13:30:23,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:23,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2117 transitions. [2019-12-07 13:30:23,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 13:30:23,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:23,023 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2019-12-07 13:30:23,023 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:23,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:23,023 INFO L82 PathProgramCache]: Analyzing trace with hash -63631274, now seen corresponding path program 1 times [2019-12-07 13:30:23,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:23,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76104312] [2019-12-07 13:30:23,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 13:30:23,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76104312] [2019-12-07 13:30:23,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:23,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:23,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042893860] [2019-12-07 13:30:23,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:23,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:23,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:23,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:23,048 INFO L87 Difference]: Start difference. First operand 1459 states and 2117 transitions. Second operand 3 states. [2019-12-07 13:30:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:23,151 INFO L93 Difference]: Finished difference Result 2923 states and 4239 transitions. [2019-12-07 13:30:23,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:23,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-12-07 13:30:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:23,156 INFO L225 Difference]: With dead ends: 2923 [2019-12-07 13:30:23,156 INFO L226 Difference]: Without dead ends: 1471 [2019-12-07 13:30:23,157 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 13:30:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2019-12-07 13:30:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1459. [2019-12-07 13:30:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-12-07 13:30:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2097 transitions. [2019-12-07 13:30:23,182 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2097 transitions. Word has length 118 [2019-12-07 13:30:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:23,183 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2097 transitions. [2019-12-07 13:30:23,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2097 transitions. [2019-12-07 13:30:23,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-07 13:30:23,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:23,184 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-12-07 13:30:23,184 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:23,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:23,184 INFO L82 PathProgramCache]: Analyzing trace with hash 365233416, now seen corresponding path program 1 times [2019-12-07 13:30:23,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:23,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460757443] [2019-12-07 13:30:23,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 13:30:23,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460757443] [2019-12-07 13:30:23,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:23,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:23,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869587820] [2019-12-07 13:30:23,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:23,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:23,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:23,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:23,209 INFO L87 Difference]: Start difference. First operand 1459 states and 2097 transitions. Second operand 3 states. [2019-12-07 13:30:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:23,336 INFO L93 Difference]: Finished difference Result 3091 states and 4445 transitions. [2019-12-07 13:30:23,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:23,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-12-07 13:30:23,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:23,342 INFO L225 Difference]: With dead ends: 3091 [2019-12-07 13:30:23,342 INFO L226 Difference]: Without dead ends: 1639 [2019-12-07 13:30:23,343 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 13:30:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-12-07 13:30:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1623. [2019-12-07 13:30:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-12-07 13:30:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2337 transitions. [2019-12-07 13:30:23,369 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2337 transitions. Word has length 126 [2019-12-07 13:30:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:23,369 INFO L462 AbstractCegarLoop]: Abstraction has 1623 states and 2337 transitions. [2019-12-07 13:30:23,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:23,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2337 transitions. [2019-12-07 13:30:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-07 13:30:23,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:23,371 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-12-07 13:30:23,371 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:23,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:23,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1493527041, now seen corresponding path program 1 times [2019-12-07 13:30:23,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:23,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101547637] [2019-12-07 13:30:23,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:23,398 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 13:30:23,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101547637] [2019-12-07 13:30:23,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:23,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:23,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532800108] [2019-12-07 13:30:23,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:23,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:23,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:23,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:23,399 INFO L87 Difference]: Start difference. First operand 1623 states and 2337 transitions. Second operand 3 states. [2019-12-07 13:30:23,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:23,548 INFO L93 Difference]: Finished difference Result 3255 states and 4681 transitions. [2019-12-07 13:30:23,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:23,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-12-07 13:30:23,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:23,557 INFO L225 Difference]: With dead ends: 3255 [2019-12-07 13:30:23,557 INFO L226 Difference]: Without dead ends: 1631 [2019-12-07 13:30:23,558 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 13:30:23,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-12-07 13:30:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1615. [2019-12-07 13:30:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2019-12-07 13:30:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2321 transitions. [2019-12-07 13:30:23,600 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2321 transitions. Word has length 127 [2019-12-07 13:30:23,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:23,600 INFO L462 AbstractCegarLoop]: Abstraction has 1615 states and 2321 transitions. [2019-12-07 13:30:23,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2321 transitions. [2019-12-07 13:30:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-07 13:30:23,603 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:23,603 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-12-07 13:30:23,603 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:23,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:23,604 INFO L82 PathProgramCache]: Analyzing trace with hash 704603328, now seen corresponding path program 1 times [2019-12-07 13:30:23,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:23,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250234506] [2019-12-07 13:30:23,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 13:30:23,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250234506] [2019-12-07 13:30:23,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:23,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:23,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737943511] [2019-12-07 13:30:23,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:23,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:23,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:23,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:23,642 INFO L87 Difference]: Start difference. First operand 1615 states and 2321 transitions. Second operand 3 states. [2019-12-07 13:30:23,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:23,775 INFO L93 Difference]: Finished difference Result 3323 states and 4778 transitions. [2019-12-07 13:30:23,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:23,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-12-07 13:30:23,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:23,781 INFO L225 Difference]: With dead ends: 3323 [2019-12-07 13:30:23,781 INFO L226 Difference]: Without dead ends: 1715 [2019-12-07 13:30:23,782 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 13:30:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-12-07 13:30:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-12-07 13:30:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-12-07 13:30:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2417 transitions. [2019-12-07 13:30:23,810 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2417 transitions. Word has length 138 [2019-12-07 13:30:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:23,810 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2417 transitions. [2019-12-07 13:30:23,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2417 transitions. [2019-12-07 13:30:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-07 13:30:23,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:23,812 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2019-12-07 13:30:23,812 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:23,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1658127444, now seen corresponding path program 1 times [2019-12-07 13:30:23,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:23,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771762726] [2019-12-07 13:30:23,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 13:30:23,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771762726] [2019-12-07 13:30:23,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:23,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:23,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255500235] [2019-12-07 13:30:23,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:23,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:23,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:23,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:23,836 INFO L87 Difference]: Start difference. First operand 1699 states and 2417 transitions. Second operand 3 states. [2019-12-07 13:30:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:23,944 INFO L93 Difference]: Finished difference Result 3407 states and 4846 transitions. [2019-12-07 13:30:23,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:23,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-12-07 13:30:23,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:23,952 INFO L225 Difference]: With dead ends: 3407 [2019-12-07 13:30:23,953 INFO L226 Difference]: Without dead ends: 1715 [2019-12-07 13:30:23,954 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 13:30:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2019-12-07 13:30:23,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2019-12-07 13:30:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-12-07 13:30:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2389 transitions. [2019-12-07 13:30:23,987 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2389 transitions. Word has length 139 [2019-12-07 13:30:23,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:23,987 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2389 transitions. [2019-12-07 13:30:23,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2389 transitions. [2019-12-07 13:30:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 13:30:23,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:23,989 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2019-12-07 13:30:23,989 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:23,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:23,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1163594683, now seen corresponding path program 1 times [2019-12-07 13:30:23,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:23,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474041132] [2019-12-07 13:30:23,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-12-07 13:30:24,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474041132] [2019-12-07 13:30:24,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:24,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:24,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610548106] [2019-12-07 13:30:24,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:24,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:24,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:24,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:24,015 INFO L87 Difference]: Start difference. First operand 1699 states and 2389 transitions. Second operand 3 states. [2019-12-07 13:30:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:24,055 INFO L93 Difference]: Finished difference Result 3373 states and 4735 transitions. [2019-12-07 13:30:24,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:24,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-12-07 13:30:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:24,063 INFO L225 Difference]: With dead ends: 3373 [2019-12-07 13:30:24,063 INFO L226 Difference]: Without dead ends: 1681 [2019-12-07 13:30:24,065 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 13:30:24,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-12-07 13:30:24,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1677. [2019-12-07 13:30:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2019-12-07 13:30:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2356 transitions. [2019-12-07 13:30:24,093 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2356 transitions. Word has length 154 [2019-12-07 13:30:24,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:24,094 INFO L462 AbstractCegarLoop]: Abstraction has 1677 states and 2356 transitions. [2019-12-07 13:30:24,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2356 transitions. [2019-12-07 13:30:24,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 13:30:24,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:24,095 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2019-12-07 13:30:24,095 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:24,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:24,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1358544773, now seen corresponding path program 1 times [2019-12-07 13:30:24,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:24,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448869977] [2019-12-07 13:30:24,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 13:30:24,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448869977] [2019-12-07 13:30:24,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053458842] [2019-12-07 13:30:24,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/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 13:30:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:24,182 INFO L264 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:30:24,185 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 13:30:24,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:30:24,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 13:30:24,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574725926] [2019-12-07 13:30:24,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:30:24,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:24,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:30:24,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:24,210 INFO L87 Difference]: Start difference. First operand 1677 states and 2356 transitions. Second operand 4 states. [2019-12-07 13:30:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:24,462 INFO L93 Difference]: Finished difference Result 5291 states and 7422 transitions. [2019-12-07 13:30:24,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:30:24,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-12-07 13:30:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:24,468 INFO L225 Difference]: With dead ends: 5291 [2019-12-07 13:30:24,468 INFO L226 Difference]: Without dead ends: 3521 [2019-12-07 13:30:24,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:30:24,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2019-12-07 13:30:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2065. [2019-12-07 13:30:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2019-12-07 13:30:24,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2916 transitions. [2019-12-07 13:30:24,506 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2916 transitions. Word has length 154 [2019-12-07 13:30:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:24,506 INFO L462 AbstractCegarLoop]: Abstraction has 2065 states and 2916 transitions. [2019-12-07 13:30:24,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:30:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2916 transitions. [2019-12-07 13:30:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 13:30:24,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:24,508 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2019-12-07 13:30:24,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:24,709 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:24,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:24,709 INFO L82 PathProgramCache]: Analyzing trace with hash 782353573, now seen corresponding path program 1 times [2019-12-07 13:30:24,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:24,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160426912] [2019-12-07 13:30:24,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 13:30:24,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160426912] [2019-12-07 13:30:24,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073063082] [2019-12-07 13:30:24,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/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 13:30:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:24,798 INFO L264 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:30:24,800 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:24,816 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 13:30:24,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:30:24,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 13:30:24,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598835847] [2019-12-07 13:30:24,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:30:24,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:24,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:30:24,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:24,817 INFO L87 Difference]: Start difference. First operand 2065 states and 2916 transitions. Second operand 4 states. [2019-12-07 13:30:25,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:25,034 INFO L93 Difference]: Finished difference Result 5632 states and 7889 transitions. [2019-12-07 13:30:25,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:30:25,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 13:30:25,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:25,038 INFO L225 Difference]: With dead ends: 5632 [2019-12-07 13:30:25,038 INFO L226 Difference]: Without dead ends: 3574 [2019-12-07 13:30:25,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:30:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-12-07 13:30:25,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 2573. [2019-12-07 13:30:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2573 states. [2019-12-07 13:30:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 3491 transitions. [2019-12-07 13:30:25,084 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 3491 transitions. Word has length 156 [2019-12-07 13:30:25,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:25,084 INFO L462 AbstractCegarLoop]: Abstraction has 2573 states and 3491 transitions. [2019-12-07 13:30:25,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:30:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3491 transitions. [2019-12-07 13:30:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 13:30:25,086 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:25,086 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:25,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:25,286 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:25,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash -571340489, now seen corresponding path program 1 times [2019-12-07 13:30:25,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:25,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108379871] [2019-12-07 13:30:25,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 13:30:25,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108379871] [2019-12-07 13:30:25,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705143047] [2019-12-07 13:30:25,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/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 13:30:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:25,381 INFO L264 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:30:25,383 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-07 13:30:25,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:30:25,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 13:30:25,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672057185] [2019-12-07 13:30:25,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:30:25,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:25,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:30:25,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:25,400 INFO L87 Difference]: Start difference. First operand 2573 states and 3491 transitions. Second operand 4 states. [2019-12-07 13:30:25,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:25,655 INFO L93 Difference]: Finished difference Result 6269 states and 8443 transitions. [2019-12-07 13:30:25,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:30:25,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-12-07 13:30:25,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:25,660 INFO L225 Difference]: With dead ends: 6269 [2019-12-07 13:30:25,660 INFO L226 Difference]: Without dead ends: 3674 [2019-12-07 13:30:25,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:30:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2019-12-07 13:30:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 2279. [2019-12-07 13:30:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2019-12-07 13:30:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3070 transitions. [2019-12-07 13:30:25,734 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3070 transitions. Word has length 163 [2019-12-07 13:30:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:25,734 INFO L462 AbstractCegarLoop]: Abstraction has 2279 states and 3070 transitions. [2019-12-07 13:30:25,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:30:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3070 transitions. [2019-12-07 13:30:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 13:30:25,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:25,736 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:30:25,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:25,937 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:25,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:25,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2030054557, now seen corresponding path program 1 times [2019-12-07 13:30:25,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:25,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879902269] [2019-12-07 13:30:25,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-12-07 13:30:25,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879902269] [2019-12-07 13:30:25,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:25,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:30:25,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651707364] [2019-12-07 13:30:25,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:25,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:25,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:25,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:25,975 INFO L87 Difference]: Start difference. First operand 2279 states and 3070 transitions. Second operand 3 states. [2019-12-07 13:30:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:26,029 INFO L93 Difference]: Finished difference Result 5493 states and 7329 transitions. [2019-12-07 13:30:26,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:26,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-12-07 13:30:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:26,034 INFO L225 Difference]: With dead ends: 5493 [2019-12-07 13:30:26,034 INFO L226 Difference]: Without dead ends: 3221 [2019-12-07 13:30:26,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2019-12-07 13:30:26,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 3217. [2019-12-07 13:30:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2019-12-07 13:30:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4257 transitions. [2019-12-07 13:30:26,093 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4257 transitions. Word has length 165 [2019-12-07 13:30:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:26,093 INFO L462 AbstractCegarLoop]: Abstraction has 3217 states and 4257 transitions. [2019-12-07 13:30:26,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4257 transitions. [2019-12-07 13:30:26,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 13:30:26,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:26,095 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 13:30:26,095 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:26,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:26,096 INFO L82 PathProgramCache]: Analyzing trace with hash -36905074, now seen corresponding path program 1 times [2019-12-07 13:30:26,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:26,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110319091] [2019-12-07 13:30:26,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:26,102 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 13:30:26,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987233817] [2019-12-07 13:30:26,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:26,150 INFO L264 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:30:26,152 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-07 13:30:26,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110319091] [2019-12-07 13:30:26,189 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:30:26,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987233817] [2019-12-07 13:30:26,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:26,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:30:26,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170576384] [2019-12-07 13:30:26,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:30:26,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:26,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:30:26,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:26,191 INFO L87 Difference]: Start difference. First operand 3217 states and 4257 transitions. Second operand 4 states. [2019-12-07 13:30:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:26,421 INFO L93 Difference]: Finished difference Result 5057 states and 6580 transitions. [2019-12-07 13:30:26,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:30:26,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-12-07 13:30:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:26,425 INFO L225 Difference]: With dead ends: 5057 [2019-12-07 13:30:26,425 INFO L226 Difference]: Without dead ends: 4092 [2019-12-07 13:30:26,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 183 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 13:30:26,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2019-12-07 13:30:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 3522. [2019-12-07 13:30:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3522 states. [2019-12-07 13:30:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 4633 transitions. [2019-12-07 13:30:26,487 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 4633 transitions. Word has length 186 [2019-12-07 13:30:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:26,488 INFO L462 AbstractCegarLoop]: Abstraction has 3522 states and 4633 transitions. [2019-12-07 13:30:26,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:30:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 4633 transitions. [2019-12-07 13:30:26,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-12-07 13:30:26,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:26,490 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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 13:30:26,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:26,692 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:26,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:26,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1106021424, now seen corresponding path program 1 times [2019-12-07 13:30:26,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:26,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357497830] [2019-12-07 13:30:26,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:26,714 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 13:30:26,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [207645348] [2019-12-07 13:30:26,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:26,847 INFO L264 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:30:26,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 13:30:26,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357497830] [2019-12-07 13:30:26,896 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:30:26,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207645348] [2019-12-07 13:30:26,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:26,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:30:26,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907530517] [2019-12-07 13:30:26,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:30:26,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:26,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:30:26,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:30:26,897 INFO L87 Difference]: Start difference. First operand 3522 states and 4633 transitions. Second operand 5 states. [2019-12-07 13:30:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:27,085 INFO L93 Difference]: Finished difference Result 5415 states and 7085 transitions. [2019-12-07 13:30:27,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:30:27,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2019-12-07 13:30:27,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:27,091 INFO L225 Difference]: With dead ends: 5415 [2019-12-07 13:30:27,091 INFO L226 Difference]: Without dead ends: 5414 [2019-12-07 13:30:27,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 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 13:30:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2019-12-07 13:30:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 4841. [2019-12-07 13:30:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4841 states. [2019-12-07 13:30:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 6383 transitions. [2019-12-07 13:30:27,197 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 6383 transitions. Word has length 188 [2019-12-07 13:30:27,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:27,197 INFO L462 AbstractCegarLoop]: Abstraction has 4841 states and 6383 transitions. [2019-12-07 13:30:27,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:30:27,197 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 6383 transitions. [2019-12-07 13:30:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-07 13:30:27,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:27,199 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 13:30:27,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:27,401 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:27,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:27,401 INFO L82 PathProgramCache]: Analyzing trace with hash 73074738, now seen corresponding path program 1 times [2019-12-07 13:30:27,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:27,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95167075] [2019-12-07 13:30:27,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:27,421 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 13:30:27,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1225481112] [2019-12-07 13:30:27,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:27,495 INFO L264 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:30:27,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-12-07 13:30:27,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95167075] [2019-12-07 13:30:27,586 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:30:27,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225481112] [2019-12-07 13:30:27,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:27,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:30:27,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324453140] [2019-12-07 13:30:27,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:30:27,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:27,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:30:27,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:30:27,587 INFO L87 Difference]: Start difference. First operand 4841 states and 6383 transitions. Second operand 5 states. [2019-12-07 13:30:27,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:27,835 INFO L93 Difference]: Finished difference Result 9086 states and 11995 transitions. [2019-12-07 13:30:27,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:30:27,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-12-07 13:30:27,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:27,839 INFO L225 Difference]: With dead ends: 9086 [2019-12-07 13:30:27,839 INFO L226 Difference]: Without dead ends: 4944 [2019-12-07 13:30:27,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 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 13:30:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2019-12-07 13:30:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4935. [2019-12-07 13:30:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4935 states. [2019-12-07 13:30:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4935 states to 4935 states and 6457 transitions. [2019-12-07 13:30:27,925 INFO L78 Accepts]: Start accepts. Automaton has 4935 states and 6457 transitions. Word has length 189 [2019-12-07 13:30:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:27,925 INFO L462 AbstractCegarLoop]: Abstraction has 4935 states and 6457 transitions. [2019-12-07 13:30:27,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:30:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 4935 states and 6457 transitions. [2019-12-07 13:30:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-12-07 13:30:27,927 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:27,927 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 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, 1, 1, 1, 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 13:30:28,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:28,129 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:28,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1864895527, now seen corresponding path program 1 times [2019-12-07 13:30:28,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:28,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992176944] [2019-12-07 13:30:28,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:28,148 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-12-07 13:30:28,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090968966] [2019-12-07 13:30:28,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:28,197 INFO L264 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 13:30:28,199 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-12-07 13:30:28,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992176944] [2019-12-07 13:30:28,228 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:30:28,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090968966] [2019-12-07 13:30:28,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:28,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:30:28,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166323948] [2019-12-07 13:30:28,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:28,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:28,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:28,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:28,229 INFO L87 Difference]: Start difference. First operand 4935 states and 6457 transitions. Second operand 3 states. [2019-12-07 13:30:28,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:28,391 INFO L93 Difference]: Finished difference Result 9835 states and 12868 transitions. [2019-12-07 13:30:28,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:28,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-12-07 13:30:28,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:28,394 INFO L225 Difference]: With dead ends: 9835 [2019-12-07 13:30:28,394 INFO L226 Difference]: Without dead ends: 3433 [2019-12-07 13:30:28,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 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 13:30:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2019-12-07 13:30:28,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3427. [2019-12-07 13:30:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3427 states. [2019-12-07 13:30:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 4448 transitions. [2019-12-07 13:30:28,454 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 4448 transitions. Word has length 196 [2019-12-07 13:30:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:28,454 INFO L462 AbstractCegarLoop]: Abstraction has 3427 states and 4448 transitions. [2019-12-07 13:30:28,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 4448 transitions. [2019-12-07 13:30:28,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-12-07 13:30:28,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:28,456 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 13:30:28,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:28,656 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:28,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:28,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1327391442, now seen corresponding path program 1 times [2019-12-07 13:30:28,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:28,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589967548] [2019-12-07 13:30:28,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-07 13:30:28,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589967548] [2019-12-07 13:30:28,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:28,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:30:28,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58276644] [2019-12-07 13:30:28,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:28,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:28,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:28,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:28,692 INFO L87 Difference]: Start difference. First operand 3427 states and 4448 transitions. Second operand 3 states. [2019-12-07 13:30:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:28,814 INFO L93 Difference]: Finished difference Result 6506 states and 8421 transitions. [2019-12-07 13:30:28,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:28,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-12-07 13:30:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:28,816 INFO L225 Difference]: With dead ends: 6506 [2019-12-07 13:30:28,816 INFO L226 Difference]: Without dead ends: 2978 [2019-12-07 13:30:28,818 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 13:30:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-12-07 13:30:28,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2936. [2019-12-07 13:30:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2936 states. [2019-12-07 13:30:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 3773 transitions. [2019-12-07 13:30:28,866 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 3773 transitions. Word has length 197 [2019-12-07 13:30:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:28,867 INFO L462 AbstractCegarLoop]: Abstraction has 2936 states and 3773 transitions. [2019-12-07 13:30:28,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:28,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 3773 transitions. [2019-12-07 13:30:28,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-12-07 13:30:28,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:28,869 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:30:28,869 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:28,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:28,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1162887835, now seen corresponding path program 1 times [2019-12-07 13:30:28,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:28,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38937088] [2019-12-07 13:30:28,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1163 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-12-07 13:30:28,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38937088] [2019-12-07 13:30:28,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:28,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:30:28,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070643689] [2019-12-07 13:30:28,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:28,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:28,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:28,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:28,940 INFO L87 Difference]: Start difference. First operand 2936 states and 3773 transitions. Second operand 3 states. [2019-12-07 13:30:29,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:29,058 INFO L93 Difference]: Finished difference Result 6138 states and 7862 transitions. [2019-12-07 13:30:29,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:29,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-12-07 13:30:29,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:29,060 INFO L225 Difference]: With dead ends: 6138 [2019-12-07 13:30:29,060 INFO L226 Difference]: Without dead ends: 3224 [2019-12-07 13:30:29,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:29,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2019-12-07 13:30:29,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 3208. [2019-12-07 13:30:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-12-07 13:30:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 4085 transitions. [2019-12-07 13:30:29,111 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 4085 transitions. Word has length 335 [2019-12-07 13:30:29,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:29,111 INFO L462 AbstractCegarLoop]: Abstraction has 3208 states and 4085 transitions. [2019-12-07 13:30:29,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:29,111 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 4085 transitions. [2019-12-07 13:30:29,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-12-07 13:30:29,113 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:29,113 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:30:29,113 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:29,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:29,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1926092110, now seen corresponding path program 1 times [2019-12-07 13:30:29,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:29,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381270709] [2019-12-07 13:30:29,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 823 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-12-07 13:30:29,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381270709] [2019-12-07 13:30:29,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:30:29,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:30:29,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878564340] [2019-12-07 13:30:29,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:30:29,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:29,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:30:29,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:29,223 INFO L87 Difference]: Start difference. First operand 3208 states and 4085 transitions. Second operand 3 states. [2019-12-07 13:30:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:29,343 INFO L93 Difference]: Finished difference Result 6443 states and 8197 transitions. [2019-12-07 13:30:29,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:30:29,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-12-07 13:30:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:29,346 INFO L225 Difference]: With dead ends: 6443 [2019-12-07 13:30:29,346 INFO L226 Difference]: Without dead ends: 3257 [2019-12-07 13:30:29,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:30:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2019-12-07 13:30:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 3030. [2019-12-07 13:30:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-12-07 13:30:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3851 transitions. [2019-12-07 13:30:29,396 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3851 transitions. Word has length 366 [2019-12-07 13:30:29,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:29,397 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3851 transitions. [2019-12-07 13:30:29,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:30:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3851 transitions. [2019-12-07 13:30:29,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-12-07 13:30:29,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:30:29,399 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 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] [2019-12-07 13:30:29,399 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 13:30:29,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:30:29,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1476749664, now seen corresponding path program 1 times [2019-12-07 13:30:29,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:30:29,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153596051] [2019-12-07 13:30:29,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:30:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-12-07 13:30:29,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153596051] [2019-12-07 13:30:29,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071369750] [2019-12-07 13:30:29,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:30:29,568 INFO L264 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:30:29,571 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:30:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 353 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-12-07 13:30:29,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:30:29,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-07 13:30:29,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289293045] [2019-12-07 13:30:29,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:30:29,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:30:29,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:30:29,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:30:29,666 INFO L87 Difference]: Start difference. First operand 3030 states and 3851 transitions. Second operand 4 states. [2019-12-07 13:30:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:30:29,785 INFO L93 Difference]: Finished difference Result 4189 states and 5327 transitions. [2019-12-07 13:30:29,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:30:29,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 399 [2019-12-07 13:30:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:30:29,786 INFO L225 Difference]: With dead ends: 4189 [2019-12-07 13:30:29,786 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 13:30:29,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:30:29,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 13:30:29,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 13:30:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 13:30:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 13:30:29,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 399 [2019-12-07 13:30:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:30:29,789 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 13:30:29,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:30:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 13:30:29,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 13:30:29,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:30:29,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 13:30:30,801 WARN L192 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 435 DAG size of output: 270 [2019-12-07 13:30:31,577 WARN L192 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 436 DAG size of output: 271 [2019-12-07 13:30:31,939 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-12-07 13:30:32,124 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 29 [2019-12-07 13:30:32,344 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 49 [2019-12-07 13:30:32,446 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-12-07 13:30:34,225 WARN L192 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 233 DAG size of output: 83 [2019-12-07 13:30:34,425 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-12-07 13:30:34,682 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 44 [2019-12-07 13:30:34,976 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 17 [2019-12-07 13:30:35,203 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 17 [2019-12-07 13:30:35,492 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 49 [2019-12-07 13:30:35,619 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 17 [2019-12-07 13:30:35,942 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-12-07 13:30:40,853 WARN L192 SmtUtils]: Spent 4.91 s on a formula simplification. DAG size of input: 234 DAG size of output: 83 [2019-12-07 13:30:41,417 WARN L192 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 9 [2019-12-07 13:30:41,699 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2019-12-07 13:30:43,210 WARN L192 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 122 DAG size of output: 38 [2019-12-07 13:30:43,217 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-12-07 13:30:43,217 INFO L246 CegarLoopResult]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-12-07 13:30:43,217 INFO L246 CegarLoopResult]: For program point L399(lines 399 405) no Hoare annotation was computed. [2019-12-07 13:30:43,217 INFO L246 CegarLoopResult]: For program point L201(lines 201 592) no Hoare annotation was computed. [2019-12-07 13:30:43,218 INFO L246 CegarLoopResult]: For program point L168(lines 168 603) no Hoare annotation was computed. [2019-12-07 13:30:43,218 INFO L246 CegarLoopResult]: For program point L135(lines 135 614) no Hoare annotation was computed. [2019-12-07 13:30:43,218 INFO L246 CegarLoopResult]: For program point L102(lines 102 625) no Hoare annotation was computed. [2019-12-07 13:30:43,218 INFO L246 CegarLoopResult]: For program point L466(lines 466 470) no Hoare annotation was computed. [2019-12-07 13:30:43,219 INFO L242 CegarLoopResult]: At program point L202(lines 198 593) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) [2019-12-07 13:30:43,219 INFO L242 CegarLoopResult]: At program point L103(lines 102 625) the Hoare annotation is: false [2019-12-07 13:30:43,219 INFO L246 CegarLoopResult]: For program point L501(lines 501 505) no Hoare annotation was computed. [2019-12-07 13:30:43,220 INFO L246 CegarLoopResult]: For program point L501-2(lines 209 587) no Hoare annotation was computed. [2019-12-07 13:30:43,220 INFO L246 CegarLoopResult]: For program point L237(lines 237 242) no Hoare annotation was computed. [2019-12-07 13:30:43,220 INFO L246 CegarLoopResult]: For program point L204(lines 204 591) no Hoare annotation was computed. [2019-12-07 13:30:43,220 INFO L246 CegarLoopResult]: For program point L171(lines 171 602) no Hoare annotation was computed. [2019-12-07 13:30:43,220 INFO L246 CegarLoopResult]: For program point L138(lines 138 613) no Hoare annotation was computed. [2019-12-07 13:30:43,221 INFO L246 CegarLoopResult]: For program point L105(lines 105 624) no Hoare annotation was computed. [2019-12-07 13:30:43,221 INFO L246 CegarLoopResult]: For program point L502(line 502) no Hoare annotation was computed. [2019-12-07 13:30:43,221 INFO L246 CegarLoopResult]: For program point L502-1(line 502) no Hoare annotation was computed. [2019-12-07 13:30:43,221 INFO L246 CegarLoopResult]: For program point L502-2(line 502) no Hoare annotation was computed. [2019-12-07 13:30:43,221 INFO L246 CegarLoopResult]: For program point L502-3(line 502) no Hoare annotation was computed. [2019-12-07 13:30:43,222 INFO L242 CegarLoopResult]: At program point L205(lines 204 591) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-12-07 13:30:43,222 INFO L242 CegarLoopResult]: At program point L172(lines 168 603) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) [2019-12-07 13:30:43,223 INFO L242 CegarLoopResult]: At program point L139(lines 135 614) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 13:30:43,223 INFO L246 CegarLoopResult]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-12-07 13:30:43,223 INFO L246 CegarLoopResult]: For program point L272(lines 272 276) no Hoare annotation was computed. [2019-12-07 13:30:43,224 INFO L246 CegarLoopResult]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-12-07 13:30:43,224 INFO L246 CegarLoopResult]: For program point L306-2(lines 209 587) no Hoare annotation was computed. [2019-12-07 13:30:43,224 INFO L246 CegarLoopResult]: For program point L174(lines 174 601) no Hoare annotation was computed. [2019-12-07 13:30:43,224 INFO L246 CegarLoopResult]: For program point L141(lines 141 612) no Hoare annotation was computed. [2019-12-07 13:30:43,224 INFO L246 CegarLoopResult]: For program point L108(lines 108 623) no Hoare annotation was computed. [2019-12-07 13:30:43,225 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2019-12-07 13:30:43,225 INFO L246 CegarLoopResult]: For program point L571(lines 571 581) no Hoare annotation was computed. [2019-12-07 13:30:43,225 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 581) no Hoare annotation was computed. [2019-12-07 13:30:43,225 INFO L246 CegarLoopResult]: For program point L439-1(lines 439 451) no Hoare annotation was computed. [2019-12-07 13:30:43,226 INFO L242 CegarLoopResult]: At program point L208(lines 207 590) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-12-07 13:30:43,226 INFO L246 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-12-07 13:30:43,226 INFO L246 CegarLoopResult]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-12-07 13:30:43,226 INFO L242 CegarLoopResult]: At program point L407(lines 398 418) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 13:30:43,227 INFO L246 CegarLoopResult]: For program point L341(lines 341 345) no Hoare annotation was computed. [2019-12-07 13:30:43,227 INFO L246 CegarLoopResult]: For program point L341-2(lines 209 587) no Hoare annotation was computed. [2019-12-07 13:30:43,227 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-12-07 13:30:43,227 INFO L249 CegarLoopResult]: At program point L672(lines 64 674) the Hoare annotation is: true [2019-12-07 13:30:43,227 INFO L246 CegarLoopResult]: For program point L639(lines 639 645) no Hoare annotation was computed. [2019-12-07 13:30:43,228 INFO L246 CegarLoopResult]: For program point L540(lines 540 545) no Hoare annotation was computed. [2019-12-07 13:30:43,228 INFO L246 CegarLoopResult]: For program point L177(lines 177 600) no Hoare annotation was computed. [2019-12-07 13:30:43,228 INFO L246 CegarLoopResult]: For program point L144(lines 144 611) no Hoare annotation was computed. [2019-12-07 13:30:43,228 INFO L246 CegarLoopResult]: For program point L111(lines 111 622) no Hoare annotation was computed. [2019-12-07 13:30:43,229 INFO L249 CegarLoopResult]: At program point L673(lines 9 675) the Hoare annotation is: true [2019-12-07 13:30:43,229 INFO L246 CegarLoopResult]: For program point L574(lines 574 578) no Hoare annotation was computed. [2019-12-07 13:30:43,229 INFO L246 CegarLoopResult]: For program point L442(lines 442 447) no Hoare annotation was computed. [2019-12-07 13:30:43,229 INFO L242 CegarLoopResult]: At program point L178(lines 174 601) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 13:30:43,230 INFO L242 CegarLoopResult]: At program point L145(lines 141 612) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 13:30:43,230 INFO L246 CegarLoopResult]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-12-07 13:30:43,230 INFO L242 CegarLoopResult]: At program point L212(lines 105 624) the Hoare annotation is: false [2019-12-07 13:30:43,230 INFO L246 CegarLoopResult]: For program point L180(lines 180 599) no Hoare annotation was computed. [2019-12-07 13:30:43,231 INFO L246 CegarLoopResult]: For program point L147(lines 147 610) no Hoare annotation was computed. [2019-12-07 13:30:43,231 INFO L246 CegarLoopResult]: For program point L114(lines 114 621) no Hoare annotation was computed. [2019-12-07 13:30:43,231 INFO L246 CegarLoopResult]: For program point L511(lines 511 515) no Hoare annotation was computed. [2019-12-07 13:30:43,231 INFO L246 CegarLoopResult]: For program point L478(lines 478 482) no Hoare annotation was computed. [2019-12-07 13:30:43,231 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-12-07 13:30:43,232 INFO L246 CegarLoopResult]: For program point L511-2(lines 511 515) no Hoare annotation was computed. [2019-12-07 13:30:43,232 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-12-07 13:30:43,232 INFO L246 CegarLoopResult]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-12-07 13:30:43,232 INFO L246 CegarLoopResult]: For program point L83-1(lines 64 674) no Hoare annotation was computed. [2019-12-07 13:30:43,232 INFO L246 CegarLoopResult]: For program point L183(lines 183 598) no Hoare annotation was computed. [2019-12-07 13:30:43,233 INFO L246 CegarLoopResult]: For program point L150(lines 150 609) no Hoare annotation was computed. [2019-12-07 13:30:43,233 INFO L246 CegarLoopResult]: For program point L117(lines 117 620) no Hoare annotation was computed. [2019-12-07 13:30:43,233 INFO L246 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-12-07 13:30:43,233 INFO L246 CegarLoopResult]: For program point L349(lines 349 380) no Hoare annotation was computed. [2019-12-07 13:30:43,233 INFO L246 CegarLoopResult]: For program point L316(lines 316 320) no Hoare annotation was computed. [2019-12-07 13:30:43,234 INFO L246 CegarLoopResult]: For program point L316-2(lines 316 320) no Hoare annotation was computed. [2019-12-07 13:30:43,234 INFO L246 CegarLoopResult]: For program point L217(lines 217 221) no Hoare annotation was computed. [2019-12-07 13:30:43,234 INFO L242 CegarLoopResult]: At program point L184(lines 180 599) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 13:30:43,234 INFO L242 CegarLoopResult]: At program point L151(lines 147 610) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 13:30:43,235 INFO L246 CegarLoopResult]: For program point L217-2(lines 209 587) no Hoare annotation was computed. [2019-12-07 13:30:43,235 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 13:30:43,235 INFO L246 CegarLoopResult]: For program point L186(lines 186 597) no Hoare annotation was computed. [2019-12-07 13:30:43,235 INFO L246 CegarLoopResult]: For program point L153(lines 153 608) no Hoare annotation was computed. [2019-12-07 13:30:43,235 INFO L246 CegarLoopResult]: For program point L120(lines 120 619) no Hoare annotation was computed. [2019-12-07 13:30:43,236 INFO L246 CegarLoopResult]: For program point L550(lines 550 554) no Hoare annotation was computed. [2019-12-07 13:30:43,236 INFO L246 CegarLoopResult]: For program point L352(lines 352 379) no Hoare annotation was computed. [2019-12-07 13:30:43,236 INFO L246 CegarLoopResult]: For program point L352-1(lines 352 379) no Hoare annotation was computed. [2019-12-07 13:30:43,236 INFO L242 CegarLoopResult]: At program point L121(lines 117 620) the Hoare annotation is: false [2019-12-07 13:30:43,236 INFO L242 CegarLoopResult]: At program point L551(lines 64 674) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)) [2019-12-07 13:30:43,237 INFO L246 CegarLoopResult]: For program point L353(lines 353 376) no Hoare annotation was computed. [2019-12-07 13:30:43,237 INFO L246 CegarLoopResult]: For program point L254(lines 254 266) no Hoare annotation was computed. [2019-12-07 13:30:43,237 INFO L246 CegarLoopResult]: For program point L255(lines 255 260) no Hoare annotation was computed. [2019-12-07 13:30:43,237 INFO L246 CegarLoopResult]: For program point L189(lines 189 596) no Hoare annotation was computed. [2019-12-07 13:30:43,237 INFO L246 CegarLoopResult]: For program point L156(lines 156 607) no Hoare annotation was computed. [2019-12-07 13:30:43,237 INFO L246 CegarLoopResult]: For program point L123(lines 123 618) no Hoare annotation was computed. [2019-12-07 13:30:43,238 INFO L249 CegarLoopResult]: At program point L685(lines 676 687) the Hoare annotation is: true [2019-12-07 13:30:43,238 INFO L246 CegarLoopResult]: For program point L388(lines 388 419) no Hoare annotation was computed. [2019-12-07 13:30:43,238 INFO L246 CegarLoopResult]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-12-07 13:30:43,238 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 13:30:43,238 INFO L246 CegarLoopResult]: For program point L289-2(lines 209 587) no Hoare annotation was computed. [2019-12-07 13:30:43,238 INFO L242 CegarLoopResult]: At program point L190(lines 186 597) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse6 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse9 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-12-07 13:30:43,239 INFO L242 CegarLoopResult]: At program point L157(lines 153 608) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 13:30:43,239 INFO L242 CegarLoopResult]: At program point L124(lines 123 618) the Hoare annotation is: (and (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 13:30:43,239 INFO L246 CegarLoopResult]: For program point L521(lines 521 526) no Hoare annotation was computed. [2019-12-07 13:30:43,239 INFO L246 CegarLoopResult]: For program point L389(lines 389 395) no Hoare annotation was computed. [2019-12-07 13:30:43,240 INFO L246 CegarLoopResult]: For program point L356(lines 356 375) no Hoare annotation was computed. [2019-12-07 13:30:43,240 INFO L242 CegarLoopResult]: At program point L588(lines 99 656) the Hoare annotation is: (let ((.cse6 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse4 .cse6 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse9) (and .cse0 .cse1 .cse5 .cse7 .cse3 .cse8) (and .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse5 .cse7 .cse8) (and .cse10 .cse5 .cse7 .cse8) (and .cse0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse10 .cse16 .cse5 .cse2 .cse8 .cse17 .cse9) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse11 .cse18 .cse12 .cse19 .cse13 .cse14 .cse20 .cse15 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse21 .cse16 .cse5 .cse8 .cse17) (and .cse20 .cse4 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse21 .cse18 .cse19))) [2019-12-07 13:30:43,240 INFO L246 CegarLoopResult]: For program point L555(lines 555 559) no Hoare annotation was computed. [2019-12-07 13:30:43,240 INFO L246 CegarLoopResult]: For program point L489(lines 489 493) no Hoare annotation was computed. [2019-12-07 13:30:43,241 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 502) no Hoare annotation was computed. [2019-12-07 13:30:43,241 INFO L246 CegarLoopResult]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-12-07 13:30:43,241 INFO L246 CegarLoopResult]: For program point L357-2(lines 356 373) no Hoare annotation was computed. [2019-12-07 13:30:43,241 INFO L246 CegarLoopResult]: For program point L192(lines 192 595) no Hoare annotation was computed. [2019-12-07 13:30:43,241 INFO L246 CegarLoopResult]: For program point L159(lines 159 606) no Hoare annotation was computed. [2019-12-07 13:30:43,241 INFO L246 CegarLoopResult]: For program point L126(lines 126 617) no Hoare annotation was computed. [2019-12-07 13:30:43,241 INFO L246 CegarLoopResult]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-12-07 13:30:43,241 INFO L246 CegarLoopResult]: For program point L325-1(lines 325 334) no Hoare annotation was computed. [2019-12-07 13:30:43,242 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-12-07 13:30:43,242 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 13:30:43,242 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 262) no Hoare annotation was computed. [2019-12-07 13:30:43,242 INFO L249 CegarLoopResult]: At program point L657(lines 98 658) the Hoare annotation is: true [2019-12-07 13:30:43,242 INFO L246 CegarLoopResult]: For program point L195(lines 195 594) no Hoare annotation was computed. [2019-12-07 13:30:43,242 INFO L246 CegarLoopResult]: For program point L162(lines 162 605) no Hoare annotation was computed. [2019-12-07 13:30:43,242 INFO L246 CegarLoopResult]: For program point L129(lines 129 616) no Hoare annotation was computed. [2019-12-07 13:30:43,242 INFO L246 CegarLoopResult]: For program point L262(line 262) no Hoare annotation was computed. [2019-12-07 13:30:43,243 INFO L246 CegarLoopResult]: For program point L229(lines 229 246) no Hoare annotation was computed. [2019-12-07 13:30:43,243 INFO L246 CegarLoopResult]: For program point L262-1(line 262) no Hoare annotation was computed. [2019-12-07 13:30:43,243 INFO L242 CegarLoopResult]: At program point L196(lines 192 595) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse4 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292))) (.cse7 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0)))) (or (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse5 (<= 8640 ULTIMATE.start_ssl3_accept_~s__state~0) .cse6 .cse7))) [2019-12-07 13:30:43,243 INFO L242 CegarLoopResult]: At program point L163(lines 159 606) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 13:30:43,243 INFO L246 CegarLoopResult]: For program point L229-2(lines 209 587) no Hoare annotation was computed. [2019-12-07 13:30:43,243 INFO L246 CegarLoopResult]: For program point L626(lines 626 654) no Hoare annotation was computed. [2019-12-07 13:30:43,243 INFO L246 CegarLoopResult]: For program point L329(lines 329 333) no Hoare annotation was computed. [2019-12-07 13:30:43,244 INFO L246 CegarLoopResult]: For program point L627(lines 627 651) no Hoare annotation was computed. [2019-12-07 13:30:43,244 INFO L246 CegarLoopResult]: For program point L561(lines 561 565) no Hoare annotation was computed. [2019-12-07 13:30:43,244 INFO L246 CegarLoopResult]: For program point L528(lines 528 532) no Hoare annotation was computed. [2019-12-07 13:30:43,244 INFO L246 CegarLoopResult]: For program point L561-2(lines 561 565) no Hoare annotation was computed. [2019-12-07 13:30:43,244 INFO L246 CegarLoopResult]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-12-07 13:30:43,244 INFO L246 CegarLoopResult]: For program point L528-2(lines 209 587) no Hoare annotation was computed. [2019-12-07 13:30:43,244 INFO L246 CegarLoopResult]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-12-07 13:30:43,244 INFO L242 CegarLoopResult]: At program point L363(lines 346 381) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 13:30:43,245 INFO L246 CegarLoopResult]: For program point L264(line 264) no Hoare annotation was computed. [2019-12-07 13:30:43,245 INFO L246 CegarLoopResult]: For program point L231(lines 231 236) no Hoare annotation was computed. [2019-12-07 13:30:43,245 INFO L246 CegarLoopResult]: For program point L264-1(line 264) no Hoare annotation was computed. [2019-12-07 13:30:43,245 INFO L246 CegarLoopResult]: For program point L198(lines 198 593) no Hoare annotation was computed. [2019-12-07 13:30:43,245 INFO L246 CegarLoopResult]: For program point L165(lines 165 604) no Hoare annotation was computed. [2019-12-07 13:30:43,245 INFO L246 CegarLoopResult]: For program point L132(lines 132 615) no Hoare annotation was computed. [2019-12-07 13:30:43,246 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 656) the Hoare annotation is: (let ((.cse6 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse9 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 16384))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 24576))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 12292)))) (or (and .cse0 .cse1 (<= 8576 ULTIMATE.start_ssl3_accept_~s__state~0) .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse4 .cse6 (= ULTIMATE.start_ssl3_accept_~s__state~0 8640) .cse9) (and .cse0 .cse1 .cse5 .cse7 .cse3 .cse8) (and .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse5 .cse7 .cse8) (and .cse10 .cse5 .cse7 .cse8) (and .cse0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse10 .cse16 .cse5 .cse2 .cse8 .cse17 .cse9) (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse11 .cse18 .cse12 .cse19 .cse13 .cse14 .cse20 .cse15 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse21 .cse16 .cse5 .cse8 .cse17) (and .cse20 .cse4 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse21 .cse18 .cse19))) [2019-12-07 13:30:43,246 INFO L246 CegarLoopResult]: For program point L661(lines 661 665) no Hoare annotation was computed. [2019-12-07 13:30:43,246 INFO L246 CegarLoopResult]: For program point L628(lines 628 637) no Hoare annotation was computed. [2019-12-07 13:30:43,246 INFO L246 CegarLoopResult]: For program point L661-2(lines 661 665) no Hoare annotation was computed. [2019-12-07 13:30:43,246 INFO L246 CegarLoopResult]: For program point L628-2(lines 627 649) no Hoare annotation was computed. [2019-12-07 13:30:43,246 INFO L242 CegarLoopResult]: At program point L397(lines 388 419) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) [2019-12-07 13:30:43,246 INFO L242 CegarLoopResult]: At program point L166(lines 165 604) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195)))) (or (and .cse0 .cse1 (= 8640 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse2 .cse3 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse1 .cse2 (<= 8576 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse3))) [2019-12-07 13:30:43,247 INFO L242 CegarLoopResult]: At program point L133(lines 126 617) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8513))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8560))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8497))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8192))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8496))) (.cse14 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8195))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-12-07 13:30:43,247 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 13:30:43,247 INFO L246 CegarLoopResult]: For program point L365(lines 365 369) no Hoare annotation was computed. [2019-12-07 13:30:43,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:30:43 BoogieIcfgContainer [2019-12-07 13:30:43,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:30:43,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:30:43,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:30:43,277 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:30:43,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:30:18" (3/4) ... [2019-12-07 13:30:43,279 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 13:30:43,292 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 13:30:43,292 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 13:30:43,370 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_47b8588f-3e2a-412c-bb92-cf3bc76c07e5/bin/uautomizer/witness.graphml [2019-12-07 13:30:43,370 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:30:43,371 INFO L168 Benchmark]: Toolchain (without parser) took 25596.45 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 774.9 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -112.1 MB). Peak memory consumption was 662.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:30:43,372 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:30:43,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -137.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:30:43,372 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:30:43,372 INFO L168 Benchmark]: Boogie Preprocessor took 25.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:30:43,373 INFO L168 Benchmark]: RCFGBuilder took 420.38 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: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:30:43,373 INFO L168 Benchmark]: TraceAbstraction took 24739.26 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 680.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -61.3 MB). Peak memory consumption was 786.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:30:43,373 INFO L168 Benchmark]: Witness Printer took 94.20 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:30:43,375 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -137.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 420.38 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: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24739.26 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 680.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -61.3 MB). Peak memory consumption was 786.6 MB. Max. memory is 11.5 GB. * Witness Printer took 94.20 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 502]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 502]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 502]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 502]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 262]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && !(s__state == 8192)) && 8640 == s__s3__tmp__next_state___0) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit)) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8192)) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8513) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0) || (((((blastFlag <= 3 && !(s__state == 8192)) && 8640 == s__s3__tmp__next_state___0) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8192)) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195))) || (((!(s__state == 8448) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195))) || ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8195)) && !(s__state == 8480))) || (((((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 16384)) && !(s__state == 24576)) && !(s__state == 12292)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8656)) && !(s__state == 8657)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit)) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && 8672 <= s__state) && !(s__state == 16384)) && !(s__state == 24576)) && !(s__state == 12292) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && 8576 <= s__state) && s__state <= 8640) || (((blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && !(s__state == 8576)) && 8576 <= s__state) && s__state <= 8640) || (((blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640) && !(0 == s__hit)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) || (((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8560)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && 8576 <= s__state) && s__state <= 8576) && 8576 <= s__s3__tmp__next_state___0) || (((((blastFlag <= 3 && !(s__state == 8192)) && 8640 == s__s3__tmp__next_state___0) && s__state <= 8448) && !(s__state == 8195)) && !(0 == s__hit))) || (((blastFlag <= 3 && 8640 == s__s3__tmp__next_state___0) && s__state == 8640) && !(0 == s__hit))) || (((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8192)) && s__state <= 8448) && 8576 <= s__s3__tmp__next_state___0) && !(s__state == 8195))) || ((((blastFlag <= 3 && s__s3__tmp__next_state___0 <= 3) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195))) || (((!(s__state == 8448) && !(s__state == 8192)) && s__state <= 8448) && !(s__state == 8195))) || ((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8545)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8497)) && !(s__state == 8192)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480)) && !(0 == s__hit))) || ((((((((((((((((blastFlag <= 2 && !(s__state == 8657)) && !(s__state == 8513)) && !(s__state == 24576)) && !(s__state == 8545)) && !(s__state == 12292)) && !(s__state == 8561)) && !(s__state == 8529)) && !(s__state == 8673)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8195)) && !(s__state == 8480))) || (((((!(s__state == 8673) && blastFlag <= 3) && 8672 <= s__state) && !(s__state == 16384)) && !(s__state == 24576)) && !(s__state == 12292)) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 8576 <= s__state) && s__state <= 8640 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: !(s__state == 12292) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && !(s__state == 8513)) && !(s__state == 8512)) && !(s__state == 8528)) && !(s__state == 8545)) && !(s__state == 8544)) && !(s__state == 8529)) && !(s__state == 8481)) && !(s__state == 8448)) && !(s__state == 8576)) && !(s__state == 8497)) && !(s__state == 8192)) && !(s__state == 8496)) && s__state <= 8576) && !(s__state == 8195)) && !(s__state == 8480) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 8576)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) || (((((((blastFlag <= 2 && !(s__state == 8673)) && !(s__state == 16384)) && !(s__state == 8672)) && 8576 <= s__state) && !(s__state == 24576)) && !(s__state == 12292)) && !(0 == s__hit))) || (((((((!(s__state == 8673) && blastFlag <= 3) && !(s__state == 16384)) && !(s__state == 8672)) && !(s__state == 24576)) && 8640 <= s__state) && !(s__state == 12292)) && !(0 == s__hit)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 8 error locations. Result: SAFE, OverallTime: 11.4s, OverallIterations: 39, TraceHistogramMax: 14, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.2s, HoareTripleCheckerStatistics: 6928 SDtfs, 5885 SDslu, 3640 SDs, 0 SdLazy, 4372 SolverSat, 1144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1986 GetRequests, 1934 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4935occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 5661 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 264 NumberOfFragments, 1630 HoareAnnotationTreeSize, 29 FomulaSimplifications, 343295 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 29 FomulaSimplificationsInter, 71676 FormulaSimplificationTreeSizeReductionInter, 11.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 5670 NumberOfCodeBlocks, 5670 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 5627 ConstructedInterpolants, 0 QuantifiedInterpolants, 1665978 SizeOfPredicates, 13 NumberOfNonLiveVariables, 3554 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 43 InterpolantComputations, 35 PerfectInterpolantSequences, 10843/10891 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...