./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.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-wise.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 024b54dcc71a4cff37fb88a3019598a20adbf40036f66c2a7f758cfecaaffadc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:04:01,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:04:01,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:04:01,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:04:01,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:04:01,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:04:01,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:04:01,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:04:01,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:04:01,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:04:01,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:04:01,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:04:01,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:04:01,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:04:01,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:04:01,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:04:01,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:04:01,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:04:01,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:04:01,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:04:01,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:04:01,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:04:01,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:04:01,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:04:01,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:04:01,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:04:01,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:04:01,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:04:01,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:04:01,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:04:01,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:04:01,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:04:01,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:04:01,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:04:01,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:04:01,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:04:01,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:04:01,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:04:01,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:04:02,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:04:02,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:04:02,001 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:04:02,033 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:04:02,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:04:02,037 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:04:02,037 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:04:02,038 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:04:02,038 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:04:02,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:04:02,039 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:04:02,039 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:04:02,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:04:02,040 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:04:02,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:04:02,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:04:02,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:04:02,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:04:02,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:04:02,042 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:04:02,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:04:02,042 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:04:02,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:04:02,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:04:02,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:04:02,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:04:02,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:02,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:04:02,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:04:02,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:04:02,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:04:02,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:04:02,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:04:02,045 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 -> 024b54dcc71a4cff37fb88a3019598a20adbf40036f66c2a7f758cfecaaffadc [2022-02-21 03:04:02,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:04:02,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:04:02,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:04:02,322 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:04:02,323 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:04:02,324 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c [2022-02-21 03:04:02,408 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6db087c2/44ca7132d57442f684b4215f6be2469e/FLAG398e93cf0 [2022-02-21 03:04:02,771 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:04:02,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c [2022-02-21 03:04:02,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6db087c2/44ca7132d57442f684b4215f6be2469e/FLAG398e93cf0 [2022-02-21 03:04:03,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6db087c2/44ca7132d57442f684b4215f6be2469e [2022-02-21 03:04:03,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:04:03,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:04:03,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:03,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:04:03,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:04:03,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:03" (1/1) ... [2022-02-21 03:04:03,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4c85dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:03, skipping insertion in model container [2022-02-21 03:04:03,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:03" (1/1) ... [2022-02-21 03:04:03,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:04:03,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:04:03,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:03,359 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:04:03,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:03,389 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:04:03,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:03 WrapperNode [2022-02-21 03:04:03,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:03,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:03,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:04:03,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:04:03,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:03" (1/1) ... [2022-02-21 03:04:03,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:03" (1/1) ... [2022-02-21 03:04:03,427 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2022-02-21 03:04:03,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:03,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:04:03,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:04:03,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:04:03,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:03" (1/1) ... [2022-02-21 03:04:03,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:03" (1/1) ... [2022-02-21 03:04:03,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:03" (1/1) ... [2022-02-21 03:04:03,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:03" (1/1) ... [2022-02-21 03:04:03,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:03" (1/1) ... [2022-02-21 03:04:03,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:03" (1/1) ... [2022-02-21 03:04:03,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:03" (1/1) ... [2022-02-21 03:04:03,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:04:03,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:04:03,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:04:03,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:04:03,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:03" (1/1) ... [2022-02-21 03:04:03,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:03,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:03,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:04:03,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:04:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:04:03,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:04:03,635 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:04:03,637 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:04:03,814 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:04:03,819 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:04:03,820 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:04:03,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:03 BoogieIcfgContainer [2022-02-21 03:04:03,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:04:03,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:04:03,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:04:03,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:04:03,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:04:03" (1/3) ... [2022-02-21 03:04:03,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661a3ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:03, skipping insertion in model container [2022-02-21 03:04:03,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:03" (2/3) ... [2022-02-21 03:04:03,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661a3ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:03, skipping insertion in model container [2022-02-21 03:04:03,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:03" (3/3) ... [2022-02-21 03:04:03,828 INFO L111 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-wise.c [2022-02-21 03:04:03,832 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:04:03,833 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-02-21 03:04:03,891 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:04:03,907 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:04:03,908 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-02-21 03:04:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 03:04:03,927 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:03,928 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 03:04:03,944 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:04:03,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:03,949 INFO L85 PathProgramCache]: Analyzing trace with hash 925608, now seen corresponding path program 1 times [2022-02-21 03:04:03,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:03,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194663151] [2022-02-21 03:04:03,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:04,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true; {29#true} is VALID [2022-02-21 03:04:04,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#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~short2#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; {31#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:04:04,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {32#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:04:04,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} assume !(main_~x~0#1 - main_~y~0#1 <= 2147483647); {30#false} is VALID [2022-02-21 03:04:04,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:04,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:04,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194663151] [2022-02-21 03:04:04,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194663151] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:04,169 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:04,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:04:04,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960138066] [2022-02-21 03:04:04,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:04,177 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:04:04,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:04,181 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:04:04,190 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:04:04,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:04:04,191 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:04,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:04:04,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:04:04,222 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 25 states have internal predecessors, (30), 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:04:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:04,441 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-02-21 03:04:04,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:04:04,441 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:04:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:04,443 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:04:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-21 03:04:04,457 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:04:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-21 03:04:04,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-21 03:04:04,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:04,540 INFO L225 Difference]: With dead ends: 54 [2022-02-21 03:04:04,540 INFO L226 Difference]: Without dead ends: 36 [2022-02-21 03:04:04,543 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:04:04,546 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:04,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 25 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:04:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-21 03:04:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2022-02-21 03:04:04,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:04,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:04,589 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:04,589 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:04,592 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-21 03:04:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-21 03:04:04,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:04,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:04,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states. [2022-02-21 03:04:04,593 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states. [2022-02-21 03:04:04,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:04,596 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-21 03:04:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-21 03:04:04,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:04,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:04,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:04,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-02-21 03:04:04,600 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 4 [2022-02-21 03:04:04,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:04,600 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-21 03:04:04,600 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:04:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-21 03:04:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:04:04,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:04,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:04:04,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:04:04,602 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:04:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash 28693891, now seen corresponding path program 1 times [2022-02-21 03:04:04,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:04,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074481846] [2022-02-21 03:04:04,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:04,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:04,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {194#true} assume { :begin_inline_ULTIMATE.init } true; {194#true} is VALID [2022-02-21 03:04:04,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#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~short2#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; {196#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:04:04,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {197#(<= |ULTIMATE.start_main_~y~0#1| (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:04:04,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {197#(<= |ULTIMATE.start_main_~y~0#1| (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {197#(<= |ULTIMATE.start_main_~y~0#1| (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:04:04,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {197#(<= |ULTIMATE.start_main_~y~0#1| (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 - main_~y~0#1 >= -2147483648); {195#false} is VALID [2022-02-21 03:04:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:04,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:04,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074481846] [2022-02-21 03:04:04,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074481846] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:04,640 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:04,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:04:04,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430329487] [2022-02-21 03:04:04,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:04,642 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:04:04,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:04,642 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:04:04,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:04,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:04:04,648 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:04,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:04:04,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:04:04,649 INFO L87 Difference]: Start difference. First operand 22 states and 24 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:04:04,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:04,747 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-02-21 03:04:04,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:04:04,747 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:04:04,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:04,748 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:04:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-02-21 03:04:04,749 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:04:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-02-21 03:04:04,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-02-21 03:04:04,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:04,789 INFO L225 Difference]: With dead ends: 48 [2022-02-21 03:04:04,789 INFO L226 Difference]: Without dead ends: 46 [2022-02-21 03:04:04,790 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:04:04,791 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 43 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:04,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 22 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-21 03:04:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2022-02-21 03:04:04,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:04,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 31 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:04,800 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 31 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:04,801 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 31 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:04,802 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-02-21 03:04:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-02-21 03:04:04,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:04,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:04,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 30 states have internal predecessors, (38), 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 46 states. [2022-02-21 03:04:04,804 INFO L87 Difference]: Start difference. First operand has 31 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 30 states have internal predecessors, (38), 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 46 states. [2022-02-21 03:04:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:04,805 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-02-21 03:04:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-02-21 03:04:04,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:04,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:04,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:04,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-02-21 03:04:04,808 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 5 [2022-02-21 03:04:04,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:04,808 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-02-21 03:04:04,808 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:04:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-21 03:04:04,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:04:04,809 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:04,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:04,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:04:04,809 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:04:04,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:04,810 INFO L85 PathProgramCache]: Analyzing trace with hash -535877839, now seen corresponding path program 1 times [2022-02-21 03:04:04,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:04,810 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657058944] [2022-02-21 03:04:04,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:04,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:04,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {382#true} assume { :begin_inline_ULTIMATE.init } true; {382#true} is VALID [2022-02-21 03:04:04,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#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~short2#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; {384#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:04:04,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {384#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {384#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:04:04,854 INFO L290 TraceCheckUtils]: 3: Hoare triple {384#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {384#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:04:04,855 INFO L290 TraceCheckUtils]: 4: Hoare triple {384#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_#t~short2#1 := main_~x~0#1 - main_~y~0#1 > 2; {385#(or (not |ULTIMATE.start_main_#t~short2#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483644))} is VALID [2022-02-21 03:04:04,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#(or (not |ULTIMATE.start_main_#t~short2#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483644))} assume main_#t~short2#1; {386#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} is VALID [2022-02-21 03:04:04,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {386#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} assume !!main_#t~short2#1;havoc main_#t~short2#1; {386#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} is VALID [2022-02-21 03:04:04,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {386#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} assume !(main_~x~0#1 < main_~y~0#1); {386#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} is VALID [2022-02-21 03:04:04,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {386#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} assume !(1 + main_~y~0#1 <= 2147483647); {383#false} is VALID [2022-02-21 03:04:04,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:04,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:04,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657058944] [2022-02-21 03:04:04,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657058944] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:04,858 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:04,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:04:04,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93165383] [2022-02-21 03:04:04,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:04,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) Word has length 9 [2022-02-21 03:04:04,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:04,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:04:04,865 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:04:04,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:04:04,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:04,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:04:04,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:04:04,866 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:04:04,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:04,993 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-02-21 03:04:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:04:04,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) Word has length 9 [2022-02-21 03:04:04,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:04:04,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-02-21 03:04:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:04:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-02-21 03:04:04,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-02-21 03:04:05,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:05,044 INFO L225 Difference]: With dead ends: 80 [2022-02-21 03:04:05,044 INFO L226 Difference]: Without dead ends: 79 [2022-02-21 03:04:05,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:04:05,046 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 69 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:05,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 12 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-21 03:04:05,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2022-02-21 03:04:05,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:05,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 66 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 65 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,060 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 66 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 65 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,060 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 66 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 65 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,062 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2022-02-21 03:04:05,063 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2022-02-21 03:04:05,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:05,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:05,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 65 states have internal predecessors, (94), 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 79 states. [2022-02-21 03:04:05,069 INFO L87 Difference]: Start difference. First operand has 66 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 65 states have internal predecessors, (94), 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 79 states. [2022-02-21 03:04:05,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,071 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2022-02-21 03:04:05,071 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2022-02-21 03:04:05,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:05,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:05,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:05,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 65 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2022-02-21 03:04:05,074 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 9 [2022-02-21 03:04:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:05,075 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2022-02-21 03:04:05,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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:04:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2022-02-21 03:04:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:04:05,076 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:05,076 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:05,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:04:05,076 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:04:05,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:05,077 INFO L85 PathProgramCache]: Analyzing trace with hash -535878031, now seen corresponding path program 1 times [2022-02-21 03:04:05,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:05,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31280672] [2022-02-21 03:04:05,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:05,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:05,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {711#true} assume { :begin_inline_ULTIMATE.init } true; {711#true} is VALID [2022-02-21 03:04:05,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#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~short2#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; {711#true} is VALID [2022-02-21 03:04:05,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {711#true} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {711#true} is VALID [2022-02-21 03:04:05,110 INFO L290 TraceCheckUtils]: 3: Hoare triple {711#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {711#true} is VALID [2022-02-21 03:04:05,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {711#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_#t~short2#1 := main_~x~0#1 - main_~y~0#1 > 2; {713#(or (not |ULTIMATE.start_main_#t~short2#1|) (<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:04:05,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {713#(or (not |ULTIMATE.start_main_#t~short2#1|) (<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} assume main_#t~short2#1; {714#(<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:05,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {714#(<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume !!main_#t~short2#1;havoc main_#t~short2#1; {714#(<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:05,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {714#(<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 < main_~y~0#1; {712#false} is VALID [2022-02-21 03:04:05,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#false} assume !(1 + main_~x~0#1 <= 2147483647); {712#false} is VALID [2022-02-21 03:04:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:05,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:05,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31280672] [2022-02-21 03:04:05,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31280672] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:05,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:05,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:04:05,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763097430] [2022-02-21 03:04:05,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:05,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Word has length 9 [2022-02-21 03:04:05,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:05,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:04:05,120 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:04:05,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:04:05,121 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:05,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:04:05,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:04:05,122 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:04:05,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,200 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2022-02-21 03:04:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:04:05,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Word has length 9 [2022-02-21 03:04:05,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:04:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-02-21 03:04:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:04:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-02-21 03:04:05,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-02-21 03:04:05,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:05,236 INFO L225 Difference]: With dead ends: 97 [2022-02-21 03:04:05,236 INFO L226 Difference]: Without dead ends: 52 [2022-02-21 03:04:05,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:04:05,237 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:05,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 17 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-21 03:04:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2022-02-21 03:04:05,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:05,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 43 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,248 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 43 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,248 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 43 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,250 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-02-21 03:04:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-02-21 03:04:05,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:05,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:05,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 42 states have internal predecessors, (53), 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 52 states. [2022-02-21 03:04:05,251 INFO L87 Difference]: Start difference. First operand has 43 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 42 states have internal predecessors, (53), 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 52 states. [2022-02-21 03:04:05,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,252 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-02-21 03:04:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-02-21 03:04:05,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:05,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:05,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:05,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-02-21 03:04:05,254 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 9 [2022-02-21 03:04:05,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:05,255 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-02-21 03:04:05,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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:04:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-21 03:04:05,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:04:05,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:05,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:05,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:04:05,256 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:04:05,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash 567656246, now seen corresponding path program 1 times [2022-02-21 03:04:05,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:05,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935626639] [2022-02-21 03:04:05,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:05,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:05,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {974#true} assume { :begin_inline_ULTIMATE.init } true; {974#true} is VALID [2022-02-21 03:04:05,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {974#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~short2#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; {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:04:05,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:04:05,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:04:05,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_#t~short2#1 := main_~x~0#1 - main_~y~0#1 > 2; {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:04:05,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume main_#t~short2#1; {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:04:05,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume !!main_#t~short2#1;havoc main_#t~short2#1; {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:04:05,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume !(main_~x~0#1 < main_~y~0#1); {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:04:05,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume 1 + main_~y~0#1 <= 2147483647; {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} is VALID [2022-02-21 03:04:05,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {976#(<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648))} assume !(1 + main_~y~0#1 >= -2147483648); {975#false} is VALID [2022-02-21 03:04:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:05,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:05,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935626639] [2022-02-21 03:04:05,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935626639] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:05,286 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:05,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:05,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584549334] [2022-02-21 03:04:05,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:05,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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) Word has length 10 [2022-02-21 03:04:05,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:05,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:04:05,294 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:04:05,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:05,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:05,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:05,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:05,295 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:04:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,327 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-02-21 03:04:05,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:05,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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) Word has length 10 [2022-02-21 03:04:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:04:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-21 03:04:05,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:04:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-21 03:04:05,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-02-21 03:04:05,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:05,345 INFO L225 Difference]: With dead ends: 43 [2022-02-21 03:04:05,345 INFO L226 Difference]: Without dead ends: 42 [2022-02-21 03:04:05,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:05,346 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:05,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 10 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-21 03:04:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-21 03:04:05,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:05,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,358 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,358 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,359 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-02-21 03:04:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-02-21 03:04:05,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:05,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:05,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 41 states have internal predecessors, (51), 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 42 states. [2022-02-21 03:04:05,361 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 41 states have internal predecessors, (51), 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 42 states. [2022-02-21 03:04:05,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,362 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-02-21 03:04:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-02-21 03:04:05,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:05,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:05,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:05,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2022-02-21 03:04:05,364 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2022-02-21 03:04:05,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:05,365 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2022-02-21 03:04:05,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:04:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-02-21 03:04:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-21 03:04:05,365 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:05,366 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:05,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:04:05,366 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:04:05,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:05,367 INFO L85 PathProgramCache]: Analyzing trace with hash 466887085, now seen corresponding path program 1 times [2022-02-21 03:04:05,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:05,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340740861] [2022-02-21 03:04:05,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:05,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:05,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {1156#true} assume { :begin_inline_ULTIMATE.init } true; {1156#true} is VALID [2022-02-21 03:04:05,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {1156#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~short2#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; {1156#true} is VALID [2022-02-21 03:04:05,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {1156#true} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {1156#true} is VALID [2022-02-21 03:04:05,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {1156#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1156#true} is VALID [2022-02-21 03:04:05,403 INFO L290 TraceCheckUtils]: 4: Hoare triple {1156#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_#t~short2#1 := main_~x~0#1 - main_~y~0#1 > 2; {1156#true} is VALID [2022-02-21 03:04:05,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {1156#true} assume !main_#t~short2#1; {1156#true} is VALID [2022-02-21 03:04:05,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {1156#true} assume main_~y~0#1 - main_~x~0#1 <= 2147483647; {1156#true} is VALID [2022-02-21 03:04:05,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {1156#true} assume main_~y~0#1 - main_~x~0#1 >= -2147483648;main_#t~short2#1 := main_~y~0#1 - main_~x~0#1 > 2; {1158#(or (<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (not |ULTIMATE.start_main_#t~short2#1|))} is VALID [2022-02-21 03:04:05,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {1158#(or (<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (not |ULTIMATE.start_main_#t~short2#1|))} assume !!main_#t~short2#1;havoc main_#t~short2#1; {1159#(<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:05,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {1159#(<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)} assume !(main_~x~0#1 < main_~y~0#1); {1157#false} is VALID [2022-02-21 03:04:05,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {1157#false} assume !(1 + main_~y~0#1 <= 2147483647); {1157#false} is VALID [2022-02-21 03:04:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:05,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:05,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340740861] [2022-02-21 03:04:05,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340740861] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:05,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:05,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:04:05,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741033417] [2022-02-21 03:04:05,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:05,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-02-21 03:04:05,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:05,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:05,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:04:05,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:05,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:04:05,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:04:05,415 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,476 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2022-02-21 03:04:05,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:04:05,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-02-21 03:04:05,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-02-21 03:04:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-02-21 03:04:05,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2022-02-21 03:04:05,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:05,508 INFO L225 Difference]: With dead ends: 76 [2022-02-21 03:04:05,508 INFO L226 Difference]: Without dead ends: 41 [2022-02-21 03:04:05,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:04:05,509 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:05,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 19 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:05,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-21 03:04:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-02-21 03:04:05,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:05,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 36 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,520 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 36 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,520 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 36 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,521 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-02-21 03:04:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-02-21 03:04:05,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:05,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:05,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 35 states have internal predecessors, (41), 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 41 states. [2022-02-21 03:04:05,522 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 35 states have internal predecessors, (41), 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 41 states. [2022-02-21 03:04:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,523 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-02-21 03:04:05,523 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-02-21 03:04:05,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:05,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:05,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:05,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-02-21 03:04:05,525 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 11 [2022-02-21 03:04:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:05,525 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-02-21 03:04:05,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-02-21 03:04:05,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-21 03:04:05,526 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:05,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:05,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:04:05,526 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:04:05,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:05,527 INFO L85 PathProgramCache]: Analyzing trace with hash 466886893, now seen corresponding path program 1 times [2022-02-21 03:04:05,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:05,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190007926] [2022-02-21 03:04:05,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:05,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:05,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {1367#true} assume { :begin_inline_ULTIMATE.init } true; {1367#true} is VALID [2022-02-21 03:04:05,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {1367#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~short2#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; {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:04:05,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:04:05,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:04:05,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_#t~short2#1 := main_~x~0#1 - main_~y~0#1 > 2; {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:04:05,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume !main_#t~short2#1; {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:04:05,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume main_~y~0#1 - main_~x~0#1 <= 2147483647; {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:04:05,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume main_~y~0#1 - main_~x~0#1 >= -2147483648;main_#t~short2#1 := main_~y~0#1 - main_~x~0#1 > 2; {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:04:05,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume !!main_#t~short2#1;havoc main_#t~short2#1; {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:04:05,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {1369#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume main_~x~0#1 < main_~y~0#1; {1370#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:05,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {1370#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !(1 + main_~x~0#1 <= 2147483647); {1368#false} is VALID [2022-02-21 03:04:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:05,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:05,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190007926] [2022-02-21 03:04:05,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190007926] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:05,558 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:05,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:04:05,558 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264465289] [2022-02-21 03:04:05,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:05,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-02-21 03:04:05,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:05,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:05,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:04:05,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:05,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:04:05,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:04:05,567 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,651 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-21 03:04:05,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:04:05,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-02-21 03:04:05,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-21 03:04:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-21 03:04:05,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-02-21 03:04:05,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:05,684 INFO L225 Difference]: With dead ends: 55 [2022-02-21 03:04:05,684 INFO L226 Difference]: Without dead ends: 54 [2022-02-21 03:04:05,684 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:04:05,685 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:05,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 18 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-21 03:04:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-02-21 03:04:05,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:05,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 45 states, 39 states have (on average 1.358974358974359) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,698 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 45 states, 39 states have (on average 1.358974358974359) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,698 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 45 states, 39 states have (on average 1.358974358974359) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,700 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-02-21 03:04:05,700 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-02-21 03:04:05,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:05,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:05,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 39 states have (on average 1.358974358974359) internal successors, (53), 44 states have internal predecessors, (53), 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 54 states. [2022-02-21 03:04:05,700 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.358974358974359) internal successors, (53), 44 states have internal predecessors, (53), 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 54 states. [2022-02-21 03:04:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,701 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-02-21 03:04:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-02-21 03:04:05,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:05,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:05,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:05,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.358974358974359) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-02-21 03:04:05,703 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 11 [2022-02-21 03:04:05,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:05,703 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-02-21 03:04:05,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,704 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-02-21 03:04:05,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-21 03:04:05,704 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:05,704 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:05,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 03:04:05,704 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:04:05,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:05,705 INFO L85 PathProgramCache]: Analyzing trace with hash 56807128, now seen corresponding path program 1 times [2022-02-21 03:04:05,705 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:05,705 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133005715] [2022-02-21 03:04:05,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:05,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:05,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {1593#true} assume { :begin_inline_ULTIMATE.init } true; {1593#true} is VALID [2022-02-21 03:04:05,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {1593#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~short2#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; {1593#true} is VALID [2022-02-21 03:04:05,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {1593#true} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {1593#true} is VALID [2022-02-21 03:04:05,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {1593#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1593#true} is VALID [2022-02-21 03:04:05,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {1593#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_#t~short2#1 := main_~x~0#1 - main_~y~0#1 > 2; {1595#(or (not |ULTIMATE.start_main_#t~short2#1|) (<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:04:05,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {1595#(or (not |ULTIMATE.start_main_#t~short2#1|) (<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} assume main_#t~short2#1; {1596#(<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:05,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {1596#(<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume !!main_#t~short2#1;havoc main_#t~short2#1; {1596#(<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:05,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {1596#(<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume !(main_~x~0#1 < main_~y~0#1); {1596#(<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:05,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {1596#(<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~y~0#1 <= 2147483647; {1596#(<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:05,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {1596#(<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1597#(<= (+ 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:05,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {1597#(<= (+ 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1597#(<= (+ 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:05,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {1597#(<= (+ 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume !(main_~x~0#1 - main_~y~0#1 >= -2147483648); {1594#false} is VALID [2022-02-21 03:04:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:05,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:05,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133005715] [2022-02-21 03:04:05,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133005715] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:05,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:05,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:04:05,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405808218] [2022-02-21 03:04:05,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:05,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-02-21 03:04:05,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:05,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:05,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:04:05,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:05,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:04:05,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:04:05,779 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,934 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-02-21 03:04:05,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:04:05,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-02-21 03:04:05,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-02-21 03:04:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-02-21 03:04:05,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-02-21 03:04:05,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:05,972 INFO L225 Difference]: With dead ends: 59 [2022-02-21 03:04:05,973 INFO L226 Difference]: Without dead ends: 25 [2022-02-21 03:04:05,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:05,974 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:05,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 14 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:04:05,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-21 03:04:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-21 03:04:05,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:05,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 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:04:05,984 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 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:04:05,985 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 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:04:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,985 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-21 03:04:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-21 03:04:05,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:05,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:05,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 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 25 states. [2022-02-21 03:04:05,986 INFO L87 Difference]: Start difference. First operand has 25 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 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 25 states. [2022-02-21 03:04:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,987 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-21 03:04:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-21 03:04:05,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:05,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:05,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:05,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 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:04:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-02-21 03:04:05,989 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 12 [2022-02-21 03:04:05,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:05,989 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-02-21 03:04:05,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-21 03:04:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-21 03:04:05,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:05,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:05,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 03:04:05,990 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:04:05,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1588591860, now seen corresponding path program 1 times [2022-02-21 03:04:05,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:05,991 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120861362] [2022-02-21 03:04:05,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:05,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:06,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {1745#true} assume { :begin_inline_ULTIMATE.init } true; {1745#true} is VALID [2022-02-21 03:04:06,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {1745#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~short2#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; {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:06,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:06,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:06,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_#t~short2#1 := main_~x~0#1 - main_~y~0#1 > 2; {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:06,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume !main_#t~short2#1; {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:06,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume main_~y~0#1 - main_~x~0#1 <= 2147483647; {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:06,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume main_~y~0#1 - main_~x~0#1 >= -2147483648;main_#t~short2#1 := main_~y~0#1 - main_~x~0#1 > 2; {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:06,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume !!main_#t~short2#1;havoc main_#t~short2#1; {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:06,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume main_~x~0#1 < main_~y~0#1; {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:06,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume 1 + main_~x~0#1 <= 2147483647; {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:06,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {1747#(<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume !(1 + main_~x~0#1 >= -2147483648); {1746#false} is VALID [2022-02-21 03:04:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:06,048 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:06,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120861362] [2022-02-21 03:04:06,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120861362] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:06,049 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:06,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:06,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077215620] [2022-02-21 03:04:06,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:06,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-02-21 03:04:06,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:06,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:06,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:06,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:06,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:06,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:06,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:06,058 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:06,096 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-21 03:04:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:06,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-02-21 03:04:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-02-21 03:04:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-02-21 03:04:06,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2022-02-21 03:04:06,112 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:04:06,113 INFO L225 Difference]: With dead ends: 25 [2022-02-21 03:04:06,113 INFO L226 Difference]: Without dead ends: 24 [2022-02-21 03:04:06,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:06,114 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:06,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 9 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:06,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-21 03:04:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-21 03:04:06,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:06,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 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:04:06,139 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 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:04:06,139 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 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:04:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:06,140 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-02-21 03:04:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-21 03:04:06,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:06,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:06,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 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 24 states. [2022-02-21 03:04:06,141 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 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 24 states. [2022-02-21 03:04:06,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:06,142 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-02-21 03:04:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-21 03:04:06,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:06,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:06,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:06,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 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:04:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-02-21 03:04:06,143 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 12 [2022-02-21 03:04:06,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:06,144 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-02-21 03:04:06,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-21 03:04:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 03:04:06,144 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:06,145 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:06,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 03:04:06,145 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:04:06,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:06,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2001707445, now seen corresponding path program 1 times [2022-02-21 03:04:06,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:06,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699672253] [2022-02-21 03:04:06,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:06,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:06,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {1853#true} assume { :begin_inline_ULTIMATE.init } true; {1853#true} is VALID [2022-02-21 03:04:06,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {1853#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~short2#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; {1853#true} is VALID [2022-02-21 03:04:06,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {1853#true} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {1853#true} is VALID [2022-02-21 03:04:06,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {1853#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1853#true} is VALID [2022-02-21 03:04:06,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {1853#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_#t~short2#1 := main_~x~0#1 - main_~y~0#1 > 2; {1853#true} is VALID [2022-02-21 03:04:06,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {1853#true} assume !main_#t~short2#1; {1853#true} is VALID [2022-02-21 03:04:06,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {1853#true} assume main_~y~0#1 - main_~x~0#1 <= 2147483647; {1853#true} is VALID [2022-02-21 03:04:06,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {1853#true} assume main_~y~0#1 - main_~x~0#1 >= -2147483648;main_#t~short2#1 := main_~y~0#1 - main_~x~0#1 > 2; {1855#(or (<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (not |ULTIMATE.start_main_#t~short2#1|))} is VALID [2022-02-21 03:04:06,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {1855#(or (<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (not |ULTIMATE.start_main_#t~short2#1|))} assume !!main_#t~short2#1;havoc main_#t~short2#1; {1856#(<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:06,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {1856#(<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)} assume main_~x~0#1 < main_~y~0#1; {1856#(<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:06,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {1856#(<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_~x~0#1 <= 2147483647; {1856#(<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:06,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {1856#(<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {1857#(<= (+ 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:06,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {1857#(<= (+ 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)} assume !(main_~x~0#1 - main_~y~0#1 <= 2147483647); {1854#false} is VALID [2022-02-21 03:04:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:06,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:06,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699672253] [2022-02-21 03:04:06,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699672253] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:06,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:06,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:04:06,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249350633] [2022-02-21 03:04:06,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:06,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-02-21 03:04:06,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:06,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:06,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:06,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:04:06,219 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:06,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:04:06,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:04:06,220 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:06,303 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-02-21 03:04:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:04:06,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-02-21 03:04:06,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-02-21 03:04:06,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-02-21 03:04:06,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-02-21 03:04:06,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:06,329 INFO L225 Difference]: With dead ends: 29 [2022-02-21 03:04:06,329 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:04:06,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:06,330 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:06,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 12 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:06,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:04:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:04:06,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:06,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:06,331 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:06,331 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:06,332 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:04:06,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:06,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:06,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:06,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-21 03:04:06,332 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-21 03:04:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:06,333 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:04:06,333 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:06,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:06,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:06,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:06,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:04:06,334 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-02-21 03:04:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:06,334 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:04:06,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:06,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:06,336 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-02-21 03:04:06,336 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-02-21 03:04:06,337 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-02-21 03:04:06,337 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-02-21 03:04:06,337 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-02-21 03:04:06,337 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-02-21 03:04:06,337 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-02-21 03:04:06,337 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-02-21 03:04:06,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-21 03:04:06,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:04:06,388 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2022-02-21 03:04:06,389 INFO L858 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2022-02-21 03:04:06,389 INFO L854 garLoopResultBuilder]: At program point L19-2(lines 18 24) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= |ULTIMATE.start_main_~x~0#1| (+ 2147483647 |ULTIMATE.start_main_~y~0#1|)) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~y~0#1| 2147483648)) (<= |ULTIMATE.start_main_~y~0#1| 2147483647) (<= |ULTIMATE.start_main_~y~0#1| (+ 2147483647 |ULTIMATE.start_main_~x~0#1|))) [2022-02-21 03:04:06,389 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-02-21 03:04:06,389 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:04:06,389 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2022-02-21 03:04:06,390 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:04:06,390 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:04:06,390 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:04:06,390 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-02-21 03:04:06,390 INFO L858 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-02-21 03:04:06,390 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2022-02-21 03:04:06,390 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:04:06,390 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:04:06,390 INFO L858 garLoopResultBuilder]: For program point L17(lines 17 25) no Hoare annotation was computed. [2022-02-21 03:04:06,391 INFO L858 garLoopResultBuilder]: For program point L17-1(lines 17 25) no Hoare annotation was computed. [2022-02-21 03:04:06,391 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2022-02-21 03:04:06,391 INFO L854 garLoopResultBuilder]: At program point L26(lines 13 27) the Hoare annotation is: (or (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= |ULTIMATE.start_main_~x~0#1| (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))) [2022-02-21 03:04:06,391 INFO L858 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-02-21 03:04:06,391 INFO L858 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-02-21 03:04:06,391 INFO L858 garLoopResultBuilder]: For program point L18-1(line 18) no Hoare annotation was computed. [2022-02-21 03:04:06,391 INFO L858 garLoopResultBuilder]: For program point L18-2(line 18) no Hoare annotation was computed. [2022-02-21 03:04:06,391 INFO L858 garLoopResultBuilder]: For program point L18-4(line 18) no Hoare annotation was computed. [2022-02-21 03:04:06,392 INFO L858 garLoopResultBuilder]: For program point L18-5(line 18) no Hoare annotation was computed. [2022-02-21 03:04:06,392 INFO L858 garLoopResultBuilder]: For program point L18-6(lines 18 24) no Hoare annotation was computed. [2022-02-21 03:04:06,392 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-02-21 03:04:06,394 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:06,395 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:04:06,397 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:04:06,398 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:04:06,398 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-21 03:04:06,398 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-21 03:04:06,398 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2022-02-21 03:04:06,398 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW has no Hoare annotation [2022-02-21 03:04:06,398 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-21 03:04:06,398 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2022-02-21 03:04:06,398 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-21 03:04:06,398 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-21 03:04:06,398 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:04:06,399 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-21 03:04:06,399 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-21 03:04:06,399 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:04:06,399 WARN L170 areAnnotationChecker]: L18-6 has no Hoare annotation [2022-02-21 03:04:06,399 WARN L170 areAnnotationChecker]: L18-6 has no Hoare annotation [2022-02-21 03:04:06,399 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2022-02-21 03:04:06,399 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2022-02-21 03:04:06,399 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:04:06,399 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:04:06,399 WARN L170 areAnnotationChecker]: L18-5 has no Hoare annotation [2022-02-21 03:04:06,400 WARN L170 areAnnotationChecker]: L18-5 has no Hoare annotation [2022-02-21 03:04:06,400 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:04:06,400 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:04:06,400 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:04:06,400 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:04:06,400 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:04:06,400 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:04:06,400 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:04:06,400 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:04:06,400 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:04:06,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:04:06 BoogieIcfgContainer [2022-02-21 03:04:06,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:04:06,408 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:04:06,408 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:04:06,408 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:04:06,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:03" (3/4) ... [2022-02-21 03:04:06,410 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:04:06,416 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-21 03:04:06,416 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 03:04:06,416 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:04:06,435 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:04:06,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:04:06,436 INFO L158 Benchmark]: Toolchain (without parser) took 3230.36ms. Allocated memory was 115.3MB in the beginning and 142.6MB in the end (delta: 27.3MB). Free memory was 76.7MB in the beginning and 64.7MB in the end (delta: 12.0MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2022-02-21 03:04:06,436 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 115.3MB. Free memory is still 93.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:06,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.17ms. Allocated memory is still 115.3MB. Free memory was 76.6MB in the beginning and 91.8MB in the end (delta: -15.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:04:06,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.36ms. Allocated memory is still 115.3MB. Free memory was 91.8MB in the beginning and 90.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:06,437 INFO L158 Benchmark]: Boogie Preprocessor took 28.60ms. Allocated memory is still 115.3MB. Free memory was 90.3MB in the beginning and 89.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:06,437 INFO L158 Benchmark]: RCFGBuilder took 362.58ms. Allocated memory is still 115.3MB. Free memory was 89.3MB in the beginning and 77.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:04:06,437 INFO L158 Benchmark]: TraceAbstraction took 2584.64ms. Allocated memory was 115.3MB in the beginning and 142.6MB in the end (delta: 27.3MB). Free memory was 77.2MB in the beginning and 66.8MB in the end (delta: 10.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-02-21 03:04:06,437 INFO L158 Benchmark]: Witness Printer took 27.52ms. Allocated memory is still 142.6MB. Free memory was 66.8MB in the beginning and 64.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:06,438 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.19ms. Allocated memory is still 115.3MB. Free memory is still 93.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.17ms. Allocated memory is still 115.3MB. Free memory was 76.6MB in the beginning and 91.8MB in the end (delta: -15.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.36ms. Allocated memory is still 115.3MB. Free memory was 91.8MB in the beginning and 90.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.60ms. Allocated memory is still 115.3MB. Free memory was 90.3MB in the beginning and 89.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 362.58ms. Allocated memory is still 115.3MB. Free memory was 89.3MB in the beginning and 77.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2584.64ms. Allocated memory was 115.3MB in the beginning and 142.6MB in the end (delta: 27.3MB). Free memory was 77.2MB in the beginning and 66.8MB in the end (delta: 10.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 27.52ms. Allocated memory is still 142.6MB. Free memory was 66.8MB in the beginning and 64.7MB in the end (delta: 2.1MB). 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 - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 158 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 365 IncrementalHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 97 mSDtfsCounter, 365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=3, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 8 NumberOfFragments, 36 HoareAnnotationTreeSize, 2 FomulaSimplifications, 39 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 44 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 3/3 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((x <= 2147483647 && x <= 2147483647 + y) && 0 <= x + 2147483648) && 0 <= y + 2147483648) && y <= 2147483647) && y <= 2147483647 + x - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: x <= 2147483647 || x <= 2147483647 + y RESULT: Ultimate proved your program to be correct! [2022-02-21 03:04:06,476 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 Result: TRUE