./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add-2.i --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_98888494-8a53-4bfb-8e92-aada41afdf15/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/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 6af52310ec13e6e7a94146d05f9e904086453aae ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/bin/uautomizer/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:06:31,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:06:31,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:06:31,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:06:31,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:06:31,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:06:31,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:06:31,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:06:31,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:06:31,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:06:31,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:06:31,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:06:31,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:06:31,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:06:31,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:06:31,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:06:31,228 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:06:31,229 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:06:31,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:06:31,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:06:31,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:06:31,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:06:31,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:06:31,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:06:31,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:06:31,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:06:31,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:06:31,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:06:31,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:06:31,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:06:31,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:06:31,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:06:31,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:06:31,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:06:31,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:06:31,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:06:31,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:06:31,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:06:31,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:06:31,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:06:31,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:06:31,242 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-12-07 17:06:31,252 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:06:31,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:06:31,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:06:31,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:06:31,253 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:06:31,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:06:31,253 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:06:31,254 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:06:31,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:06:31,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:06:31,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:06:31,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:06:31,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:06:31,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:06:31,254 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 17:06:31,255 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:06:31,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:06:31,255 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:06:31,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:06:31,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:06:31,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:06:31,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:06:31,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:06:31,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:06:31,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:06:31,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:06:31,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:06:31,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:06:31,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:06:31,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:06:31,256 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:06:31,256 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_98888494-8a53-4bfb-8e92-aada41afdf15/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 -> 6af52310ec13e6e7a94146d05f9e904086453aae [2019-12-07 17:06:31,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:06:31,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:06:31,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:06:31,371 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:06:31,371 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:06:31,372 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/bin/uautomizer/../../sv-benchmarks/c/bitvector/byte_add-2.i [2019-12-07 17:06:31,419 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/bin/uautomizer/data/e567602f2/ca9dd18fc8a647eeae526a3e166cf956/FLAG247afb257 [2019-12-07 17:06:31,859 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:06:31,859 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/sv-benchmarks/c/bitvector/byte_add-2.i [2019-12-07 17:06:31,864 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/bin/uautomizer/data/e567602f2/ca9dd18fc8a647eeae526a3e166cf956/FLAG247afb257 [2019-12-07 17:06:31,872 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/bin/uautomizer/data/e567602f2/ca9dd18fc8a647eeae526a3e166cf956 [2019-12-07 17:06:31,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:06:31,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:06:31,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:06:31,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:06:31,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:06:31,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:06:31" (1/1) ... [2019-12-07 17:06:31,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8ebb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:06:31, skipping insertion in model container [2019-12-07 17:06:31,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:06:31" (1/1) ... [2019-12-07 17:06:31,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:06:31,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:06:32,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:06:32,050 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:06:32,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:06:32,082 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:06:32,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:06:32 WrapperNode [2019-12-07 17:06:32,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:06:32,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:06:32,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:06:32,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:06:32,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:06:32" (1/1) ... [2019-12-07 17:06:32,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:06:32" (1/1) ... [2019-12-07 17:06:32,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:06:32,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:06:32,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:06:32,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:06:32,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:06:32" (1/1) ... [2019-12-07 17:06:32,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:06:32" (1/1) ... [2019-12-07 17:06:32,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:06:32" (1/1) ... [2019-12-07 17:06:32,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:06:32" (1/1) ... [2019-12-07 17:06:32,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:06:32" (1/1) ... [2019-12-07 17:06:32,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:06:32" (1/1) ... [2019-12-07 17:06:32,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:06:32" (1/1) ... [2019-12-07 17:06:32,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:06:32,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:06:32,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:06:32,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:06:32,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:06:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/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 17:06:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:06:32,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:06:32,427 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:06:32,428 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-12-07 17:06:32,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:06:32 BoogieIcfgContainer [2019-12-07 17:06:32,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:06:32,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:06:32,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:06:32,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:06:32,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:06:31" (1/3) ... [2019-12-07 17:06:32,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208de62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:06:32, skipping insertion in model container [2019-12-07 17:06:32,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:06:32" (2/3) ... [2019-12-07 17:06:32,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208de62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:06:32, skipping insertion in model container [2019-12-07 17:06:32,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:06:32" (3/3) ... [2019-12-07 17:06:32,433 INFO L109 eAbstractionObserver]: Analyzing ICFG byte_add-2.i [2019-12-07 17:06:32,440 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:06:32,444 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-12-07 17:06:32,451 INFO L249 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-12-07 17:06:32,468 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:06:32,468 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:06:32,468 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:06:32,469 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:06:32,469 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:06:32,469 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:06:32,469 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:06:32,469 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:06:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-12-07 17:06:32,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:06:32,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:32,490 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:06:32,491 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:32,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:32,494 INFO L82 PathProgramCache]: Analyzing trace with hash 30881, now seen corresponding path program 1 times [2019-12-07 17:06:32,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:32,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749958830] [2019-12-07 17:06:32,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:32,580 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 17:06:32,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749958830] [2019-12-07 17:06:32,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:06:32,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:06:32,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736503279] [2019-12-07 17:06:32,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 17:06:32,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:32,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 17:06:32,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:06:32,595 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-12-07 17:06:32,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:32,610 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2019-12-07 17:06:32,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 17:06:32,611 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-12-07 17:06:32,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:32,618 INFO L225 Difference]: With dead ends: 134 [2019-12-07 17:06:32,618 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 17:06:32,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:06:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 17:06:32,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-12-07 17:06:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 17:06:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2019-12-07 17:06:32,646 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 3 [2019-12-07 17:06:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:32,646 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2019-12-07 17:06:32,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 17:06:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2019-12-07 17:06:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 17:06:32,647 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:32,647 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:06:32,648 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:32,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:32,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1126401592, now seen corresponding path program 1 times [2019-12-07 17:06:32,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:32,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969878008] [2019-12-07 17:06:32,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:32,712 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 17:06:32,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969878008] [2019-12-07 17:06:32,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:06:32,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:06:32,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931380090] [2019-12-07 17:06:32,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:06:32,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:32,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:06:32,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:06:32,714 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand 3 states. [2019-12-07 17:06:32,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:32,819 INFO L93 Difference]: Finished difference Result 144 states and 211 transitions. [2019-12-07 17:06:32,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:06:32,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-12-07 17:06:32,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:32,820 INFO L225 Difference]: With dead ends: 144 [2019-12-07 17:06:32,820 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 17:06:32,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:06:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 17:06:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-12-07 17:06:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 17:06:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-12-07 17:06:32,828 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 12 [2019-12-07 17:06:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:32,828 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-12-07 17:06:32,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:06:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-12-07 17:06:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:06:32,829 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:32,829 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 17:06:32,830 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:32,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:32,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1247347973, now seen corresponding path program 1 times [2019-12-07 17:06:32,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:32,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329272257] [2019-12-07 17:06:32,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:06:32,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329272257] [2019-12-07 17:06:32,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:06:32,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:06:32,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974526860] [2019-12-07 17:06:32,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:06:32,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:32,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:06:32,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:06:32,886 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 5 states. [2019-12-07 17:06:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:33,085 INFO L93 Difference]: Finished difference Result 237 states and 316 transitions. [2019-12-07 17:06:33,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:06:33,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 17:06:33,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:33,087 INFO L225 Difference]: With dead ends: 237 [2019-12-07 17:06:33,087 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 17:06:33,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:06:33,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 17:06:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 106. [2019-12-07 17:06:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 17:06:33,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2019-12-07 17:06:33,096 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 19 [2019-12-07 17:06:33,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:33,096 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2019-12-07 17:06:33,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:06:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2019-12-07 17:06:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:06:33,097 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:33,097 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:06:33,098 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:33,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:33,098 INFO L82 PathProgramCache]: Analyzing trace with hash 630219950, now seen corresponding path program 1 times [2019-12-07 17:06:33,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:33,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430095110] [2019-12-07 17:06:33,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:06:33,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430095110] [2019-12-07 17:06:33,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:06:33,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:06:33,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538831074] [2019-12-07 17:06:33,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:06:33,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:33,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:06:33,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:06:33,150 INFO L87 Difference]: Start difference. First operand 106 states and 139 transitions. Second operand 5 states. [2019-12-07 17:06:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:33,333 INFO L93 Difference]: Finished difference Result 236 states and 314 transitions. [2019-12-07 17:06:33,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:06:33,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 17:06:33,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:33,335 INFO L225 Difference]: With dead ends: 236 [2019-12-07 17:06:33,335 INFO L226 Difference]: Without dead ends: 179 [2019-12-07 17:06:33,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:06:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-12-07 17:06:33,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 119. [2019-12-07 17:06:33,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 17:06:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 153 transitions. [2019-12-07 17:06:33,346 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 153 transitions. Word has length 22 [2019-12-07 17:06:33,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:33,347 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 153 transitions. [2019-12-07 17:06:33,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:06:33,347 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 153 transitions. [2019-12-07 17:06:33,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:06:33,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:33,349 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] [2019-12-07 17:06:33,349 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:33,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:33,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1393084960, now seen corresponding path program 1 times [2019-12-07 17:06:33,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:33,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366188058] [2019-12-07 17:06:33,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:06:33,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366188058] [2019-12-07 17:06:33,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183585433] [2019-12-07 17:06:33,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/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 17:06:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:33,438 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:06:33,443 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:06:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:06:33,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:06:33,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-12-07 17:06:33,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128796078] [2019-12-07 17:06:33,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:06:33,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:33,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:06:33,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:06:33,482 INFO L87 Difference]: Start difference. First operand 119 states and 153 transitions. Second operand 4 states. [2019-12-07 17:06:33,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:33,623 INFO L93 Difference]: Finished difference Result 215 states and 306 transitions. [2019-12-07 17:06:33,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:06:33,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 17:06:33,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:33,625 INFO L225 Difference]: With dead ends: 215 [2019-12-07 17:06:33,625 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 17:06:33,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:06:33,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 17:06:33,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 144. [2019-12-07 17:06:33,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-12-07 17:06:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions. [2019-12-07 17:06:33,634 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 182 transitions. Word has length 25 [2019-12-07 17:06:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:33,635 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 182 transitions. [2019-12-07 17:06:33,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:06:33,635 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2019-12-07 17:06:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 17:06:33,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:33,637 INFO L410 BasicCegarLoop]: trace histogram [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 17:06:33,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:06:33,838 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:33,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:33,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1548482839, now seen corresponding path program 1 times [2019-12-07 17:06:33,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:33,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272529696] [2019-12-07 17:06:33,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:06:33,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272529696] [2019-12-07 17:06:33,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344474844] [2019-12-07 17:06:33,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/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 17:06:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:34,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:06:34,027 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:06:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:06:34,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:06:34,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2019-12-07 17:06:34,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028701209] [2019-12-07 17:06:34,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:06:34,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:34,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:06:34,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:06:34,067 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. Second operand 4 states. [2019-12-07 17:06:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:34,396 INFO L93 Difference]: Finished difference Result 289 states and 390 transitions. [2019-12-07 17:06:34,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:06:34,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-07 17:06:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:34,397 INFO L225 Difference]: With dead ends: 289 [2019-12-07 17:06:34,397 INFO L226 Difference]: Without dead ends: 197 [2019-12-07 17:06:34,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:06:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-07 17:06:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 169. [2019-12-07 17:06:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 17:06:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 211 transitions. [2019-12-07 17:06:34,403 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 211 transitions. Word has length 32 [2019-12-07 17:06:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:34,403 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 211 transitions. [2019-12-07 17:06:34,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:06:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 211 transitions. [2019-12-07 17:06:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 17:06:34,404 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:34,405 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:06:34,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:06:34,606 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:34,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:34,607 INFO L82 PathProgramCache]: Analyzing trace with hash -466613948, now seen corresponding path program 1 times [2019-12-07 17:06:34,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:34,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389564729] [2019-12-07 17:06:34,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:06:34,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389564729] [2019-12-07 17:06:34,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543982268] [2019-12-07 17:06:34,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/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 17:06:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:34,688 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:06:34,690 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:06:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:06:34,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:06:34,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-12-07 17:06:34,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184084600] [2019-12-07 17:06:34,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:06:34,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:34,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:06:34,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:06:34,713 INFO L87 Difference]: Start difference. First operand 169 states and 211 transitions. Second operand 4 states. [2019-12-07 17:06:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:35,121 INFO L93 Difference]: Finished difference Result 339 states and 446 transitions. [2019-12-07 17:06:35,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:06:35,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-07 17:06:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:35,123 INFO L225 Difference]: With dead ends: 339 [2019-12-07 17:06:35,123 INFO L226 Difference]: Without dead ends: 222 [2019-12-07 17:06:35,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:06:35,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-07 17:06:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 194. [2019-12-07 17:06:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-12-07 17:06:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 240 transitions. [2019-12-07 17:06:35,129 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 240 transitions. Word has length 39 [2019-12-07 17:06:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:35,130 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 240 transitions. [2019-12-07 17:06:35,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:06:35,130 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 240 transitions. [2019-12-07 17:06:35,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 17:06:35,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:35,131 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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 17:06:35,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:06:35,332 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:35,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:35,333 INFO L82 PathProgramCache]: Analyzing trace with hash -811417915, now seen corresponding path program 1 times [2019-12-07 17:06:35,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:35,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791503240] [2019-12-07 17:06:35,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 17:06:35,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791503240] [2019-12-07 17:06:35,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:06:35,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:06:35,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416266513] [2019-12-07 17:06:35,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:06:35,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:35,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:06:35,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:06:35,379 INFO L87 Difference]: Start difference. First operand 194 states and 240 transitions. Second operand 3 states. [2019-12-07 17:06:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:35,386 INFO L93 Difference]: Finished difference Result 231 states and 281 transitions. [2019-12-07 17:06:35,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:06:35,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-07 17:06:35,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:35,388 INFO L225 Difference]: With dead ends: 231 [2019-12-07 17:06:35,388 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 17:06:35,388 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 17:06:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 17:06:35,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-12-07 17:06:35,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 17:06:35,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 206 transitions. [2019-12-07 17:06:35,392 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 206 transitions. Word has length 46 [2019-12-07 17:06:35,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:35,392 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 206 transitions. [2019-12-07 17:06:35,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:06:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2019-12-07 17:06:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:06:35,393 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:35,393 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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 17:06:35,394 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:35,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:35,394 INFO L82 PathProgramCache]: Analyzing trace with hash 669122321, now seen corresponding path program 1 times [2019-12-07 17:06:35,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:35,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013683301] [2019-12-07 17:06:35,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-12-07 17:06:35,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013683301] [2019-12-07 17:06:35,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:06:35,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:06:35,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423954567] [2019-12-07 17:06:35,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:06:35,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:35,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:06:35,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:06:35,448 INFO L87 Difference]: Start difference. First operand 168 states and 206 transitions. Second operand 5 states. [2019-12-07 17:06:35,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:35,604 INFO L93 Difference]: Finished difference Result 464 states and 572 transitions. [2019-12-07 17:06:35,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:06:35,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-07 17:06:35,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:35,606 INFO L225 Difference]: With dead ends: 464 [2019-12-07 17:06:35,607 INFO L226 Difference]: Without dead ends: 346 [2019-12-07 17:06:35,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:06:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-12-07 17:06:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 208. [2019-12-07 17:06:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-12-07 17:06:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 255 transitions. [2019-12-07 17:06:35,614 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 255 transitions. Word has length 58 [2019-12-07 17:06:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:35,615 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 255 transitions. [2019-12-07 17:06:35,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:06:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 255 transitions. [2019-12-07 17:06:35,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 17:06:35,615 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:35,615 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 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 17:06:35,616 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:35,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:35,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2018692145, now seen corresponding path program 1 times [2019-12-07 17:06:35,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:35,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621427252] [2019-12-07 17:06:35,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 17:06:35,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621427252] [2019-12-07 17:06:35,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:06:35,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:06:35,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492244118] [2019-12-07 17:06:35,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:06:35,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:35,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:06:35,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:06:35,664 INFO L87 Difference]: Start difference. First operand 208 states and 255 transitions. Second operand 4 states. [2019-12-07 17:06:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:35,719 INFO L93 Difference]: Finished difference Result 464 states and 568 transitions. [2019-12-07 17:06:35,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:06:35,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-07 17:06:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:35,721 INFO L225 Difference]: With dead ends: 464 [2019-12-07 17:06:35,721 INFO L226 Difference]: Without dead ends: 306 [2019-12-07 17:06:35,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:06:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-07 17:06:35,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 224. [2019-12-07 17:06:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-07 17:06:35,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 282 transitions. [2019-12-07 17:06:35,726 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 282 transitions. Word has length 61 [2019-12-07 17:06:35,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:35,727 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 282 transitions. [2019-12-07 17:06:35,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:06:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 282 transitions. [2019-12-07 17:06:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:06:35,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:35,727 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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 17:06:35,728 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:35,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:35,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1454389477, now seen corresponding path program 1 times [2019-12-07 17:06:35,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:35,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026467772] [2019-12-07 17:06:35,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:06:35,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026467772] [2019-12-07 17:06:35,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:06:35,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:06:35,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948528145] [2019-12-07 17:06:35,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:06:35,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:35,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:06:35,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:06:35,824 INFO L87 Difference]: Start difference. First operand 224 states and 282 transitions. Second operand 8 states. [2019-12-07 17:06:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:36,163 INFO L93 Difference]: Finished difference Result 673 states and 859 transitions. [2019-12-07 17:06:36,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:06:36,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-07 17:06:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:36,165 INFO L225 Difference]: With dead ends: 673 [2019-12-07 17:06:36,165 INFO L226 Difference]: Without dead ends: 491 [2019-12-07 17:06:36,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:06:36,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-12-07 17:06:36,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 431. [2019-12-07 17:06:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-12-07 17:06:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 545 transitions. [2019-12-07 17:06:36,177 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 545 transitions. Word has length 67 [2019-12-07 17:06:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:36,177 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 545 transitions. [2019-12-07 17:06:36,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:06:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 545 transitions. [2019-12-07 17:06:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:06:36,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:36,178 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-12-07 17:06:36,178 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:36,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:36,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2083812095, now seen corresponding path program 1 times [2019-12-07 17:06:36,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:36,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084656877] [2019-12-07 17:06:36,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 17:06:36,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084656877] [2019-12-07 17:06:36,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990265809] [2019-12-07 17:06:36,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/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 17:06:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:36,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:06:36,328 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:06:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 17:06:36,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:06:36,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 9 [2019-12-07 17:06:36,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328038192] [2019-12-07 17:06:36,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:06:36,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:36,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:06:36,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:06:36,351 INFO L87 Difference]: Start difference. First operand 431 states and 545 transitions. Second operand 4 states. [2019-12-07 17:06:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:36,462 INFO L93 Difference]: Finished difference Result 1143 states and 1435 transitions. [2019-12-07 17:06:36,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:06:36,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 17:06:36,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:36,467 INFO L225 Difference]: With dead ends: 1143 [2019-12-07 17:06:36,467 INFO L226 Difference]: Without dead ends: 721 [2019-12-07 17:06:36,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:06:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-12-07 17:06:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 571. [2019-12-07 17:06:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-07 17:06:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 725 transitions. [2019-12-07 17:06:36,487 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 725 transitions. Word has length 67 [2019-12-07 17:06:36,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:36,487 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 725 transitions. [2019-12-07 17:06:36,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:06:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 725 transitions. [2019-12-07 17:06:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:06:36,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:36,489 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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 17:06:36,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:06:36,690 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:36,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:36,690 INFO L82 PathProgramCache]: Analyzing trace with hash 642833928, now seen corresponding path program 1 times [2019-12-07 17:06:36,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:36,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475127504] [2019-12-07 17:06:36,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:06:36,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475127504] [2019-12-07 17:06:36,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:06:36,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:06:36,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60535166] [2019-12-07 17:06:36,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:06:36,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:36,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:06:36,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:06:36,791 INFO L87 Difference]: Start difference. First operand 571 states and 725 transitions. Second operand 8 states. [2019-12-07 17:06:37,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:37,140 INFO L93 Difference]: Finished difference Result 1452 states and 1834 transitions. [2019-12-07 17:06:37,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:06:37,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-07 17:06:37,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:37,145 INFO L225 Difference]: With dead ends: 1452 [2019-12-07 17:06:37,145 INFO L226 Difference]: Without dead ends: 834 [2019-12-07 17:06:37,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:06:37,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-12-07 17:06:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 728. [2019-12-07 17:06:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-12-07 17:06:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 922 transitions. [2019-12-07 17:06:37,169 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 922 transitions. Word has length 67 [2019-12-07 17:06:37,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:37,169 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 922 transitions. [2019-12-07 17:06:37,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:06:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 922 transitions. [2019-12-07 17:06:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 17:06:37,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:37,171 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:06:37,171 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:37,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:37,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1201027011, now seen corresponding path program 1 times [2019-12-07 17:06:37,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:37,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891073816] [2019-12-07 17:06:37,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:37,222 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 17:06:37,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891073816] [2019-12-07 17:06:37,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76446227] [2019-12-07 17:06:37,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_98888494-8a53-4bfb-8e92-aada41afdf15/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 17:06:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:37,253 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:06:37,255 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:06:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-07 17:06:37,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:06:37,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-12-07 17:06:37,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591448039] [2019-12-07 17:06:37,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:06:37,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:37,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:06:37,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:06:37,275 INFO L87 Difference]: Start difference. First operand 728 states and 922 transitions. Second operand 7 states. [2019-12-07 17:06:37,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:37,961 INFO L93 Difference]: Finished difference Result 4208 states and 5218 transitions. [2019-12-07 17:06:37,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 17:06:37,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-07 17:06:37,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:37,974 INFO L225 Difference]: With dead ends: 4208 [2019-12-07 17:06:37,974 INFO L226 Difference]: Without dead ends: 3406 [2019-12-07 17:06:37,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:06:37,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2019-12-07 17:06:38,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 1667. [2019-12-07 17:06:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1667 states. [2019-12-07 17:06:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2302 transitions. [2019-12-07 17:06:38,019 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2302 transitions. Word has length 73 [2019-12-07 17:06:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:38,019 INFO L462 AbstractCegarLoop]: Abstraction has 1667 states and 2302 transitions. [2019-12-07 17:06:38,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:06:38,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2302 transitions. [2019-12-07 17:06:38,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 17:06:38,021 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:38,021 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:06:38,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:06:38,222 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:38,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:38,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1090909143, now seen corresponding path program 1 times [2019-12-07 17:06:38,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:38,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885378591] [2019-12-07 17:06:38,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:06:38,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885378591] [2019-12-07 17:06:38,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:06:38,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:06:38,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541330698] [2019-12-07 17:06:38,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:06:38,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:38,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:06:38,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:06:38,294 INFO L87 Difference]: Start difference. First operand 1667 states and 2302 transitions. Second operand 7 states. [2019-12-07 17:06:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:38,758 INFO L93 Difference]: Finished difference Result 5333 states and 7297 transitions. [2019-12-07 17:06:38,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:06:38,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-12-07 17:06:38,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:38,770 INFO L225 Difference]: With dead ends: 5333 [2019-12-07 17:06:38,770 INFO L226 Difference]: Without dead ends: 3444 [2019-12-07 17:06:38,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:06:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2019-12-07 17:06:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 3114. [2019-12-07 17:06:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2019-12-07 17:06:38,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 4234 transitions. [2019-12-07 17:06:38,829 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 4234 transitions. Word has length 79 [2019-12-07 17:06:38,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:38,829 INFO L462 AbstractCegarLoop]: Abstraction has 3114 states and 4234 transitions. [2019-12-07 17:06:38,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:06:38,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 4234 transitions. [2019-12-07 17:06:38,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 17:06:38,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:38,831 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:06:38,831 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:38,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:38,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1286610050, now seen corresponding path program 1 times [2019-12-07 17:06:38,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:38,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021208680] [2019-12-07 17:06:38,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 17:06:38,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021208680] [2019-12-07 17:06:38,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:06:38,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:06:38,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443469479] [2019-12-07 17:06:38,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:06:38,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:38,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:06:38,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:06:38,927 INFO L87 Difference]: Start difference. First operand 3114 states and 4234 transitions. Second operand 7 states. [2019-12-07 17:06:39,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:39,356 INFO L93 Difference]: Finished difference Result 5900 states and 7876 transitions. [2019-12-07 17:06:39,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:06:39,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-12-07 17:06:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:39,369 INFO L225 Difference]: With dead ends: 5900 [2019-12-07 17:06:39,369 INFO L226 Difference]: Without dead ends: 3834 [2019-12-07 17:06:39,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:06:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3834 states. [2019-12-07 17:06:39,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3834 to 3689. [2019-12-07 17:06:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3689 states. [2019-12-07 17:06:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 3689 states and 4985 transitions. [2019-12-07 17:06:39,431 INFO L78 Accepts]: Start accepts. Automaton has 3689 states and 4985 transitions. Word has length 79 [2019-12-07 17:06:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:39,431 INFO L462 AbstractCegarLoop]: Abstraction has 3689 states and 4985 transitions. [2019-12-07 17:06:39,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:06:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 4985 transitions. [2019-12-07 17:06:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 17:06:39,433 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:39,433 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:06:39,434 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:39,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2026749083, now seen corresponding path program 1 times [2019-12-07 17:06:39,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:39,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103530700] [2019-12-07 17:06:39,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:39,531 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:06:39,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103530700] [2019-12-07 17:06:39,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:06:39,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:06:39,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367859655] [2019-12-07 17:06:39,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:06:39,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:39,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:06:39,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:06:39,532 INFO L87 Difference]: Start difference. First operand 3689 states and 4985 transitions. Second operand 8 states. [2019-12-07 17:06:40,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:40,309 INFO L93 Difference]: Finished difference Result 8371 states and 11243 transitions. [2019-12-07 17:06:40,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:06:40,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-12-07 17:06:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:40,323 INFO L225 Difference]: With dead ends: 8371 [2019-12-07 17:06:40,323 INFO L226 Difference]: Without dead ends: 4434 [2019-12-07 17:06:40,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:06:40,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4434 states. [2019-12-07 17:06:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4434 to 4255. [2019-12-07 17:06:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4255 states. [2019-12-07 17:06:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 5701 transitions. [2019-12-07 17:06:40,408 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 5701 transitions. Word has length 82 [2019-12-07 17:06:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:40,409 INFO L462 AbstractCegarLoop]: Abstraction has 4255 states and 5701 transitions. [2019-12-07 17:06:40,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:06:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 5701 transitions. [2019-12-07 17:06:40,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 17:06:40,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:40,413 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:06:40,413 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:40,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:40,413 INFO L82 PathProgramCache]: Analyzing trace with hash -56372555, now seen corresponding path program 1 times [2019-12-07 17:06:40,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:40,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174255663] [2019-12-07 17:06:40,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 17:06:40,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174255663] [2019-12-07 17:06:40,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:06:40,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:06:40,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258839797] [2019-12-07 17:06:40,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:06:40,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:40,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:06:40,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:06:40,532 INFO L87 Difference]: Start difference. First operand 4255 states and 5701 transitions. Second operand 8 states. [2019-12-07 17:06:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:41,231 INFO L93 Difference]: Finished difference Result 7575 states and 10086 transitions. [2019-12-07 17:06:41,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:06:41,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-12-07 17:06:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:41,249 INFO L225 Difference]: With dead ends: 7575 [2019-12-07 17:06:41,249 INFO L226 Difference]: Without dead ends: 4976 [2019-12-07 17:06:41,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:06:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4976 states. [2019-12-07 17:06:41,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4976 to 4724. [2019-12-07 17:06:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4724 states. [2019-12-07 17:06:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 6305 transitions. [2019-12-07 17:06:41,323 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 6305 transitions. Word has length 82 [2019-12-07 17:06:41,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:41,323 INFO L462 AbstractCegarLoop]: Abstraction has 4724 states and 6305 transitions. [2019-12-07 17:06:41,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:06:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 6305 transitions. [2019-12-07 17:06:41,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 17:06:41,327 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:41,327 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:06:41,327 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:41,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:41,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1381975007, now seen corresponding path program 1 times [2019-12-07 17:06:41,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:41,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304282968] [2019-12-07 17:06:41,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:06:41,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304282968] [2019-12-07 17:06:41,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:06:41,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:06:41,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525464636] [2019-12-07 17:06:41,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:06:41,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:41,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:06:41,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:06:41,424 INFO L87 Difference]: Start difference. First operand 4724 states and 6305 transitions. Second operand 9 states. [2019-12-07 17:06:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:42,095 INFO L93 Difference]: Finished difference Result 5701 states and 7556 transitions. [2019-12-07 17:06:42,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:06:42,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-12-07 17:06:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:42,106 INFO L225 Difference]: With dead ends: 5701 [2019-12-07 17:06:42,106 INFO L226 Difference]: Without dead ends: 3342 [2019-12-07 17:06:42,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:06:42,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2019-12-07 17:06:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 3188. [2019-12-07 17:06:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-12-07 17:06:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 4192 transitions. [2019-12-07 17:06:42,158 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 4192 transitions. Word has length 84 [2019-12-07 17:06:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:42,158 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 4192 transitions. [2019-12-07 17:06:42,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:06:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 4192 transitions. [2019-12-07 17:06:42,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 17:06:42,159 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:42,159 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:06:42,160 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:42,160 INFO L82 PathProgramCache]: Analyzing trace with hash -205126895, now seen corresponding path program 1 times [2019-12-07 17:06:42,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:42,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748125275] [2019-12-07 17:06:42,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:06:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 17:06:42,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748125275] [2019-12-07 17:06:42,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:06:42,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:06:42,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567421866] [2019-12-07 17:06:42,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:06:42,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:06:42,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:06:42,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:06:42,256 INFO L87 Difference]: Start difference. First operand 3188 states and 4192 transitions. Second operand 9 states. [2019-12-07 17:06:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:06:42,770 INFO L93 Difference]: Finished difference Result 4175 states and 5459 transitions. [2019-12-07 17:06:42,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:06:42,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-12-07 17:06:42,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:06:42,775 INFO L225 Difference]: With dead ends: 4175 [2019-12-07 17:06:42,775 INFO L226 Difference]: Without dead ends: 1834 [2019-12-07 17:06:42,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:06:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2019-12-07 17:06:42,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1772. [2019-12-07 17:06:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2019-12-07 17:06:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2299 transitions. [2019-12-07 17:06:42,798 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2299 transitions. Word has length 84 [2019-12-07 17:06:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:06:42,798 INFO L462 AbstractCegarLoop]: Abstraction has 1772 states and 2299 transitions. [2019-12-07 17:06:42,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:06:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2299 transitions. [2019-12-07 17:06:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 17:06:42,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:06:42,799 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:06:42,799 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 17:06:42,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:06:42,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1356500467, now seen corresponding path program 1 times [2019-12-07 17:06:42,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:06:42,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573812850] [2019-12-07 17:06:42,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:06:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:06:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:06:42,875 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:06:42,875 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:06:42,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:06:42 BoogieIcfgContainer [2019-12-07 17:06:42,906 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:06:42,906 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:06:42,906 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:06:42,906 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:06:42,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:06:32" (3/4) ... [2019-12-07 17:06:42,909 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 17:06:42,909 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:06:42,910 INFO L168 Benchmark]: Toolchain (without parser) took 11035.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 243.8 MB). Free memory was 944.8 MB in the beginning and 1.0 GB in the end (delta: -79.6 MB). Peak memory consumption was 164.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:06:42,911 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:06:42,911 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:06:42,911 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.53 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 17:06:42,911 INFO L168 Benchmark]: Boogie Preprocessor took 19.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:06:42,912 INFO L168 Benchmark]: RCFGBuilder took 299.30 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:06:42,912 INFO L168 Benchmark]: TraceAbstraction took 10476.44 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 152.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 22.3 MB). Peak memory consumption was 174.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:06:42,912 INFO L168 Benchmark]: Witness Printer took 3.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:06:42,914 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 207.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.53 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. * Boogie Preprocessor took 19.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 299.30 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10476.44 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 152.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 22.3 MB). Peak memory consumption was 174.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 77. Possible FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 [L40] COND TRUE a3 == (unsigned char)0 [L41] EXPR na - 1 [L41] na = na - 1 [L42] COND TRUE a2 == (unsigned char)0 [L43] EXPR na - 1 [L43] na = na - 1 [L44] COND TRUE a1 == (unsigned char)0 [L45] EXPR na - 1 [L45] na = na - 1 [L49] nb = (unsigned char)4 [L50] COND FALSE !(b3 == (unsigned char)0) [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND TRUE i == (unsigned char)0 [L65] EXPR partial_sum + a0 [L65] partial_sum = partial_sum + a0 [L66] COND FALSE !(i == (unsigned char)1) [L67] COND FALSE !(i == (unsigned char)2) [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND TRUE i == (unsigned char)0 [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND FALSE !(i < na) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND TRUE i == (unsigned char)1 [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND FALSE !(i == (unsigned char)0) [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND FALSE !(i < na) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND FALSE !(i == (unsigned char)1) [L73] COND TRUE i == (unsigned char)2 [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND FALSE !(i == (unsigned char)0) [L81] COND FALSE !(i == (unsigned char)1) [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum [L83] COND FALSE !(i == (unsigned char)3) [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND FALSE !(i < na) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND TRUE i == (unsigned char)3 [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 [L76] COND FALSE !(partial_sum > ((unsigned char)254)) [L80] COND FALSE !(i == (unsigned char)0) [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L88] COND FALSE !(i < (unsigned char)4) [L97] r1 << 8U [L97] r2 << 16U [L97] r3 << 24U - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 38 error locations. Result: UNSAFE, OverallTime: 10.4s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2242 SDtfs, 4537 SDslu, 5149 SDs, 0 SdLazy, 6243 SolverSat, 496 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 442 GetRequests, 274 SyntacticMatches, 18 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4724occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 3608 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1407 NumberOfCodeBlocks, 1407 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1292 ConstructedInterpolants, 3 QuantifiedInterpolants, 297277 SizeOfPredicates, 7 NumberOfNonLiveVariables, 577 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 1128/1188 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...