./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/Parts.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/termination-numeric/Parts.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash be287e2bd97a0ee2eedfe145e117cb9cd9037f62 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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*64bit*_Bitvector*.epf No suitable settings file found using Overflow*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:24:05,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:24:05,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:24:05,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:24:05,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:24:05,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:24:05,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:24:05,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:24:05,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:24:05,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:24:05,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:24:05,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:24:05,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:24:05,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:24:05,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:24:05,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:24:05,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:24:05,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:24:05,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:24:05,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:24:05,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:24:05,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:24:05,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:24:05,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:24:05,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:24:05,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:24:05,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:24:05,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:24:05,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:24:05,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:24:05,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:24:05,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:24:05,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:24:05,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:24:05,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:24:05,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:24:05,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:24:05,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:24:05,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:24:05,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:24:05,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:24:05,964 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2020-07-29 01:24:05,986 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:24:05,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:24:05,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:24:05,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:24:05,989 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:24:05,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:24:05,989 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:24:05,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:24:05,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:24:05,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-29 01:24:05,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:24:05,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-29 01:24:05,992 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2020-07-29 01:24:05,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:24:05,993 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:24:05,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-29 01:24:05,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:24:05,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:24:05,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:24:05,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:24:05,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:24:05,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:24:05,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:24:05,996 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-29 01:24:05,996 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:24:05,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:24:05,997 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-29 01:24:05,997 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:24:05,997 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be287e2bd97a0ee2eedfe145e117cb9cd9037f62 [2020-07-29 01:24:06,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:24:06,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:24:06,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:24:06,300 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:24:06,301 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:24:06,301 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Parts.c [2020-07-29 01:24:06,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37cb8ab61/9a090c0196b847e8993b0e546d0d039b/FLAG58602848e [2020-07-29 01:24:06,754 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:24:06,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c [2020-07-29 01:24:06,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37cb8ab61/9a090c0196b847e8993b0e546d0d039b/FLAG58602848e [2020-07-29 01:24:07,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37cb8ab61/9a090c0196b847e8993b0e546d0d039b [2020-07-29 01:24:07,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:24:07,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:24:07,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:24:07,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:24:07,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:24:07,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:24:07" (1/1) ... [2020-07-29 01:24:07,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2038bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:07, skipping insertion in model container [2020-07-29 01:24:07,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:24:07" (1/1) ... [2020-07-29 01:24:07,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:24:07,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:24:07,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:24:07,355 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:24:07,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:24:07,391 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:24:07,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:07 WrapperNode [2020-07-29 01:24:07,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:24:07,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:24:07,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:24:07,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:24:07,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:07" (1/1) ... [2020-07-29 01:24:07,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:07" (1/1) ... [2020-07-29 01:24:07,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:24:07,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:24:07,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:24:07,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:24:07,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:07" (1/1) ... [2020-07-29 01:24:07,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:07" (1/1) ... [2020-07-29 01:24:07,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:07" (1/1) ... [2020-07-29 01:24:07,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:07" (1/1) ... [2020-07-29 01:24:07,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:07" (1/1) ... [2020-07-29 01:24:07,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:07" (1/1) ... [2020-07-29 01:24:07,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:07" (1/1) ... [2020-07-29 01:24:07,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:24:07,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:24:07,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:24:07,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:24:07,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:07" (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 [2020-07-29 01:24:07,620 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2020-07-29 01:24:07,620 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2020-07-29 01:24:07,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:24:07,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:24:08,069 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:24:08,070 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:24:08,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:24:08 BoogieIcfgContainer [2020-07-29 01:24:08,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:24:08,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:24:08,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:24:08,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:24:08,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:24:07" (1/3) ... [2020-07-29 01:24:08,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cb9604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:24:08, skipping insertion in model container [2020-07-29 01:24:08,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:24:07" (2/3) ... [2020-07-29 01:24:08,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cb9604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:24:08, skipping insertion in model container [2020-07-29 01:24:08,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:24:08" (3/3) ... [2020-07-29 01:24:08,086 INFO L109 eAbstractionObserver]: Analyzing ICFG Parts.c [2020-07-29 01:24:08,099 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:24:08,109 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2020-07-29 01:24:08,126 INFO L251 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-07-29 01:24:08,153 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:24:08,154 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-29 01:24:08,154 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:24:08,154 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:24:08,154 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:24:08,155 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:24:08,155 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:24:08,155 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:24:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-29 01:24:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:24:08,186 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:24:08,187 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:24:08,188 INFO L427 AbstractCegarLoop]: === Iteration 1 === [partsErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:24:08,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:24:08,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2094867800, now seen corresponding path program 1 times [2020-07-29 01:24:08,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:24:08,208 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35887583] [2020-07-29 01:24:08,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:24:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:08,370 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {47#true} is VALID [2020-07-29 01:24:08,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume !(main_~x~0 < 0);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {47#true} is VALID [2020-07-29 01:24:08,372 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#true} assume !(main_~y~0 < 0);assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; {47#true} is VALID [2020-07-29 01:24:08,372 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#true} assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; {47#true} is VALID [2020-07-29 01:24:08,384 INFO L280 TraceCheckUtils]: 4: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-29 01:24:08,385 INFO L280 TraceCheckUtils]: 5: Hoare triple {48#false} main_#t~post6 := main_~p~0; {48#false} is VALID [2020-07-29 01:24:08,385 INFO L280 TraceCheckUtils]: 6: Hoare triple {48#false} assume !(1 + main_#t~post6 <= 2147483647); {48#false} is VALID [2020-07-29 01:24:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:24:08,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35887583] [2020-07-29 01:24:08,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:24:08,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:24:08,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955970612] [2020-07-29 01:24:08,400 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-07-29 01:24:08,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:24:08,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:24:08,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:24:08,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-29 01:24:08,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:24:08,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:24:08,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:24:08,442 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2020-07-29 01:24:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:08,560 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2020-07-29 01:24:08,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:24:08,560 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-07-29 01:24:08,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:24:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:24:08,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 105 transitions. [2020-07-29 01:24:08,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:24:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 105 transitions. [2020-07-29 01:24:08,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 105 transitions. [2020-07-29 01:24:08,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:24:08,899 INFO L225 Difference]: With dead ends: 85 [2020-07-29 01:24:08,900 INFO L226 Difference]: Without dead ends: 41 [2020-07-29 01:24:08,905 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:24:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-29 01:24:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-29 01:24:08,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:24:08,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2020-07-29 01:24:08,952 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-29 01:24:08,952 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-29 01:24:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:08,960 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-29 01:24:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-29 01:24:08,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:24:08,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:24:08,962 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-29 01:24:08,962 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-29 01:24:08,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:08,969 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-29 01:24:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-29 01:24:08,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:24:08,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:24:08,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:24:08,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:24:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-29 01:24:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2020-07-29 01:24:08,979 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 7 [2020-07-29 01:24:08,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:24:08,980 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2020-07-29 01:24:08,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-29 01:24:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-29 01:24:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:24:08,981 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:24:08,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:24:08,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:24:08,983 INFO L427 AbstractCegarLoop]: === Iteration 2 === [partsErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:24:08,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:24:08,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2094856268, now seen corresponding path program 1 times [2020-07-29 01:24:08,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:24:08,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295269895] [2020-07-29 01:24:08,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:24:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:09,050 INFO L280 TraceCheckUtils]: 0: Hoare triple {282#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {282#true} is VALID [2020-07-29 01:24:09,052 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume !(main_~x~0 < 0);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {284#(<= 0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:24:09,053 INFO L280 TraceCheckUtils]: 2: Hoare triple {284#(<= 0 ULTIMATE.start_main_~x~0)} assume !(main_~y~0 < 0);assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; {284#(<= 0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:24:09,054 INFO L280 TraceCheckUtils]: 3: Hoare triple {284#(<= 0 ULTIMATE.start_main_~x~0)} assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; {285#(<= ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)} is VALID [2020-07-29 01:24:09,055 INFO L280 TraceCheckUtils]: 4: Hoare triple {285#(<= ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)} assume !(main_~q~0 <= main_~x~0); {283#false} is VALID [2020-07-29 01:24:09,055 INFO L280 TraceCheckUtils]: 5: Hoare triple {283#false} main_#t~post6 := main_~p~0; {283#false} is VALID [2020-07-29 01:24:09,055 INFO L280 TraceCheckUtils]: 6: Hoare triple {283#false} assume !(1 + main_#t~post6 <= 2147483647); {283#false} is VALID [2020-07-29 01:24:09,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:24:09,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295269895] [2020-07-29 01:24:09,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:24:09,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:24:09,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101935145] [2020-07-29 01:24:09,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:24:09,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:24:09,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:24:09,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:24:09,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:24:09,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:24:09,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:24:09,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:24:09,072 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 4 states. [2020-07-29 01:24:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:09,283 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2020-07-29 01:24:09,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:24:09,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-29 01:24:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:24:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:24:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2020-07-29 01:24:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:24:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2020-07-29 01:24:09,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2020-07-29 01:24:09,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:24:09,455 INFO L225 Difference]: With dead ends: 80 [2020-07-29 01:24:09,456 INFO L226 Difference]: Without dead ends: 42 [2020-07-29 01:24:09,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:24:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-29 01:24:09,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-29 01:24:09,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:24:09,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2020-07-29 01:24:09,474 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-29 01:24:09,475 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-29 01:24:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:09,479 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-29 01:24:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-29 01:24:09,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:24:09,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:24:09,482 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-29 01:24:09,482 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-29 01:24:09,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:09,486 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-29 01:24:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-29 01:24:09,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:24:09,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:24:09,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:24:09,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:24:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-29 01:24:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-29 01:24:09,493 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 7 [2020-07-29 01:24:09,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:24:09,493 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-29 01:24:09,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:24:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-29 01:24:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:24:09,494 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:24:09,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:24:09,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:24:09,495 INFO L427 AbstractCegarLoop]: === Iteration 3 === [partsErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:24:09,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:24:09,496 INFO L82 PathProgramCache]: Analyzing trace with hash -621459525, now seen corresponding path program 1 times [2020-07-29 01:24:09,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:24:09,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690234221] [2020-07-29 01:24:09,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:24:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:09,570 INFO L280 TraceCheckUtils]: 0: Hoare triple {519#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {519#true} is VALID [2020-07-29 01:24:09,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {519#true} assume !(main_~x~0 < 0);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {519#true} is VALID [2020-07-29 01:24:09,572 INFO L280 TraceCheckUtils]: 2: Hoare triple {519#true} assume !(main_~y~0 < 0);assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; {521#(<= ULTIMATE.start_main_~p~0 0)} is VALID [2020-07-29 01:24:09,573 INFO L280 TraceCheckUtils]: 3: Hoare triple {521#(<= ULTIMATE.start_main_~p~0 0)} assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; {521#(<= ULTIMATE.start_main_~p~0 0)} is VALID [2020-07-29 01:24:09,574 INFO L280 TraceCheckUtils]: 4: Hoare triple {521#(<= ULTIMATE.start_main_~p~0 0)} assume !!(main_~q~0 <= main_~x~0); {521#(<= ULTIMATE.start_main_~p~0 0)} is VALID [2020-07-29 01:24:09,577 INFO L263 TraceCheckUtils]: 5: Hoare triple {521#(<= ULTIMATE.start_main_~p~0 0)} call main_#t~ret8 := parts(main_~p~0, main_~q~0); {522#(<= |parts_#in~p| 0)} is VALID [2020-07-29 01:24:09,579 INFO L280 TraceCheckUtils]: 6: Hoare triple {522#(<= |parts_#in~p| 0)} ~p := #in~p;~q := #in~q; {523#(<= parts_~p 0)} is VALID [2020-07-29 01:24:09,580 INFO L280 TraceCheckUtils]: 7: Hoare triple {523#(<= parts_~p 0)} assume !(~p <= 0); {520#false} is VALID [2020-07-29 01:24:09,580 INFO L280 TraceCheckUtils]: 8: Hoare triple {520#false} assume !(~q <= 0); {520#false} is VALID [2020-07-29 01:24:09,581 INFO L280 TraceCheckUtils]: 9: Hoare triple {520#false} assume !(~q > ~p); {520#false} is VALID [2020-07-29 01:24:09,581 INFO L280 TraceCheckUtils]: 10: Hoare triple {520#false} assume !(~p - ~q <= 2147483647); {520#false} is VALID [2020-07-29 01:24:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:24:09,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690234221] [2020-07-29 01:24:09,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:24:09,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:24:09,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355219392] [2020-07-29 01:24:09,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:24:09,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:24:09,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:24:09,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:24:09,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:24:09,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:24:09,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:24:09,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:24:09,607 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-07-29 01:24:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:09,916 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2020-07-29 01:24:09,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:24:09,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-29 01:24:09,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:24:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:24:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2020-07-29 01:24:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:24:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2020-07-29 01:24:09,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 119 transitions. [2020-07-29 01:24:10,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:24:10,116 INFO L225 Difference]: With dead ends: 102 [2020-07-29 01:24:10,116 INFO L226 Difference]: Without dead ends: 63 [2020-07-29 01:24:10,117 INFO L675 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 [2020-07-29 01:24:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-29 01:24:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2020-07-29 01:24:10,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:24:10,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 54 states. [2020-07-29 01:24:10,145 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 54 states. [2020-07-29 01:24:10,145 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 54 states. [2020-07-29 01:24:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:10,150 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2020-07-29 01:24:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2020-07-29 01:24:10,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:24:10,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:24:10,152 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 63 states. [2020-07-29 01:24:10,152 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 63 states. [2020-07-29 01:24:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:10,157 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2020-07-29 01:24:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2020-07-29 01:24:10,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:24:10,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:24:10,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:24:10,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:24:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-29 01:24:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2020-07-29 01:24:10,162 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 11 [2020-07-29 01:24:10,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:24:10,163 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2020-07-29 01:24:10,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:24:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2020-07-29 01:24:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-29 01:24:10,164 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:24:10,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:24:10,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:24:10,164 INFO L427 AbstractCegarLoop]: === Iteration 4 === [partsErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:24:10,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:24:10,165 INFO L82 PathProgramCache]: Analyzing trace with hash -227286792, now seen corresponding path program 1 times [2020-07-29 01:24:10,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:24:10,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790263289] [2020-07-29 01:24:10,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:24:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:10,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-07-29 01:24:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:10,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {844#true} ~p := #in~p;~q := #in~q; {844#true} is VALID [2020-07-29 01:24:10,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {844#true} assume ~p <= 0;#res := 1; {844#true} is VALID [2020-07-29 01:24:10,226 INFO L280 TraceCheckUtils]: 2: Hoare triple {844#true} assume true; {844#true} is VALID [2020-07-29 01:24:10,228 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {844#true} {846#(<= ULTIMATE.start_main_~q~0 0)} #88#return; {846#(<= ULTIMATE.start_main_~q~0 0)} is VALID [2020-07-29 01:24:10,229 INFO L280 TraceCheckUtils]: 0: Hoare triple {844#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; {844#true} is VALID [2020-07-29 01:24:10,229 INFO L280 TraceCheckUtils]: 1: Hoare triple {844#true} assume !(main_~x~0 < 0);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; {844#true} is VALID [2020-07-29 01:24:10,229 INFO L280 TraceCheckUtils]: 2: Hoare triple {844#true} assume !(main_~y~0 < 0);assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; {844#true} is VALID [2020-07-29 01:24:10,230 INFO L280 TraceCheckUtils]: 3: Hoare triple {844#true} assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; {846#(<= ULTIMATE.start_main_~q~0 0)} is VALID [2020-07-29 01:24:10,231 INFO L280 TraceCheckUtils]: 4: Hoare triple {846#(<= ULTIMATE.start_main_~q~0 0)} assume !!(main_~q~0 <= main_~x~0); {846#(<= ULTIMATE.start_main_~q~0 0)} is VALID [2020-07-29 01:24:10,232 INFO L263 TraceCheckUtils]: 5: Hoare triple {846#(<= ULTIMATE.start_main_~q~0 0)} call main_#t~ret8 := parts(main_~p~0, main_~q~0); {844#true} is VALID [2020-07-29 01:24:10,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {844#true} ~p := #in~p;~q := #in~q; {844#true} is VALID [2020-07-29 01:24:10,232 INFO L280 TraceCheckUtils]: 7: Hoare triple {844#true} assume ~p <= 0;#res := 1; {844#true} is VALID [2020-07-29 01:24:10,233 INFO L280 TraceCheckUtils]: 8: Hoare triple {844#true} assume true; {844#true} is VALID [2020-07-29 01:24:10,234 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {844#true} {846#(<= ULTIMATE.start_main_~q~0 0)} #88#return; {846#(<= ULTIMATE.start_main_~q~0 0)} is VALID [2020-07-29 01:24:10,235 INFO L280 TraceCheckUtils]: 10: Hoare triple {846#(<= ULTIMATE.start_main_~q~0 0)} assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;havoc main_#t~ret8; {846#(<= ULTIMATE.start_main_~q~0 0)} is VALID [2020-07-29 01:24:10,236 INFO L280 TraceCheckUtils]: 11: Hoare triple {846#(<= ULTIMATE.start_main_~q~0 0)} main_#t~post7 := main_~q~0; {851#(<= |ULTIMATE.start_main_#t~post7| 0)} is VALID [2020-07-29 01:24:10,237 INFO L280 TraceCheckUtils]: 12: Hoare triple {851#(<= |ULTIMATE.start_main_#t~post7| 0)} assume !(1 + main_#t~post7 <= 2147483647); {845#false} is VALID [2020-07-29 01:24:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:24:10,239 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790263289] [2020-07-29 01:24:10,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:24:10,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:24:10,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683232518] [2020-07-29 01:24:10,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-29 01:24:10,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:24:10,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:24:10,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:24:10,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:24:10,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:24:10,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:24:10,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:24:10,261 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 4 states. [2020-07-29 01:24:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:10,479 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-07-29 01:24:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:24:10,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-29 01:24:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:24:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:24:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2020-07-29 01:24:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:24:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2020-07-29 01:24:10,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2020-07-29 01:24:10,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:24:10,561 INFO L225 Difference]: With dead ends: 66 [2020-07-29 01:24:10,562 INFO L226 Difference]: Without dead ends: 65 [2020-07-29 01:24:10,562 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:24:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-29 01:24:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2020-07-29 01:24:10,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:24:10,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 62 states. [2020-07-29 01:24:10,591 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 62 states. [2020-07-29 01:24:10,591 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 62 states. [2020-07-29 01:24:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:10,596 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2020-07-29 01:24:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2020-07-29 01:24:10,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:24:10,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:24:10,597 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 65 states. [2020-07-29 01:24:10,597 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 65 states. [2020-07-29 01:24:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:24:10,601 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2020-07-29 01:24:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2020-07-29 01:24:10,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:24:10,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:24:10,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:24:10,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:24:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-29 01:24:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2020-07-29 01:24:10,607 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 13 [2020-07-29 01:24:10,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:24:10,607 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2020-07-29 01:24:10,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:24:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2020-07-29 01:24:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 01:24:10,608 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:24:10,608 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:24:10,609 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:24:10,609 INFO L427 AbstractCegarLoop]: === Iteration 5 === [partsErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:24:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:24:10,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1544044137, now seen corresponding path program 1 times [2020-07-29 01:24:10,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:24:10,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125395051] [2020-07-29 01:24:10,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:24:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:24:10,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:24:10,624 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.ProofTermGenerator.convert(ProofTermGenerator.java:150) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getProof(SMTInterpol.java:797) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 01:24:10,632 INFO L168 Benchmark]: Toolchain (without parser) took 3501.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 952.2 MB in the beginning and 858.4 MB in the end (delta: 93.8 MB). Peak memory consumption was 236.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:24:10,632 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:24:10,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.76 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:24:10,634 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.55 ms. Allocated memory is still 1.0 GB. Free memory is still 941.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:24:10,635 INFO L168 Benchmark]: Boogie Preprocessor took 102.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:24:10,636 INFO L168 Benchmark]: RCFGBuilder took 538.03 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:24:10,637 INFO L168 Benchmark]: TraceAbstraction took 2551.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 858.4 MB in the end (delta: 241.7 MB). Peak memory consumption was 241.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:24:10,641 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.76 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.55 ms. Allocated memory is still 1.0 GB. Free memory is still 941.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 102.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 538.03 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2551.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 858.4 MB in the end (delta: 241.7 MB). Peak memory consumption was 241.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...