./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/ChenFlurMukhopadhyay-SAS2012-Ex2.10.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/ChenFlurMukhopadhyay-SAS2012-Ex2.10.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 ee0ccea6b90e9b6a2f2fc862a3a7704844534359e41607705cde2a5dfc759de7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:05:01,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:05:01,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:05:01,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:05:01,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:05:01,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:05:01,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:05:01,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:05:01,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:05:01,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:05:01,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:05:01,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:05:01,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:05:01,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:05:01,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:05:01,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:05:01,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:05:01,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:05:01,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:05:01,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:05:01,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:05:01,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:05:01,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:05:01,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:05:01,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:05:01,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:05:01,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:05:01,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:05:01,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:05:01,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:05:01,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:05:01,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:05:01,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:05:01,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:05:01,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:05:01,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:05:01,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:05:01,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:05:01,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:05:01,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:05:01,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:05:01,174 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:05:01,202 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:05:01,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:05:01,202 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:05:01,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:05:01,203 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:05:01,203 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:05:01,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:05:01,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:05:01,204 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:05:01,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:05:01,205 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:05:01,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:05:01,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:05:01,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:05:01,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:05:01,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:05:01,206 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:05:01,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:05:01,206 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:05:01,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:05:01,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:05:01,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:05:01,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:05:01,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:01,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:05:01,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:05:01,207 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:05:01,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:05:01,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:05:01,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:05:01,209 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 -> ee0ccea6b90e9b6a2f2fc862a3a7704844534359e41607705cde2a5dfc759de7 [2022-02-21 03:05:01,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:05:01,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:05:01,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:05:01,396 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:05:01,399 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:05:01,400 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/ChenFlurMukhopadhyay-SAS2012-Ex2.10.c [2022-02-21 03:05:01,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/046a0ef33/1ba1137b9ae744448d70c94c11751502/FLAG85660c27f [2022-02-21 03:05:01,795 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:05:01,795 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/ChenFlurMukhopadhyay-SAS2012-Ex2.10.c [2022-02-21 03:05:01,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/046a0ef33/1ba1137b9ae744448d70c94c11751502/FLAG85660c27f [2022-02-21 03:05:01,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/046a0ef33/1ba1137b9ae744448d70c94c11751502 [2022-02-21 03:05:01,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:05:01,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:05:01,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:01,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:05:01,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:05:01,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:01" (1/1) ... [2022-02-21 03:05:01,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@457907af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:01, skipping insertion in model container [2022-02-21 03:05:01,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:01" (1/1) ... [2022-02-21 03:05:01,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:05:01,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:05:01,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:01,959 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:05:01,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:01,977 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:05:01,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:01 WrapperNode [2022-02-21 03:05:01,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:01,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:01,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:05:01,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:05:01,984 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:05:01" (1/1) ... [2022-02-21 03:05:01,987 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:05:01" (1/1) ... [2022-02-21 03:05:01,999 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 22 [2022-02-21 03:05:02,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:02,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:05:02,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:05:02,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:05:02,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:01" (1/1) ... [2022-02-21 03:05:02,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:01" (1/1) ... [2022-02-21 03:05:02,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:01" (1/1) ... [2022-02-21 03:05:02,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:01" (1/1) ... [2022-02-21 03:05:02,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:01" (1/1) ... [2022-02-21 03:05:02,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:01" (1/1) ... [2022-02-21 03:05:02,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:01" (1/1) ... [2022-02-21 03:05:02,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:05:02,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:05:02,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:05:02,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:05:02,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:01" (1/1) ... [2022-02-21 03:05:02,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:02,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:02,048 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:05:02,092 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:05:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:05:02,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:05:02,150 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:05:02,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:05:02,310 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:05:02,316 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:05:02,319 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:05:02,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:02 BoogieIcfgContainer [2022-02-21 03:05:02,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:05:02,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:05:02,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:05:02,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:05:02,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:05:01" (1/3) ... [2022-02-21 03:05:02,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a765bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:02, skipping insertion in model container [2022-02-21 03:05:02,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:01" (2/3) ... [2022-02-21 03:05:02,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a765bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:02, skipping insertion in model container [2022-02-21 03:05:02,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:02" (3/3) ... [2022-02-21 03:05:02,326 INFO L111 eAbstractionObserver]: Analyzing ICFG ChenFlurMukhopadhyay-SAS2012-Ex2.10.c [2022-02-21 03:05:02,330 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:05:02,330 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:05:02,363 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:05:02,368 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:05:02,368 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-21 03:05:02,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.6) internal successors, (16), 14 states have internal predecessors, (16), 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:05:02,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 03:05:02,381 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:02,382 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 03:05:02,382 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:05:02,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:02,386 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2022-02-21 03:05:02,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:02,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368446520] [2022-02-21 03:05:02,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:02,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:02,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {18#true} assume { :begin_inline_ULTIMATE.init } true; {18#true} is VALID [2022-02-21 03:05:02,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {18#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_~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; {20#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:05:02,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume !!(main_~x~0#1 > 0 && main_~y~0#1 < 0); {21#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} is VALID [2022-02-21 03:05:02,508 INFO L290 TraceCheckUtils]: 3: Hoare triple {21#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483646)} assume !(main_~x~0#1 + main_~y~0#1 <= 2147483647); {19#false} is VALID [2022-02-21 03:05:02,509 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:05:02,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:02,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368446520] [2022-02-21 03:05:02,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368446520] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:02,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:02,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:02,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766865265] [2022-02-21 03:05:02,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:02,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:05:02,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:02,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:05:02,534 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:05:02,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:05:02,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:02,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:05:02,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:02,555 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.6) internal successors, (16), 14 states have internal predecessors, (16), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:05:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:02,643 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-02-21 03:05:02,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:05:02,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:05:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:05:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-02-21 03:05:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:05:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-02-21 03:05:02,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-02-21 03:05:02,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:02,677 INFO L225 Difference]: With dead ends: 19 [2022-02-21 03:05:02,678 INFO L226 Difference]: Without dead ends: 10 [2022-02-21 03:05:02,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:05:02,682 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:02,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-21 03:05:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-21 03:05:02,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:02,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 9 states have internal predecessors, (10), 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:05:02,700 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 9 states have internal predecessors, (10), 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:05:02,700 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 9 states have internal predecessors, (10), 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:05:02,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:02,702 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-21 03:05:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-21 03:05:02,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:02,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:02,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 9 states have internal predecessors, (10), 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 10 states. [2022-02-21 03:05:02,703 INFO L87 Difference]: Start difference. First operand has 10 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 9 states have internal predecessors, (10), 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 10 states. [2022-02-21 03:05:02,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:02,704 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-21 03:05:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-21 03:05:02,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:02,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:02,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:02,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 9 states have internal predecessors, (10), 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:05:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-02-21 03:05:02,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 4 [2022-02-21 03:05:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:02,708 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-02-21 03:05:02,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:05:02,709 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-21 03:05:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:05:02,709 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:02,709 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:05:02,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:05:02,710 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:05:02,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:02,712 INFO L85 PathProgramCache]: Analyzing trace with hash 28699721, now seen corresponding path program 1 times [2022-02-21 03:05:02,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:02,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245245243] [2022-02-21 03:05:02,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:02,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:02,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {79#true} assume { :begin_inline_ULTIMATE.init } true; {79#true} is VALID [2022-02-21 03:05:02,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {79#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_~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; {81#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:05:02,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {81#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume !!(main_~x~0#1 > 0 && main_~y~0#1 < 0); {82#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:02,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {82#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {82#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:02,742 INFO L290 TraceCheckUtils]: 4: Hoare triple {82#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume !(main_~x~0#1 + main_~y~0#1 >= -2147483648); {80#false} is VALID [2022-02-21 03:05:02,742 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:05:02,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:02,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245245243] [2022-02-21 03:05:02,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245245243] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:02,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:02,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:02,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944154058] [2022-02-21 03:05:02,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:02,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:05:02,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:02,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:05:02,749 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:05:02,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:05:02,749 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:02,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:05:02,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:02,750 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:05:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:02,781 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-21 03:05:02,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:05:02,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:05:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:05:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-02-21 03:05:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:05:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-02-21 03:05:02,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 10 transitions. [2022-02-21 03:05:02,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:02,797 INFO L225 Difference]: With dead ends: 10 [2022-02-21 03:05:02,797 INFO L226 Difference]: Without dead ends: 9 [2022-02-21 03:05:02,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:05:02,803 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4 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:05:02,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 4 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:02,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-02-21 03:05:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-21 03:05:02,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:02,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 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:05:02,809 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 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:05:02,810 INFO L87 Difference]: Start difference. First operand 9 states. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 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:05:02,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:02,812 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-21 03:05:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-21 03:05:02,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:02,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:02,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 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 9 states. [2022-02-21 03:05:02,813 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 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 9 states. [2022-02-21 03:05:02,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:02,820 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-21 03:05:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-21 03:05:02,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:02,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:02,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:02,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 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:05:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-02-21 03:05:02,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2022-02-21 03:05:02,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:02,823 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-21 03:05:02,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:05:02,824 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-21 03:05:02,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:05:02,824 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:02,824 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:05:02,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:05:02,825 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:05:02,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:02,826 INFO L85 PathProgramCache]: Analyzing trace with hash 889691398, now seen corresponding path program 1 times [2022-02-21 03:05:02,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:02,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335188125] [2022-02-21 03:05:02,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:02,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:02,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#true} assume { :begin_inline_ULTIMATE.init } true; {126#true} is VALID [2022-02-21 03:05:02,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#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_~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; {128#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:05:02,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {128#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume !!(main_~x~0#1 > 0 && main_~y~0#1 < 0); {128#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:05:02,858 INFO L290 TraceCheckUtils]: 3: Hoare triple {128#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume main_~x~0#1 + main_~y~0#1 <= 2147483647; {128#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:05:02,858 INFO L290 TraceCheckUtils]: 4: Hoare triple {128#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume main_~x~0#1 + main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 + main_~y~0#1; {128#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:05:02,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume !(main_~y~0#1 - 1 <= 2147483647); {127#false} is VALID [2022-02-21 03:05:02,859 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:05:02,859 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:02,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335188125] [2022-02-21 03:05:02,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335188125] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:02,860 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:02,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:02,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321189640] [2022-02-21 03:05:02,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:02,862 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:05:02,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:02,862 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:05:02,867 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:05:02,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:02,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:02,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:02,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:02,869 INFO L87 Difference]: Start difference. First operand 9 states and 9 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:05:02,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:02,894 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-21 03:05:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:02,894 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:05:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:02,895 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:05:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 03:05:02,896 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:05:02,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 03:05:02,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9 transitions. [2022-02-21 03:05:02,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:02,906 INFO L225 Difference]: With dead ends: 9 [2022-02-21 03:05:02,906 INFO L226 Difference]: Without dead ends: 8 [2022-02-21 03:05:02,906 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:05:02,910 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:02,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 3 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-21 03:05:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-21 03:05:02,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:02,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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:05:02,917 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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:05:02,917 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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:05:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:02,917 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-21 03:05:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-21 03:05:02,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:02,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:02,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 8 states. [2022-02-21 03:05:02,918 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 8 states. [2022-02-21 03:05:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:02,918 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-21 03:05:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-21 03:05:02,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:02,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:02,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:02,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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:05:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-02-21 03:05:02,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-02-21 03:05:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:02,919 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-02-21 03:05:02,919 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:05:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-21 03:05:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:05:02,920 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:02,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:02,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:05:02,920 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:05:02,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1810629611, now seen corresponding path program 1 times [2022-02-21 03:05:02,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:02,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913921266] [2022-02-21 03:05:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:02,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:05:02,932 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:05:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:05:02,950 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:05:02,954 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 03:05:02,955 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-02-21 03:05:02,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-02-21 03:05:02,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-02-21 03:05:02,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-02-21 03:05:02,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:05:02,964 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-21 03:05:02,966 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:05:02,977 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:05:02,977 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:05:02,977 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-21 03:05:02,977 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-21 03:05:02,977 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-21 03:05:02,977 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-21 03:05:02,977 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-21 03:05:02,977 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-21 03:05:02,977 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-21 03:05:02,977 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-21 03:05:02,977 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-21 03:05:02,977 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:05:02,980 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-21 03:05:02,980 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-21 03:05:02,980 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-21 03:05:02,980 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-21 03:05:02,980 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:05:02,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:05:02 BoogieIcfgContainer [2022-02-21 03:05:02,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:05:02,982 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:05:02,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:05:02,982 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:05:02,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:02" (3/4) ... [2022-02-21 03:05:02,984 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 03:05:03,005 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:05:03,005 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:05:03,006 INFO L158 Benchmark]: Toolchain (without parser) took 1190.55ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 54.0MB in the beginning and 56.6MB in the end (delta: -2.6MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2022-02-21 03:05:03,006 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 88.1MB. Free memory was 58.4MB in the beginning and 58.4MB in the end (delta: 29.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:03,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.44ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 53.7MB in the beginning and 88.4MB in the end (delta: -34.7MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-02-21 03:05:03,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.80ms. Allocated memory is still 111.1MB. Free memory was 88.4MB in the beginning and 87.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:03,007 INFO L158 Benchmark]: Boogie Preprocessor took 17.28ms. Allocated memory is still 111.1MB. Free memory was 87.0MB in the beginning and 86.3MB in the end (delta: 697.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:03,008 INFO L158 Benchmark]: RCFGBuilder took 302.25ms. Allocated memory is still 111.1MB. Free memory was 86.3MB in the beginning and 76.6MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:05:03,008 INFO L158 Benchmark]: TraceAbstraction took 659.69ms. Allocated memory is still 111.1MB. Free memory was 75.8MB in the beginning and 58.3MB in the end (delta: 17.5MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2022-02-21 03:05:03,008 INFO L158 Benchmark]: Witness Printer took 23.42ms. Allocated memory is still 111.1MB. Free memory was 58.1MB in the beginning and 56.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:03,010 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.10ms. Allocated memory is still 88.1MB. Free memory was 58.4MB in the beginning and 58.4MB in the end (delta: 29.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 160.44ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 53.7MB in the beginning and 88.4MB in the end (delta: -34.7MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.80ms. Allocated memory is still 111.1MB. Free memory was 88.4MB in the beginning and 87.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.28ms. Allocated memory is still 111.1MB. Free memory was 87.0MB in the beginning and 86.3MB in the end (delta: 697.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 302.25ms. Allocated memory is still 111.1MB. Free memory was 86.3MB in the beginning and 76.6MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 659.69ms. Allocated memory is still 111.1MB. Free memory was 75.8MB in the beginning and 58.3MB in the end (delta: 17.5MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * Witness Printer took 23.42ms. Allocated memory is still 111.1MB. Free memory was 58.1MB in the beginning and 56.6MB 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: 28]: integer overflow possible integer overflow possible We found a FailurePath: [L23] int x, y; [L24] x = __VERIFIER_nondet_int() [L25] y = __VERIFIER_nondet_int() [L26] COND TRUE x > 0 && y < 0 VAL [x=1, y=-2147483648] [L27] EXPR x + y [L27] x = x + y VAL [x=-2147483647, y=-2147483648] [L28] y - 1 VAL [x=-2147483647, y=-2147483648] - UnprovableResult [Line: 27]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 27]: 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, 15 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 13 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=0, InterpolantAutomatonStates: 11, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 40 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:05:03,046 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)