./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 f6fb2bb1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.24-f6fb2bb [2019-11-19 19:53:28,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 19:53:28,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 19:53:28,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 19:53:28,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 19:53:28,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 19:53:28,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 19:53:28,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 19:53:28,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 19:53:28,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 19:53:28,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 19:53:28,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 19:53:28,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 19:53:28,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 19:53:28,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 19:53:28,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 19:53:28,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 19:53:28,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 19:53:28,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 19:53:28,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 19:53:28,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 19:53:28,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 19:53:28,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 19:53:28,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 19:53:28,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 19:53:28,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 19:53:28,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 19:53:28,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 19:53:28,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 19:53:28,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 19:53:28,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 19:53:28,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 19:53:28,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 19:53:28,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 19:53:28,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 19:53:28,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 19:53:28,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 19:53:28,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 19:53:28,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 19:53:28,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 19:53:28,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 19:53:28,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-19 19:53:28,185 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 19:53:28,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 19:53:28,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 19:53:28,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 19:53:28,187 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 19:53:28,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 19:53:28,188 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 19:53:28,188 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 19:53:28,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 19:53:28,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 19:53:28,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 19:53:28,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 19:53:28,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 19:53:28,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 19:53:28,189 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-19 19:53:28,189 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 19:53:28,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 19:53:28,190 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 19:53:28,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 19:53:28,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 19:53:28,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 19:53:28,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 19:53:28,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 19:53:28,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 19:53:28,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 19:53:28,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 19:53:28,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 19:53:28,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 19:53:28,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 19:53:28,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 19:53:28,193 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-11-19 19:53:28,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 19:53:28,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 19:53:28,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 19:53:28,562 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 19:53:28,562 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 19:53:28,564 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-2.i [2019-11-19 19:53:28,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4b7cba0/7e77c729eb264b019f7a03d1f7731b2b/FLAG6b493309e [2019-11-19 19:53:29,155 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 19:53:29,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-2.i [2019-11-19 19:53:29,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4b7cba0/7e77c729eb264b019f7a03d1f7731b2b/FLAG6b493309e [2019-11-19 19:53:29,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4b7cba0/7e77c729eb264b019f7a03d1f7731b2b [2019-11-19 19:53:29,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 19:53:29,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 19:53:29,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 19:53:29,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 19:53:29,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 19:53:29,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:29" (1/1) ... [2019-11-19 19:53:29,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa4d9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:29, skipping insertion in model container [2019-11-19 19:53:29,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:29" (1/1) ... [2019-11-19 19:53:29,523 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 19:53:29,548 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 19:53:29,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:53:29,798 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 19:53:29,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:53:29,923 INFO L192 MainTranslator]: Completed translation [2019-11-19 19:53:29,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:29 WrapperNode [2019-11-19 19:53:29,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 19:53:29,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 19:53:29,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 19:53:29,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 19:53:29,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:29" (1/1) ... [2019-11-19 19:53:29,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:29" (1/1) ... [2019-11-19 19:53:29,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 19:53:29,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 19:53:29,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 19:53:29,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 19:53:30,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:29" (1/1) ... [2019-11-19 19:53:30,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:29" (1/1) ... [2019-11-19 19:53:30,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:29" (1/1) ... [2019-11-19 19:53:30,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:29" (1/1) ... [2019-11-19 19:53:30,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:29" (1/1) ... [2019-11-19 19:53:30,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:29" (1/1) ... [2019-11-19 19:53:30,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:29" (1/1) ... [2019-11-19 19:53:30,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 19:53:30,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 19:53:30,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 19:53:30,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 19:53:30,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 19:53:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 19:53:30,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 19:53:30,678 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 19:53:30,679 INFO L285 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-19 19:53:30,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:30 BoogieIcfgContainer [2019-11-19 19:53:30,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 19:53:30,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 19:53:30,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 19:53:30,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 19:53:30,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:53:29" (1/3) ... [2019-11-19 19:53:30,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d753c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:30, skipping insertion in model container [2019-11-19 19:53:30,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:29" (2/3) ... [2019-11-19 19:53:30,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d753c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:30, skipping insertion in model container [2019-11-19 19:53:30,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:30" (3/3) ... [2019-11-19 19:53:30,693 INFO L109 eAbstractionObserver]: Analyzing ICFG byte_add-2.i [2019-11-19 19:53:30,704 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 19:53:30,713 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2019-11-19 19:53:30,726 INFO L249 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2019-11-19 19:53:30,759 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 19:53:30,759 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 19:53:30,759 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 19:53:30,759 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 19:53:30,760 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 19:53:30,760 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 19:53:30,760 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 19:53:30,760 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 19:53:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-19 19:53:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-19 19:53:30,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:30,793 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-19 19:53:30,794 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-11-19 19:53:30,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:30,801 INFO L82 PathProgramCache]: Analyzing trace with hash 30881, now seen corresponding path program 1 times [2019-11-19 19:53:30,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:30,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109687118] [2019-11-19 19:53:30,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:30,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109687118] [2019-11-19 19:53:30,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:30,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-19 19:53:30,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237178347] [2019-11-19 19:53:30,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 19:53:30,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:30,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 19:53:30,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 19:53:30,960 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-19 19:53:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:30,989 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2019-11-19 19:53:30,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 19:53:30,990 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 3 [2019-11-19 19:53:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:31,003 INFO L225 Difference]: With dead ends: 134 [2019-11-19 19:53:31,004 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 19:53:31,008 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-11-19 19:53:31,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 19:53:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-19 19:53:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-19 19:53:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2019-11-19 19:53:31,063 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 3 [2019-11-19 19:53:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:31,064 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2019-11-19 19:53:31,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 19:53:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2019-11-19 19:53:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 19:53:31,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:31,067 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:53:31,073 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-11-19 19:53:31,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:31,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1126401592, now seen corresponding path program 1 times [2019-11-19 19:53:31,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:31,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627598882] [2019-11-19 19:53:31,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:31,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627598882] [2019-11-19 19:53:31,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:31,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 19:53:31,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648605771] [2019-11-19 19:53:31,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:31,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:31,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:31,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:31,258 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand 3 states. [2019-11-19 19:53:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:31,460 INFO L93 Difference]: Finished difference Result 144 states and 211 transitions. [2019-11-19 19:53:31,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:31,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-19 19:53:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:31,463 INFO L225 Difference]: With dead ends: 144 [2019-11-19 19:53:31,463 INFO L226 Difference]: Without dead ends: 97 [2019-11-19 19:53:31,464 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-11-19 19:53:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-19 19:53:31,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-11-19 19:53:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-19 19:53:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-11-19 19:53:31,475 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 12 [2019-11-19 19:53:31,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:31,475 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-11-19 19:53:31,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:31,475 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-11-19 19:53:31,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 19:53:31,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:31,477 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-11-19 19:53:31,477 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-11-19 19:53:31,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:31,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1247347973, now seen corresponding path program 1 times [2019-11-19 19:53:31,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:31,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428273903] [2019-11-19 19:53:31,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:31,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428273903] [2019-11-19 19:53:31,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:31,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 19:53:31,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931704474] [2019-11-19 19:53:31,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 19:53:31,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:31,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 19:53:31,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 19:53:31,613 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 5 states. [2019-11-19 19:53:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:32,011 INFO L93 Difference]: Finished difference Result 237 states and 316 transitions. [2019-11-19 19:53:32,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 19:53:32,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-19 19:53:32,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:32,015 INFO L225 Difference]: With dead ends: 237 [2019-11-19 19:53:32,015 INFO L226 Difference]: Without dead ends: 173 [2019-11-19 19:53:32,016 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-11-19 19:53:32,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-19 19:53:32,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 106. [2019-11-19 19:53:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-19 19:53:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2019-11-19 19:53:32,028 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 19 [2019-11-19 19:53:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:32,029 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2019-11-19 19:53:32,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 19:53:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2019-11-19 19:53:32,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 19:53:32,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:32,033 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-11-19 19:53:32,034 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-11-19 19:53:32,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:32,035 INFO L82 PathProgramCache]: Analyzing trace with hash 630219950, now seen corresponding path program 1 times [2019-11-19 19:53:32,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:32,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439849471] [2019-11-19 19:53:32,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:32,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439849471] [2019-11-19 19:53:32,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:32,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 19:53:32,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584183201] [2019-11-19 19:53:32,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 19:53:32,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:32,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 19:53:32,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 19:53:32,192 INFO L87 Difference]: Start difference. First operand 106 states and 139 transitions. Second operand 5 states. [2019-11-19 19:53:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:32,576 INFO L93 Difference]: Finished difference Result 236 states and 314 transitions. [2019-11-19 19:53:32,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 19:53:32,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-19 19:53:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:32,578 INFO L225 Difference]: With dead ends: 236 [2019-11-19 19:53:32,578 INFO L226 Difference]: Without dead ends: 179 [2019-11-19 19:53:32,579 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-11-19 19:53:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-19 19:53:32,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 119. [2019-11-19 19:53:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-19 19:53:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 153 transitions. [2019-11-19 19:53:32,596 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 153 transitions. Word has length 22 [2019-11-19 19:53:32,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:32,599 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 153 transitions. [2019-11-19 19:53:32,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 19:53:32,599 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 153 transitions. [2019-11-19 19:53:32,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 19:53:32,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:32,602 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-11-19 19:53:32,603 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-11-19 19:53:32,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:32,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1393084960, now seen corresponding path program 1 times [2019-11-19 19:53:32,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:32,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686127446] [2019-11-19 19:53:32,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:32,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:32,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686127446] [2019-11-19 19:53:32,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341658646] [2019-11-19 19:53:32,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:32,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 19:53:32,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:32,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 19:53:32,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-11-19 19:53:32,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037443098] [2019-11-19 19:53:32,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 19:53:32,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:32,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 19:53:32,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 19:53:32,851 INFO L87 Difference]: Start difference. First operand 119 states and 153 transitions. Second operand 4 states. [2019-11-19 19:53:33,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:33,115 INFO L93 Difference]: Finished difference Result 215 states and 306 transitions. [2019-11-19 19:53:33,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 19:53:33,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-19 19:53:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:33,117 INFO L225 Difference]: With dead ends: 215 [2019-11-19 19:53:33,117 INFO L226 Difference]: Without dead ends: 168 [2019-11-19 19:53:33,119 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-11-19 19:53:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-19 19:53:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 144. [2019-11-19 19:53:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-19 19:53:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions. [2019-11-19 19:53:33,130 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 182 transitions. Word has length 25 [2019-11-19 19:53:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:33,131 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 182 transitions. [2019-11-19 19:53:33,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 19:53:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2019-11-19 19:53:33,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 19:53:33,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:33,133 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-11-19 19:53:33,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:33,337 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-11-19 19:53:33,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:33,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1548482839, now seen corresponding path program 1 times [2019-11-19 19:53:33,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:33,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879418223] [2019-11-19 19:53:33,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:33,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879418223] [2019-11-19 19:53:33,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528857141] [2019-11-19 19:53:33,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-19 19:53:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:33,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 19:53:33,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 19:53:33,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 19:53:33,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2019-11-19 19:53:33,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739283716] [2019-11-19 19:53:33,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 19:53:33,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:33,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 19:53:33,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 19:53:33,592 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. Second operand 4 states. [2019-11-19 19:53:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:34,134 INFO L93 Difference]: Finished difference Result 289 states and 390 transitions. [2019-11-19 19:53:34,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 19:53:34,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-19 19:53:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:34,141 INFO L225 Difference]: With dead ends: 289 [2019-11-19 19:53:34,141 INFO L226 Difference]: Without dead ends: 197 [2019-11-19 19:53:34,142 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-11-19 19:53:34,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-19 19:53:34,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 169. [2019-11-19 19:53:34,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-19 19:53:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 211 transitions. [2019-11-19 19:53:34,153 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 211 transitions. Word has length 32 [2019-11-19 19:53:34,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:34,154 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 211 transitions. [2019-11-19 19:53:34,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 19:53:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 211 transitions. [2019-11-19 19:53:34,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 19:53:34,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:34,157 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-11-19 19:53:34,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:34,362 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-11-19 19:53:34,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:34,363 INFO L82 PathProgramCache]: Analyzing trace with hash -466613948, now seen corresponding path program 1 times [2019-11-19 19:53:34,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:34,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836985007] [2019-11-19 19:53:34,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:53:34,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836985007] [2019-11-19 19:53:34,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316501961] [2019-11-19 19:53:34,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-19 19:53:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:34,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 19:53:34,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 19:53:34,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 19:53:34,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-11-19 19:53:34,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614558902] [2019-11-19 19:53:34,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 19:53:34,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:34,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 19:53:34,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:53:34,575 INFO L87 Difference]: Start difference. First operand 169 states and 211 transitions. Second operand 4 states. [2019-11-19 19:53:35,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:35,206 INFO L93 Difference]: Finished difference Result 339 states and 446 transitions. [2019-11-19 19:53:35,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 19:53:35,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-19 19:53:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:35,208 INFO L225 Difference]: With dead ends: 339 [2019-11-19 19:53:35,208 INFO L226 Difference]: Without dead ends: 222 [2019-11-19 19:53:35,209 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-11-19 19:53:35,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-11-19 19:53:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 194. [2019-11-19 19:53:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-19 19:53:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 240 transitions. [2019-11-19 19:53:35,216 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 240 transitions. Word has length 39 [2019-11-19 19:53:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:35,217 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 240 transitions. [2019-11-19 19:53:35,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 19:53:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 240 transitions. [2019-11-19 19:53:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-19 19:53:35,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:35,219 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-11-19 19:53:35,422 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:35,423 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-11-19 19:53:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:35,424 INFO L82 PathProgramCache]: Analyzing trace with hash -811417915, now seen corresponding path program 1 times [2019-11-19 19:53:35,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:35,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168011390] [2019-11-19 19:53:35,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:35,500 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-19 19:53:35,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168011390] [2019-11-19 19:53:35,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:35,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 19:53:35,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703496939] [2019-11-19 19:53:35,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:53:35,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:35,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:53:35,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:53:35,503 INFO L87 Difference]: Start difference. First operand 194 states and 240 transitions. Second operand 3 states. [2019-11-19 19:53:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:35,512 INFO L93 Difference]: Finished difference Result 231 states and 281 transitions. [2019-11-19 19:53:35,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:53:35,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-19 19:53:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:35,514 INFO L225 Difference]: With dead ends: 231 [2019-11-19 19:53:35,514 INFO L226 Difference]: Without dead ends: 168 [2019-11-19 19:53:35,515 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-11-19 19:53:35,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-19 19:53:35,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-11-19 19:53:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-19 19:53:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 206 transitions. [2019-11-19 19:53:35,521 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 206 transitions. Word has length 46 [2019-11-19 19:53:35,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:35,522 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 206 transitions. [2019-11-19 19:53:35,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:53:35,522 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2019-11-19 19:53:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-19 19:53:35,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:35,525 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-11-19 19:53:35,525 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-11-19 19:53:35,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:35,526 INFO L82 PathProgramCache]: Analyzing trace with hash 669122321, now seen corresponding path program 1 times [2019-11-19 19:53:35,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:35,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789380548] [2019-11-19 19:53:35,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-19 19:53:35,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789380548] [2019-11-19 19:53:35,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:35,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 19:53:35,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550157924] [2019-11-19 19:53:35,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 19:53:35,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:35,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 19:53:35,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 19:53:35,608 INFO L87 Difference]: Start difference. First operand 168 states and 206 transitions. Second operand 5 states. [2019-11-19 19:53:35,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:35,876 INFO L93 Difference]: Finished difference Result 464 states and 572 transitions. [2019-11-19 19:53:35,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 19:53:35,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-19 19:53:35,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:35,882 INFO L225 Difference]: With dead ends: 464 [2019-11-19 19:53:35,882 INFO L226 Difference]: Without dead ends: 346 [2019-11-19 19:53:35,883 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-11-19 19:53:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-19 19:53:35,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 208. [2019-11-19 19:53:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-19 19:53:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 255 transitions. [2019-11-19 19:53:35,892 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 255 transitions. Word has length 58 [2019-11-19 19:53:35,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:35,892 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 255 transitions. [2019-11-19 19:53:35,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 19:53:35,892 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 255 transitions. [2019-11-19 19:53:35,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-19 19:53:35,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:35,893 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-11-19 19:53:35,894 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-11-19 19:53:35,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:35,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2018692145, now seen corresponding path program 1 times [2019-11-19 19:53:35,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:35,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454323476] [2019-11-19 19:53:35,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-19 19:53:35,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454323476] [2019-11-19 19:53:35,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:35,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 19:53:35,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717714129] [2019-11-19 19:53:35,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 19:53:35,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:35,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 19:53:35,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 19:53:35,974 INFO L87 Difference]: Start difference. First operand 208 states and 255 transitions. Second operand 4 states. [2019-11-19 19:53:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:36,077 INFO L93 Difference]: Finished difference Result 464 states and 568 transitions. [2019-11-19 19:53:36,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 19:53:36,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-19 19:53:36,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:36,080 INFO L225 Difference]: With dead ends: 464 [2019-11-19 19:53:36,080 INFO L226 Difference]: Without dead ends: 306 [2019-11-19 19:53:36,081 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-11-19 19:53:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-19 19:53:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 224. [2019-11-19 19:53:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-19 19:53:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 282 transitions. [2019-11-19 19:53:36,089 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 282 transitions. Word has length 61 [2019-11-19 19:53:36,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:36,089 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 282 transitions. [2019-11-19 19:53:36,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 19:53:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 282 transitions. [2019-11-19 19:53:36,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-19 19:53:36,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:36,091 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-11-19 19:53:36,091 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-11-19 19:53:36,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:36,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1454389477, now seen corresponding path program 1 times [2019-11-19 19:53:36,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:36,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856269656] [2019-11-19 19:53:36,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 19:53:36,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856269656] [2019-11-19 19:53:36,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:36,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 19:53:36,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836263937] [2019-11-19 19:53:36,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 19:53:36,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:36,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 19:53:36,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:53:36,271 INFO L87 Difference]: Start difference. First operand 224 states and 282 transitions. Second operand 8 states. [2019-11-19 19:53:36,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:36,880 INFO L93 Difference]: Finished difference Result 673 states and 859 transitions. [2019-11-19 19:53:36,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 19:53:36,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-11-19 19:53:36,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:36,884 INFO L225 Difference]: With dead ends: 673 [2019-11-19 19:53:36,884 INFO L226 Difference]: Without dead ends: 491 [2019-11-19 19:53:36,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-11-19 19:53:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-11-19 19:53:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 431. [2019-11-19 19:53:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-11-19 19:53:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 545 transitions. [2019-11-19 19:53:36,903 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 545 transitions. Word has length 67 [2019-11-19 19:53:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:36,903 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 545 transitions. [2019-11-19 19:53:36,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 19:53:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 545 transitions. [2019-11-19 19:53:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-19 19:53:36,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:36,905 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-11-19 19:53:36,905 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-11-19 19:53:36,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:36,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2083812095, now seen corresponding path program 1 times [2019-11-19 19:53:36,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:36,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577116521] [2019-11-19 19:53:36,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-19 19:53:37,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577116521] [2019-11-19 19:53:37,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032700713] [2019-11-19 19:53:37,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-19 19:53:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:37,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 19:53:37,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-19 19:53:37,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 19:53:37,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 9 [2019-11-19 19:53:37,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096809304] [2019-11-19 19:53:37,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 19:53:37,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:37,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 19:53:37,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:53:37,177 INFO L87 Difference]: Start difference. First operand 431 states and 545 transitions. Second operand 4 states. [2019-11-19 19:53:37,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:37,321 INFO L93 Difference]: Finished difference Result 1143 states and 1435 transitions. [2019-11-19 19:53:37,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 19:53:37,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-19 19:53:37,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:37,325 INFO L225 Difference]: With dead ends: 1143 [2019-11-19 19:53:37,326 INFO L226 Difference]: Without dead ends: 721 [2019-11-19 19:53:37,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:53:37,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-11-19 19:53:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 571. [2019-11-19 19:53:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-19 19:53:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 725 transitions. [2019-11-19 19:53:37,350 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 725 transitions. Word has length 67 [2019-11-19 19:53:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:37,350 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 725 transitions. [2019-11-19 19:53:37,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 19:53:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 725 transitions. [2019-11-19 19:53:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-19 19:53:37,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:37,352 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-11-19 19:53:37,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:37,557 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-11-19 19:53:37,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:37,557 INFO L82 PathProgramCache]: Analyzing trace with hash 642833928, now seen corresponding path program 1 times [2019-11-19 19:53:37,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:37,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721820782] [2019-11-19 19:53:37,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 19:53:37,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721820782] [2019-11-19 19:53:37,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:37,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 19:53:37,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659262289] [2019-11-19 19:53:37,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 19:53:37,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:37,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 19:53:37,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:53:37,729 INFO L87 Difference]: Start difference. First operand 571 states and 725 transitions. Second operand 8 states. [2019-11-19 19:53:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:38,414 INFO L93 Difference]: Finished difference Result 1452 states and 1834 transitions. [2019-11-19 19:53:38,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 19:53:38,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-11-19 19:53:38,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:38,424 INFO L225 Difference]: With dead ends: 1452 [2019-11-19 19:53:38,424 INFO L226 Difference]: Without dead ends: 834 [2019-11-19 19:53:38,426 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-11-19 19:53:38,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-11-19 19:53:38,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 728. [2019-11-19 19:53:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-11-19 19:53:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 922 transitions. [2019-11-19 19:53:38,452 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 922 transitions. Word has length 67 [2019-11-19 19:53:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:38,452 INFO L462 AbstractCegarLoop]: Abstraction has 728 states and 922 transitions. [2019-11-19 19:53:38,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 19:53:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 922 transitions. [2019-11-19 19:53:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-19 19:53:38,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:38,454 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-11-19 19:53:38,454 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-11-19 19:53:38,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:38,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1201027011, now seen corresponding path program 1 times [2019-11-19 19:53:38,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:38,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241253350] [2019-11-19 19:53:38,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-19 19:53:38,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241253350] [2019-11-19 19:53:38,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705009863] [2019-11-19 19:53:38,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-19 19:53:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:38,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 19:53:38,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:53:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-19 19:53:38,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:53:38,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-19 19:53:38,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581070876] [2019-11-19 19:53:38,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 19:53:38,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:38,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 19:53:38,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:53:38,663 INFO L87 Difference]: Start difference. First operand 728 states and 922 transitions. Second operand 7 states. [2019-11-19 19:53:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:39,799 INFO L93 Difference]: Finished difference Result 4208 states and 5218 transitions. [2019-11-19 19:53:39,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-19 19:53:39,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-11-19 19:53:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:39,817 INFO L225 Difference]: With dead ends: 4208 [2019-11-19 19:53:39,817 INFO L226 Difference]: Without dead ends: 3406 [2019-11-19 19:53:39,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2019-11-19 19:53:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2019-11-19 19:53:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 1667. [2019-11-19 19:53:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1667 states. [2019-11-19 19:53:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2302 transitions. [2019-11-19 19:53:39,896 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2302 transitions. Word has length 73 [2019-11-19 19:53:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:39,896 INFO L462 AbstractCegarLoop]: Abstraction has 1667 states and 2302 transitions. [2019-11-19 19:53:39,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 19:53:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2302 transitions. [2019-11-19 19:53:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-19 19:53:39,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:39,899 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-11-19 19:53:40,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:53:40,108 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-11-19 19:53:40,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:40,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1090909143, now seen corresponding path program 1 times [2019-11-19 19:53:40,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:40,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605457346] [2019-11-19 19:53:40,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-19 19:53:40,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605457346] [2019-11-19 19:53:40,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:40,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 19:53:40,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345270351] [2019-11-19 19:53:40,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 19:53:40,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:40,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 19:53:40,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:53:40,212 INFO L87 Difference]: Start difference. First operand 1667 states and 2302 transitions. Second operand 7 states. [2019-11-19 19:53:40,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:40,996 INFO L93 Difference]: Finished difference Result 5333 states and 7297 transitions. [2019-11-19 19:53:40,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 19:53:40,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-11-19 19:53:40,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:41,014 INFO L225 Difference]: With dead ends: 5333 [2019-11-19 19:53:41,014 INFO L226 Difference]: Without dead ends: 3444 [2019-11-19 19:53:41,018 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-11-19 19:53:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2019-11-19 19:53:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 3114. [2019-11-19 19:53:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2019-11-19 19:53:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 4234 transitions. [2019-11-19 19:53:41,136 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 4234 transitions. Word has length 79 [2019-11-19 19:53:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:41,136 INFO L462 AbstractCegarLoop]: Abstraction has 3114 states and 4234 transitions. [2019-11-19 19:53:41,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 19:53:41,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 4234 transitions. [2019-11-19 19:53:41,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-19 19:53:41,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:41,139 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-11-19 19:53:41,140 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-11-19 19:53:41,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1286610050, now seen corresponding path program 1 times [2019-11-19 19:53:41,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:41,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782714727] [2019-11-19 19:53:41,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-19 19:53:41,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782714727] [2019-11-19 19:53:41,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:41,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 19:53:41,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915596232] [2019-11-19 19:53:41,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 19:53:41,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:41,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 19:53:41,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:53:41,324 INFO L87 Difference]: Start difference. First operand 3114 states and 4234 transitions. Second operand 7 states. [2019-11-19 19:53:42,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:42,114 INFO L93 Difference]: Finished difference Result 5900 states and 7876 transitions. [2019-11-19 19:53:42,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 19:53:42,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-11-19 19:53:42,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:42,132 INFO L225 Difference]: With dead ends: 5900 [2019-11-19 19:53:42,132 INFO L226 Difference]: Without dead ends: 3834 [2019-11-19 19:53:42,137 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-11-19 19:53:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3834 states. [2019-11-19 19:53:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3834 to 3689. [2019-11-19 19:53:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3689 states. [2019-11-19 19:53:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 3689 states and 4985 transitions. [2019-11-19 19:53:42,246 INFO L78 Accepts]: Start accepts. Automaton has 3689 states and 4985 transitions. Word has length 79 [2019-11-19 19:53:42,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:42,247 INFO L462 AbstractCegarLoop]: Abstraction has 3689 states and 4985 transitions. [2019-11-19 19:53:42,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 19:53:42,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 4985 transitions. [2019-11-19 19:53:42,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 19:53:42,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:42,250 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-11-19 19:53:42,251 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-11-19 19:53:42,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:42,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2026749083, now seen corresponding path program 1 times [2019-11-19 19:53:42,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:42,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067126388] [2019-11-19 19:53:42,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-19 19:53:42,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067126388] [2019-11-19 19:53:42,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:42,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 19:53:42,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159952941] [2019-11-19 19:53:42,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 19:53:42,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:42,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 19:53:42,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:53:42,441 INFO L87 Difference]: Start difference. First operand 3689 states and 4985 transitions. Second operand 8 states. [2019-11-19 19:53:43,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:43,700 INFO L93 Difference]: Finished difference Result 8371 states and 11243 transitions. [2019-11-19 19:53:43,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 19:53:43,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-11-19 19:53:43,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:43,721 INFO L225 Difference]: With dead ends: 8371 [2019-11-19 19:53:43,721 INFO L226 Difference]: Without dead ends: 4434 [2019-11-19 19:53:43,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-19 19:53:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4434 states. [2019-11-19 19:53:43,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4434 to 4255. [2019-11-19 19:53:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4255 states. [2019-11-19 19:53:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 5701 transitions. [2019-11-19 19:53:43,845 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 5701 transitions. Word has length 82 [2019-11-19 19:53:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:43,845 INFO L462 AbstractCegarLoop]: Abstraction has 4255 states and 5701 transitions. [2019-11-19 19:53:43,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 19:53:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 5701 transitions. [2019-11-19 19:53:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 19:53:43,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:43,850 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-11-19 19:53:43,850 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-11-19 19:53:43,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:43,851 INFO L82 PathProgramCache]: Analyzing trace with hash -56372555, now seen corresponding path program 1 times [2019-11-19 19:53:43,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:43,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335317375] [2019-11-19 19:53:43,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-19 19:53:44,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335317375] [2019-11-19 19:53:44,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:44,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 19:53:44,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936273974] [2019-11-19 19:53:44,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 19:53:44,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:44,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 19:53:44,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:53:44,034 INFO L87 Difference]: Start difference. First operand 4255 states and 5701 transitions. Second operand 8 states. [2019-11-19 19:53:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:45,272 INFO L93 Difference]: Finished difference Result 7575 states and 10086 transitions. [2019-11-19 19:53:45,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 19:53:45,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-11-19 19:53:45,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:45,293 INFO L225 Difference]: With dead ends: 7575 [2019-11-19 19:53:45,294 INFO L226 Difference]: Without dead ends: 4976 [2019-11-19 19:53:45,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-11-19 19:53:45,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4976 states. [2019-11-19 19:53:45,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4976 to 4724. [2019-11-19 19:53:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4724 states. [2019-11-19 19:53:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 6305 transitions. [2019-11-19 19:53:45,408 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 6305 transitions. Word has length 82 [2019-11-19 19:53:45,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:45,408 INFO L462 AbstractCegarLoop]: Abstraction has 4724 states and 6305 transitions. [2019-11-19 19:53:45,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 19:53:45,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 6305 transitions. [2019-11-19 19:53:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 19:53:45,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:45,412 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-11-19 19:53:45,413 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-11-19 19:53:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:45,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1381975007, now seen corresponding path program 1 times [2019-11-19 19:53:45,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:45,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993642871] [2019-11-19 19:53:45,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-19 19:53:45,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993642871] [2019-11-19 19:53:45,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:45,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 19:53:45,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750270379] [2019-11-19 19:53:45,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 19:53:45,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:45,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 19:53:45,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:53:45,553 INFO L87 Difference]: Start difference. First operand 4724 states and 6305 transitions. Second operand 9 states. [2019-11-19 19:53:47,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:47,021 INFO L93 Difference]: Finished difference Result 5701 states and 7556 transitions. [2019-11-19 19:53:47,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 19:53:47,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-11-19 19:53:47,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:47,066 INFO L225 Difference]: With dead ends: 5701 [2019-11-19 19:53:47,068 INFO L226 Difference]: Without dead ends: 3342 [2019-11-19 19:53:47,074 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-11-19 19:53:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2019-11-19 19:53:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 3188. [2019-11-19 19:53:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-11-19 19:53:47,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 4192 transitions. [2019-11-19 19:53:47,191 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 4192 transitions. Word has length 84 [2019-11-19 19:53:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:47,192 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 4192 transitions. [2019-11-19 19:53:47,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 19:53:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 4192 transitions. [2019-11-19 19:53:47,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 19:53:47,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:47,201 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-11-19 19:53:47,202 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-11-19 19:53:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:47,202 INFO L82 PathProgramCache]: Analyzing trace with hash -205126895, now seen corresponding path program 1 times [2019-11-19 19:53:47,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:47,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707735774] [2019-11-19 19:53:47,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:53:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-19 19:53:47,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707735774] [2019-11-19 19:53:47,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:53:47,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 19:53:47,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014716281] [2019-11-19 19:53:47,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 19:53:47,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:53:47,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 19:53:47,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:53:47,457 INFO L87 Difference]: Start difference. First operand 3188 states and 4192 transitions. Second operand 9 states. [2019-11-19 19:53:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:53:48,498 INFO L93 Difference]: Finished difference Result 4175 states and 5459 transitions. [2019-11-19 19:53:48,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 19:53:48,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-11-19 19:53:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:53:48,504 INFO L225 Difference]: With dead ends: 4175 [2019-11-19 19:53:48,504 INFO L226 Difference]: Without dead ends: 1834 [2019-11-19 19:53:48,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-19 19:53:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2019-11-19 19:53:48,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1772. [2019-11-19 19:53:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2019-11-19 19:53:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2299 transitions. [2019-11-19 19:53:48,545 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2299 transitions. Word has length 84 [2019-11-19 19:53:48,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:53:48,545 INFO L462 AbstractCegarLoop]: Abstraction has 1772 states and 2299 transitions. [2019-11-19 19:53:48,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 19:53:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2299 transitions. [2019-11-19 19:53:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-19 19:53:48,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:53:48,548 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-11-19 19:53:48,549 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-11-19 19:53:48,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:53:48,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1356500467, now seen corresponding path program 1 times [2019-11-19 19:53:48,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:53:48,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840044464] [2019-11-19 19:53:48,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:53:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:53:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:53:48,682 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:53:48,683 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 19:53:48,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:53:48 BoogieIcfgContainer [2019-11-19 19:53:48,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 19:53:48,739 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 19:53:48,739 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 19:53:48,740 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 19:53:48,740 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:30" (3/4) ... [2019-11-19 19:53:48,746 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 19:53:48,746 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 19:53:48,749 INFO L168 Benchmark]: Toolchain (without parser) took 19243.97 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 373.3 MB). Free memory was 957.7 MB in the beginning and 861.9 MB in the end (delta: 95.7 MB). Peak memory consumption was 469.0 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:48,750 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:53:48,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:48,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:53:48,751 INFO L168 Benchmark]: Boogie Preprocessor took 35.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:53:48,752 INFO L168 Benchmark]: RCFGBuilder took 657.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:48,753 INFO L168 Benchmark]: TraceAbstraction took 18056.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 1.1 GB in the beginning and 861.9 MB in the end (delta: 225.1 MB). Peak memory consumption was 463.6 MB. Max. memory is 11.5 GB. [2019-11-19 19:53:48,754 INFO L168 Benchmark]: Witness Printer took 7.46 ms. Allocated memory is still 1.4 GB. Free memory is still 861.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:53:48,756 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 419.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 657.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18056.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 238.6 MB). Free memory was 1.1 GB in the beginning and 861.9 MB in the end (delta: 225.1 MB). Peak memory consumption was 463.6 MB. Max. memory is 11.5 GB. * Witness Printer took 7.46 ms. Allocated memory is still 1.4 GB. Free memory is still 861.9 MB. 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: 17.9s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2242 SDtfs, 4537 SDslu, 5149 SDs, 0 SdLazy, 6243 SolverSat, 496 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 442 GetRequests, 274 SyntacticMatches, 18 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.6s 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.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 3608 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.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...