./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig2a.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/AliasDarteFeautrierGonnord-SAS2010-Fig2a.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 abd4a3c7dd9fc6dd788312e2749fb84e8465aaabcc51ba8052404af690a1a44e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:03:30,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:03:30,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:03:30,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:03:30,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:03:30,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:03:30,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:03:30,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:03:30,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:03:30,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:03:30,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:03:30,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:03:30,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:03:30,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:03:30,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:03:30,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:03:30,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:03:30,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:03:30,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:03:30,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:03:30,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:03:30,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:03:30,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:03:30,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:03:30,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:03:30,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:03:30,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:03:30,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:03:30,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:03:30,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:03:30,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:03:30,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:03:30,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:03:30,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:03:30,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:03:30,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:03:30,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:03:30,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:03:30,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:03:30,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:03:30,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:03:30,871 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:03:30,899 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:03:30,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:03:30,899 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:03:30,899 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:03:30,900 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:03:30,900 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:03:30,901 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:03:30,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:03:30,901 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:03:30,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:03:30,902 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:03:30,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:03:30,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:03:30,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:03:30,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:03:30,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:03:30,903 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:03:30,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:03:30,903 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:03:30,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:03:30,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:03:30,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:03:30,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:03:30,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:30,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:03:30,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:03:30,904 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:03:30,904 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:03:30,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:03:30,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:03:30,905 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 -> abd4a3c7dd9fc6dd788312e2749fb84e8465aaabcc51ba8052404af690a1a44e [2022-02-21 03:03:31,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:03:31,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:03:31,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:03:31,117 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:03:31,117 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:03:31,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig2a.c [2022-02-21 03:03:31,162 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e724e72c/54e5110b14904722ac4df23c17cdfc20/FLAGb3ba66501 [2022-02-21 03:03:31,507 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:03:31,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig2a.c [2022-02-21 03:03:31,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e724e72c/54e5110b14904722ac4df23c17cdfc20/FLAGb3ba66501 [2022-02-21 03:03:31,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e724e72c/54e5110b14904722ac4df23c17cdfc20 [2022-02-21 03:03:31,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:03:31,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:03:31,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:31,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:03:31,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:03:31,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:31" (1/1) ... [2022-02-21 03:03:31,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdbcd6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:31, skipping insertion in model container [2022-02-21 03:03:31,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:31" (1/1) ... [2022-02-21 03:03:31,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:03:31,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:03:31,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:31,650 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:03:31,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:31,670 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:03:31,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:31 WrapperNode [2022-02-21 03:03:31,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:31,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:31,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:03:31,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:03:31,678 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:03:31" (1/1) ... [2022-02-21 03:03:31,682 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:03:31" (1/1) ... [2022-02-21 03:03:31,702 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2022-02-21 03:03:31,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:31,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:03:31,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:03:31,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:03:31,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:31" (1/1) ... [2022-02-21 03:03:31,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:31" (1/1) ... [2022-02-21 03:03:31,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:31" (1/1) ... [2022-02-21 03:03:31,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:31" (1/1) ... [2022-02-21 03:03:31,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:31" (1/1) ... [2022-02-21 03:03:31,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:31" (1/1) ... [2022-02-21 03:03:31,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:31" (1/1) ... [2022-02-21 03:03:31,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:03:31,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:03:31,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:03:31,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:03:31,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:31" (1/1) ... [2022-02-21 03:03:31,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:31,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:31,775 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:03:31,791 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:03:31,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:03:31,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:03:31,844 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:03:31,846 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:03:32,035 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:03:32,043 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:03:32,046 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:03:32,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:32 BoogieIcfgContainer [2022-02-21 03:03:32,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:03:32,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:03:32,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:03:32,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:03:32,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:03:31" (1/3) ... [2022-02-21 03:03:32,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1773a6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:32, skipping insertion in model container [2022-02-21 03:03:32,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:31" (2/3) ... [2022-02-21 03:03:32,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1773a6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:32, skipping insertion in model container [2022-02-21 03:03:32,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:32" (3/3) ... [2022-02-21 03:03:32,062 INFO L111 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-Fig2a.c [2022-02-21 03:03:32,066 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:03:32,066 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-02-21 03:03:32,095 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:03:32,100 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:03:32,100 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-02-21 03:03:32,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 29 states have internal predecessors, (34), 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:03:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 03:03:32,116 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:32,124 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 03:03:32,124 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:03:32,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:32,128 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2022-02-21 03:03:32,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:32,135 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380510765] [2022-02-21 03:03:32,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:32,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:32,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} assume { :begin_inline_ULTIMATE.init } true; {33#true} is VALID [2022-02-21 03:03:32,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#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~short3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~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; {35#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:03:32,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume !!(main_~x~0#1 >= 2); {35#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:03:32,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {35#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume !(main_~x~0#1 - 1 <= 2147483647); {34#false} is VALID [2022-02-21 03:03:32,294 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:03:32,294 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:32,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380510765] [2022-02-21 03:03:32,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380510765] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:32,296 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:32,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:32,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233392308] [2022-02-21 03:03:32,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:32,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-02-21 03:03:32,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:32,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:03:32,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:32,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:32,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:32,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:32,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:32,337 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 29 states have internal predecessors, (34), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 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:03:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:32,420 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-02-21 03:03:32,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:32,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-02-21 03:03:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:03:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-02-21 03:03:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:03:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-02-21 03:03:32,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-02-21 03:03:32,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:32,498 INFO L225 Difference]: With dead ends: 56 [2022-02-21 03:03:32,498 INFO L226 Difference]: Without dead ends: 24 [2022-02-21 03:03:32,500 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:03:32,504 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:32,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 14 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:32,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-21 03:03:32,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-21 03:03:32,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:32,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 16 states have (on average 1.625) internal successors, (26), 23 states have internal predecessors, (26), 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:03:32,531 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 16 states have (on average 1.625) internal successors, (26), 23 states have internal predecessors, (26), 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:03:32,532 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 16 states have (on average 1.625) internal successors, (26), 23 states have internal predecessors, (26), 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:03:32,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:32,533 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-21 03:03:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-21 03:03:32,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:32,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:32,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.625) internal successors, (26), 23 states have internal predecessors, (26), 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 24 states. [2022-02-21 03:03:32,534 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.625) internal successors, (26), 23 states have internal predecessors, (26), 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 24 states. [2022-02-21 03:03:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:32,536 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-21 03:03:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-21 03:03:32,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:32,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:32,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:32,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.625) internal successors, (26), 23 states have internal predecessors, (26), 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:03:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-02-21 03:03:32,539 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 4 [2022-02-21 03:03:32,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:32,539 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-02-21 03:03:32,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:03:32,539 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-21 03:03:32,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:03:32,540 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:32,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:03:32,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:03:32,540 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:03:32,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:32,541 INFO L85 PathProgramCache]: Analyzing trace with hash 28699721, now seen corresponding path program 1 times [2022-02-21 03:03:32,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:32,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247658814] [2022-02-21 03:03:32,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:32,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:32,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#true} assume { :begin_inline_ULTIMATE.init } true; {174#true} is VALID [2022-02-21 03:03:32,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#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~short3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~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; {174#true} is VALID [2022-02-21 03:03:32,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {174#true} assume !!(main_~x~0#1 >= 2); {176#(<= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:03:32,562 INFO L290 TraceCheckUtils]: 3: Hoare triple {176#(<= 2 |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 - 1 <= 2147483647; {176#(<= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:03:32,563 INFO L290 TraceCheckUtils]: 4: Hoare triple {176#(<= 2 |ULTIMATE.start_main_~x~0#1|)} assume !(main_~x~0#1 - 1 >= -2147483648); {175#false} is VALID [2022-02-21 03:03:32,563 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:03:32,563 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:32,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247658814] [2022-02-21 03:03:32,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247658814] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:32,564 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:32,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:32,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321795846] [2022-02-21 03:03:32,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:32,569 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:03:32,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:32,569 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:03:32,573 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:03:32,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:32,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:32,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:32,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:32,574 INFO L87 Difference]: Start difference. First operand 24 states and 26 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:03:32,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:32,611 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-02-21 03:03:32,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:32,611 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:03:32,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:32,612 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:03:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-21 03:03:32,613 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:03:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-21 03:03:32,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-02-21 03:03:32,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:32,633 INFO L225 Difference]: With dead ends: 24 [2022-02-21 03:03:32,633 INFO L226 Difference]: Without dead ends: 23 [2022-02-21 03:03:32,634 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:03:32,638 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:32,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-21 03:03:32,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-21 03:03:32,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:32,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 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:03:32,645 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 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:03:32,645 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 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:03:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:32,646 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-02-21 03:03:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-02-21 03:03:32,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:32,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:32,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 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 23 states. [2022-02-21 03:03:32,648 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 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 23 states. [2022-02-21 03:03:32,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:32,651 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-02-21 03:03:32,651 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-02-21 03:03:32,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:32,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:32,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:32,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 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:03:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-02-21 03:03:32,654 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 5 [2022-02-21 03:03:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:32,654 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-02-21 03:03:32,654 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:03:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-02-21 03:03:32,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:03:32,655 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:32,655 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:03:32,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:03:32,655 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-02-21 03:03:32,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash 889691398, now seen corresponding path program 1 times [2022-02-21 03:03:32,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:32,657 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045427438] [2022-02-21 03:03:32,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:32,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:03:32,678 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:03:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:03:32,689 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:03:32,690 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 03:03:32,690 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-02-21 03:03:32,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-02-21 03:03:32,691 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-02-21 03:03:32,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-02-21 03:03:32,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-02-21 03:03:32,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-02-21 03:03:32,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-02-21 03:03:32,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-02-21 03:03:32,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-02-21 03:03:32,692 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-02-21 03:03:32,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:03:32,694 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-21 03:03:32,696 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:03:32,706 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:03:32,706 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:03:32,706 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-21 03:03:32,706 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-21 03:03:32,706 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-21 03:03:32,706 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2022-02-21 03:03:32,706 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:03:32,706 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:03:32,706 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-21 03:03:32,707 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-21 03:03:32,708 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-21 03:03:32,708 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-21 03:03:32,708 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:03:32,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:03:32 BoogieIcfgContainer [2022-02-21 03:03:32,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:03:32,709 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:03:32,709 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:03:32,709 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:03:32,709 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:32" (3/4) ... [2022-02-21 03:03:32,710 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 03:03:32,730 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:03:32,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:03:32,731 INFO L158 Benchmark]: Toolchain (without parser) took 1187.16ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 68.9MB in the beginning and 92.4MB in the end (delta: -23.4MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2022-02-21 03:03:32,731 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 90.2MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:03:32,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 124.53ms. Allocated memory is still 90.2MB. Free memory was 68.7MB in the beginning and 59.9MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:03:32,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.98ms. Allocated memory is still 90.2MB. Free memory was 59.7MB in the beginning and 58.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:03:32,732 INFO L158 Benchmark]: Boogie Preprocessor took 32.92ms. Allocated memory is still 90.2MB. Free memory was 58.3MB in the beginning and 57.3MB in the end (delta: 945.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:03:32,732 INFO L158 Benchmark]: RCFGBuilder took 310.29ms. Allocated memory is still 90.2MB. Free memory was 57.3MB in the beginning and 45.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:03:32,732 INFO L158 Benchmark]: TraceAbstraction took 651.32ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 45.3MB in the beginning and 56.8MB in the end (delta: -11.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2022-02-21 03:03:32,732 INFO L158 Benchmark]: Witness Printer took 21.67ms. Allocated memory is still 115.3MB. Free memory was 56.8MB in the beginning and 92.4MB in the end (delta: -35.5MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2022-02-21 03:03:32,733 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.09ms. Allocated memory is still 90.2MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 124.53ms. Allocated memory is still 90.2MB. Free memory was 68.7MB in the beginning and 59.9MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.98ms. Allocated memory is still 90.2MB. Free memory was 59.7MB in the beginning and 58.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.92ms. Allocated memory is still 90.2MB. Free memory was 58.3MB in the beginning and 57.3MB in the end (delta: 945.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 310.29ms. Allocated memory is still 90.2MB. Free memory was 57.3MB in the beginning and 45.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 651.32ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 45.3MB in the beginning and 56.8MB in the end (delta: -11.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Witness Printer took 21.67ms. Allocated memory is still 115.3MB. Free memory was 56.8MB in the beginning and 92.4MB in the end (delta: -35.5MB). Peak memory consumption was 2.4MB. 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: 19]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int x, y; [L15] x = __VERIFIER_nondet_int() [L16] y = __VERIFIER_nondet_int() [L17] COND TRUE x >= 2 VAL [x=2, y=2147483647] [L18] EXPR x - 1 [L18] x = x - 1 VAL [x=1, y=2147483647] [L19] y + x VAL [x=1, y=2147483647] - UnprovableResult [Line: 18]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - 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: 24]: 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, 30 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, 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, 25 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 36 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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:03:32,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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)