./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/Ben-Amram-LMCS2010-Ex2.3.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-crafted-lit/Ben-Amram-LMCS2010-Ex2.3.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 9ec0bf4392c8fe4647c82e62efb5bebaadd0d7bdbc2edef80a3ce856001f6a7d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:04:05,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:04:05,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:04:05,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:04:05,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:04:05,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:04:05,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:04:05,762 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:04:05,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:04:05,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:04:05,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:04:05,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:04:05,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:04:05,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:04:05,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:04:05,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:04:05,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:04:05,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:04:05,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:04:05,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:04:05,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:04:05,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:04:05,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:04:05,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:04:05,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:04:05,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:04:05,789 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:04:05,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:04:05,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:04:05,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:04:05,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:04:05,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:04:05,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:04:05,794 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:04:05,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:04:05,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:04:05,796 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:04:05,796 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:04:05,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:04:05,797 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:04:05,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:04:05,798 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:04:05,819 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:04:05,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:04:05,821 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:04:05,821 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:04:05,822 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:04:05,822 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:04:05,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:04:05,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:04:05,823 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:04:05,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:04:05,824 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:04:05,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:04:05,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:04:05,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:04:05,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:04:05,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:04:05,824 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:04:05,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:04:05,825 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:04:05,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:04:05,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:04:05,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:04:05,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:04:05,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:05,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:04:05,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:04:05,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:04:05,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:04:05,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:04:05,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:04:05,827 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 9ec0bf4392c8fe4647c82e62efb5bebaadd0d7bdbc2edef80a3ce856001f6a7d [2022-02-21 03:04:06,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:04:06,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:04:06,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:04:06,049 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:04:06,050 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:04:06,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/Ben-Amram-LMCS2010-Ex2.3.c [2022-02-21 03:04:06,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdceaeaa9/1e8ae187d48e40eca4fce11b46a60c59/FLAG3298266f1 [2022-02-21 03:04:06,401 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:04:06,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/Ben-Amram-LMCS2010-Ex2.3.c [2022-02-21 03:04:06,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdceaeaa9/1e8ae187d48e40eca4fce11b46a60c59/FLAG3298266f1 [2022-02-21 03:04:06,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdceaeaa9/1e8ae187d48e40eca4fce11b46a60c59 [2022-02-21 03:04:06,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:04:06,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:04:06,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:06,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:04:06,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:04:06,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:06" (1/1) ... [2022-02-21 03:04:06,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@524c2615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:06, skipping insertion in model container [2022-02-21 03:04:06,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:06" (1/1) ... [2022-02-21 03:04:06,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:04:06,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:04:07,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:07,091 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:04:07,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:07,110 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:04:07,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07 WrapperNode [2022-02-21 03:04:07,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:07,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:07,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:04:07,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:04:07,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,135 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2022-02-21 03:04:07,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:07,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:04:07,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:04:07,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:04:07,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:04:07,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:04:07,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:04:07,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:04:07,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (1/1) ... [2022-02-21 03:04:07,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:07,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:07,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:04:07,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:04:07,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:04:07,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:04:07,303 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:04:07,305 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:04:07,524 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:04:07,529 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:04:07,529 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:04:07,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:07 BoogieIcfgContainer [2022-02-21 03:04:07,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:04:07,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:04:07,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:04:07,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:04:07,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:04:06" (1/3) ... [2022-02-21 03:04:07,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33022278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:07, skipping insertion in model container [2022-02-21 03:04:07,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:07" (2/3) ... [2022-02-21 03:04:07,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33022278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:07, skipping insertion in model container [2022-02-21 03:04:07,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:07" (3/3) ... [2022-02-21 03:04:07,538 INFO L111 eAbstractionObserver]: Analyzing ICFG Ben-Amram-LMCS2010-Ex2.3.c [2022-02-21 03:04:07,541 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:04:07,541 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-21 03:04:07,571 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:04:07,576 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:04:07,577 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-21 03:04:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:07,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:04:07,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:07,594 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:04:07,594 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:04:07,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:07,598 INFO L85 PathProgramCache]: Analyzing trace with hash 28699945, now seen corresponding path program 1 times [2022-02-21 03:04:07,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:07,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047761081] [2022-02-21 03:04:07,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:07,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true; {23#true} is VALID [2022-02-21 03:04:07,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {25#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} is VALID [2022-02-21 03:04:07,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} assume !!((main_~x~0#1 > 0 && main_~y~0#1 > 0) && main_~z~0#1 > 0); {25#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} is VALID [2022-02-21 03:04:07,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} assume !(main_~y~0#1 > main_~x~0#1); {25#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} is VALID [2022-02-21 03:04:07,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#(<= |ULTIMATE.start_main_~z~0#1| 2147483647)} assume !(main_~z~0#1 - 1 <= 2147483647); {24#false} is VALID [2022-02-21 03:04:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:07,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:07,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047761081] [2022-02-21 03:04:07,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047761081] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:07,728 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:07,728 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:07,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541453001] [2022-02-21 03:04:07,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:07,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:07,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:07,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:07,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:07,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:07,749 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:07,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:07,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:07,767 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:07,860 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-02-21 03:04:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:07,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:07,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-21 03:04:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-21 03:04:07,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2022-02-21 03:04:07,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:07,926 INFO L225 Difference]: With dead ends: 41 [2022-02-21 03:04:07,926 INFO L226 Difference]: Without dead ends: 28 [2022-02-21 03:04:07,928 INFO L932 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 [2022-02-21 03:04:07,930 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:07,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-21 03:04:07,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-02-21 03:04:07,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:07,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 22 states, 16 states have (on average 1.6875) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:07,949 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 22 states, 16 states have (on average 1.6875) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:07,949 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 22 states, 16 states have (on average 1.6875) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:07,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:07,951 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-02-21 03:04:07,951 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-21 03:04:07,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:07,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:07,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 16 states have (on average 1.6875) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-21 03:04:07,952 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.6875) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-21 03:04:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:07,953 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-02-21 03:04:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-21 03:04:07,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:07,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:07,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:07,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.6875) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-02-21 03:04:07,956 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 5 [2022-02-21 03:04:07,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:07,956 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 03:04:07,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:07,956 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-21 03:04:07,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:04:07,956 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:07,956 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:04:07,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:04:07,957 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:04:07,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:07,957 INFO L85 PathProgramCache]: Analyzing trace with hash 28699753, now seen corresponding path program 1 times [2022-02-21 03:04:07,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:07,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945532969] [2022-02-21 03:04:07,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:07,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:07,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#true} assume { :begin_inline_ULTIMATE.init } true; {154#true} is VALID [2022-02-21 03:04:07,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {154#true} is VALID [2022-02-21 03:04:07,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume !!((main_~x~0#1 > 0 && main_~y~0#1 > 0) && main_~z~0#1 > 0); {154#true} is VALID [2022-02-21 03:04:07,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {154#true} assume main_~y~0#1 > main_~x~0#1;main_~y~0#1 := main_~z~0#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {156#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:04:07,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {156#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume !(main_~x~0#1 - 1 <= 2147483647); {155#false} is VALID [2022-02-21 03:04:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:07,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:07,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945532969] [2022-02-21 03:04:07,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945532969] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:07,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:07,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:07,989 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392246003] [2022-02-21 03:04:07,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:07,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:07,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:07,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:07,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:07,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:07,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:07,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:07,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:07,995 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:08,022 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-21 03:04:08,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:08,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:08,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-21 03:04:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-21 03:04:08,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2022-02-21 03:04:08,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:08,036 INFO L225 Difference]: With dead ends: 22 [2022-02-21 03:04:08,037 INFO L226 Difference]: Without dead ends: 20 [2022-02-21 03:04:08,037 INFO L932 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 [2022-02-21 03:04:08,038 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:08,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 7 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-21 03:04:08,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-21 03:04:08,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:08,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 16 states have (on average 1.5) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,042 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 16 states have (on average 1.5) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,042 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 16 states have (on average 1.5) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:08,043 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-21 03:04:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-21 03:04:08,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:08,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:08,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.5) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-21 03:04:08,056 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.5) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-21 03:04:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:08,056 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-21 03:04:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-21 03:04:08,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:08,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:08,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:08,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.5) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-02-21 03:04:08,058 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 5 [2022-02-21 03:04:08,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:08,058 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-02-21 03:04:08,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-21 03:04:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:04:08,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:08,059 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:04:08,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:04:08,059 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:04:08,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:08,059 INFO L85 PathProgramCache]: Analyzing trace with hash 889698349, now seen corresponding path program 1 times [2022-02-21 03:04:08,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:08,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962333362] [2022-02-21 03:04:08,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:08,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:08,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {245#true} assume { :begin_inline_ULTIMATE.init } true; {245#true} is VALID [2022-02-21 03:04:08,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~z~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {245#true} is VALID [2022-02-21 03:04:08,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {245#true} assume !!((main_~x~0#1 > 0 && main_~y~0#1 > 0) && main_~z~0#1 > 0); {247#(<= 1 |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:04:08,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {247#(<= 1 |ULTIMATE.start_main_~z~0#1|)} assume !(main_~y~0#1 > main_~x~0#1); {247#(<= 1 |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:04:08,082 INFO L290 TraceCheckUtils]: 4: Hoare triple {247#(<= 1 |ULTIMATE.start_main_~z~0#1|)} assume main_~z~0#1 - 1 <= 2147483647; {247#(<= 1 |ULTIMATE.start_main_~z~0#1|)} is VALID [2022-02-21 03:04:08,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#(<= 1 |ULTIMATE.start_main_~z~0#1|)} assume !(main_~z~0#1 - 1 >= -2147483648); {246#false} is VALID [2022-02-21 03:04:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:08,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:08,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962333362] [2022-02-21 03:04:08,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962333362] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:08,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:08,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:08,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707458117] [2022-02-21 03:04:08,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:08,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:04:08,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:08,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:08,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:08,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:08,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:08,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:08,089 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:08,134 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-21 03:04:08,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:08,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:04:08,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 03:04:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 03:04:08,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2022-02-21 03:04:08,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:08,146 INFO L225 Difference]: With dead ends: 20 [2022-02-21 03:04:08,146 INFO L226 Difference]: Without dead ends: 19 [2022-02-21 03:04:08,147 INFO L932 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 [2022-02-21 03:04:08,147 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:08,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-21 03:04:08,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-21 03:04:08,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:08,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,152 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,152 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:08,153 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-21 03:04:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-21 03:04:08,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:08,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:08,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-21 03:04:08,153 INFO L87 Difference]: Start difference. First operand has 19 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-21 03:04:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:08,154 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-21 03:04:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-21 03:04:08,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:08,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:08,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:08,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-02-21 03:04:08,155 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 6 [2022-02-21 03:04:08,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:08,155 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-02-21 03:04:08,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-21 03:04:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:04:08,156 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:08,156 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:04:08,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:04:08,156 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:04:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash 889692391, now seen corresponding path program 1 times [2022-02-21 03:04:08,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:08,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79117639] [2022-02-21 03:04:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:04:08,169 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:04:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:04:08,183 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:04:08,183 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 03:04:08,184 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-02-21 03:04:08,185 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-02-21 03:04:08,185 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-02-21 03:04:08,185 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-02-21 03:04:08,185 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-02-21 03:04:08,185 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-02-21 03:04:08,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:04:08,188 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-21 03:04:08,190 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:04:08,200 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:04:08,200 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:04:08,200 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-21 03:04:08,200 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-21 03:04:08,200 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-21 03:04:08,200 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-02-21 03:04:08,200 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:04:08,200 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:04:08,200 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-21 03:04:08,201 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:04:08,201 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:04:08,201 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-21 03:04:08,201 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-21 03:04:08,201 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:04:08,201 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-21 03:04:08,201 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-21 03:04:08,201 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-21 03:04:08,201 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-21 03:04:08,201 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-21 03:04:08,201 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-21 03:04:08,201 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-21 03:04:08,201 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-21 03:04:08,201 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:04:08,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:04:08 BoogieIcfgContainer [2022-02-21 03:04:08,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:04:08,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:04:08,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:04:08,202 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:04:08,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:07" (3/4) ... [2022-02-21 03:04:08,204 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 03:04:08,223 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:04:08,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:04:08,224 INFO L158 Benchmark]: Toolchain (without parser) took 1378.40ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 45.2MB in the beginning and 72.3MB in the end (delta: -27.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:08,224 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 86.0MB. Free memory is still 61.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:08,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.85ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 45.0MB in the beginning and 77.0MB in the end (delta: -32.0MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2022-02-21 03:04:08,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.22ms. Allocated memory is still 104.9MB. Free memory was 77.0MB in the beginning and 75.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:08,225 INFO L158 Benchmark]: Boogie Preprocessor took 17.94ms. Allocated memory is still 104.9MB. Free memory was 75.6MB in the beginning and 74.6MB in the end (delta: 978.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:08,225 INFO L158 Benchmark]: RCFGBuilder took 376.65ms. Allocated memory is still 104.9MB. Free memory was 74.6MB in the beginning and 78.1MB in the end (delta: -3.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:04:08,225 INFO L158 Benchmark]: TraceAbstraction took 668.33ms. Allocated memory is still 104.9MB. Free memory was 77.4MB in the beginning and 73.8MB in the end (delta: 3.6MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:08,225 INFO L158 Benchmark]: Witness Printer took 21.09ms. Allocated memory is still 104.9MB. Free memory was 73.8MB in the beginning and 72.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:08,226 INFO L339 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.14ms. Allocated memory is still 86.0MB. Free memory is still 61.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.85ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 45.0MB in the beginning and 77.0MB in the end (delta: -32.0MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.22ms. Allocated memory is still 104.9MB. Free memory was 77.0MB in the beginning and 75.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.94ms. Allocated memory is still 104.9MB. Free memory was 75.6MB in the beginning and 74.6MB in the end (delta: 978.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.65ms. Allocated memory is still 104.9MB. Free memory was 74.6MB in the beginning and 78.1MB in the end (delta: -3.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 668.33ms. Allocated memory is still 104.9MB. Free memory was 77.4MB in the beginning and 73.8MB in the end (delta: 3.6MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Witness Printer took 21.09ms. Allocated memory is still 104.9MB. Free memory was 73.8MB in the beginning and 72.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 24]: integer overflow possible integer overflow possible We found a FailurePath: [L15] int x, y, z; [L16] x = __VERIFIER_nondet_int() [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L20] COND TRUE x > 0 && y > 0 && z > 0 VAL [x=1, y=2, z=1] [L21] COND TRUE y > x [L22] y = z [L23] x = __VERIFIER_nondet_int() [L24] x - 1 VAL [x=-2147483648, y=1, z=1] - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 26]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 26]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 31 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=1, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 27 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-21 03:04:08,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)