./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/NonTermination4.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 737f9e8de77d32d8f03e01ab5f98ec0cb28ec6478e68b10a65bdf5d745ac7455 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:53:18,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:53:18,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:53:18,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:53:18,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:53:18,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:53:18,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:53:18,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:53:18,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:53:18,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:53:18,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:53:18,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:53:18,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:53:18,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:53:18,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:53:18,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:53:18,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:53:18,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:53:18,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:53:18,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:53:18,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:53:18,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:53:18,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:53:18,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:53:18,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:53:18,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:53:18,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:53:18,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:53:18,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:53:18,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:53:18,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:53:18,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:53:18,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:53:18,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:53:18,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:53:18,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:53:18,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:53:18,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:53:18,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:53:18,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:53:18,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:53:18,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-02-15 13:53:19,017 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:53:19,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:53:19,018 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:53:19,018 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:53:19,018 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:53:19,019 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:53:19,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:53:19,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:53:19,019 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:53:19,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:53:19,020 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:53:19,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:53:19,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:53:19,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 13:53:19,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:53:19,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 13:53:19,021 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 13:53:19,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 13:53:19,021 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:53:19,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 13:53:19,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:53:19,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:53:19,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:53:19,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:53:19,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:53:19,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:53:19,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 13:53:19,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:53:19,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:53:19,022 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:53:19,023 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 13:53:19,027 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:53:19,027 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:53:19,027 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:53:19,028 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 737f9e8de77d32d8f03e01ab5f98ec0cb28ec6478e68b10a65bdf5d745ac7455 [2023-02-15 13:53:19,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:53:19,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:53:19,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:53:19,196 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:53:19,196 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:53:19,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination4.c [2023-02-15 13:53:20,209 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:53:20,333 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:53:20,333 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination4.c [2023-02-15 13:53:20,338 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a889e183/ebc1878cf4b445feafb83717cb5315c3/FLAGb99044fc5 [2023-02-15 13:53:20,349 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a889e183/ebc1878cf4b445feafb83717cb5315c3 [2023-02-15 13:53:20,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:53:20,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:53:20,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:53:20,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:53:20,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:53:20,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:53:20" (1/1) ... [2023-02-15 13:53:20,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b3d14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:20, skipping insertion in model container [2023-02-15 13:53:20,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:53:20" (1/1) ... [2023-02-15 13:53:20,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:53:20,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:53:20,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:53:20,472 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:53:20,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:53:20,488 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:53:20,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:20 WrapperNode [2023-02-15 13:53:20,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:53:20,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:53:20,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:53:20,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:53:20,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:20" (1/1) ... [2023-02-15 13:53:20,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:20" (1/1) ... [2023-02-15 13:53:20,506 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2023-02-15 13:53:20,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:53:20,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:53:20,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:53:20,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:53:20,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:20" (1/1) ... [2023-02-15 13:53:20,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:20" (1/1) ... [2023-02-15 13:53:20,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:20" (1/1) ... [2023-02-15 13:53:20,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:20" (1/1) ... [2023-02-15 13:53:20,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:20" (1/1) ... [2023-02-15 13:53:20,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:20" (1/1) ... [2023-02-15 13:53:20,516 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:20" (1/1) ... [2023-02-15 13:53:20,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:20" (1/1) ... [2023-02-15 13:53:20,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:53:20,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:53:20,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:53:20,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:53:20,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:20" (1/1) ... [2023-02-15 13:53:20,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:53:20,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:53:20,545 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) [2023-02-15 13:53:20,547 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 [2023-02-15 13:53:20,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:53:20,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:53:20,622 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:53:20,624 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:53:20,677 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:53:20,680 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:53:20,681 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 13:53:20,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:53:20 BoogieIcfgContainer [2023-02-15 13:53:20,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:53:20,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:53:20,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:53:20,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:53:20,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:53:20" (1/3) ... [2023-02-15 13:53:20,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e168f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:53:20, skipping insertion in model container [2023-02-15 13:53:20,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:53:20" (2/3) ... [2023-02-15 13:53:20,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e168f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:53:20, skipping insertion in model container [2023-02-15 13:53:20,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:53:20" (3/3) ... [2023-02-15 13:53:20,688 INFO L112 eAbstractionObserver]: Analyzing ICFG NonTermination4.c [2023-02-15 13:53:20,700 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:53:20,700 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-02-15 13:53:20,737 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:53:20,742 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@50784ee1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:53:20,743 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-02-15 13:53:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.6) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:53:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 13:53:20,750 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:53:20,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 13:53:20,751 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 13:53:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:53:20,757 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2023-02-15 13:53:20,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:53:20,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443491262] [2023-02-15 13:53:20,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:53:20,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:53:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:53:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:20,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:53:20,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443491262] [2023-02-15 13:53:20,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443491262] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:53:20,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:53:20,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:53:20,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72911922] [2023-02-15 13:53:20,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:53:20,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:53:20,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:53:20,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:53:20,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:53:20,950 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.6) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:53:20,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:53:20,994 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2023-02-15 13:53:20,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:53:20,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-15 13:53:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:53:21,001 INFO L225 Difference]: With dead ends: 15 [2023-02-15 13:53:21,002 INFO L226 Difference]: Without dead ends: 10 [2023-02-15 13:53:21,003 INFO L412 NwaCegarLoop]: 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 [2023-02-15 13:53:21,019 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:53:21,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 7 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:53:21,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-02-15 13:53:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-02-15 13:53:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:53:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2023-02-15 13:53:21,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 4 [2023-02-15 13:53:21,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:53:21,064 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2023-02-15 13:53:21,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:53:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2023-02-15 13:53:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 13:53:21,065 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:53:21,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 13:53:21,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:53:21,065 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 13:53:21,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:53:21,066 INFO L85 PathProgramCache]: Analyzing trace with hash 28699721, now seen corresponding path program 1 times [2023-02-15 13:53:21,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:53:21,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046663046] [2023-02-15 13:53:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:53:21,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:53:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:53:21,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:21,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:53:21,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046663046] [2023-02-15 13:53:21,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046663046] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:53:21,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:53:21,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:53:21,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376865085] [2023-02-15 13:53:21,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:53:21,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:53:21,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:53:21,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:53:21,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:53:21,088 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:53:21,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:53:21,105 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-02-15 13:53:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:53:21,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 13:53:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:53:21,106 INFO L225 Difference]: With dead ends: 14 [2023-02-15 13:53:21,106 INFO L226 Difference]: Without dead ends: 13 [2023-02-15 13:53:21,107 INFO L412 NwaCegarLoop]: 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 [2023-02-15 13:53:21,107 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:53:21,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:53:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-02-15 13:53:21,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-02-15 13:53:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.3) internal successors, (13), 12 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) [2023-02-15 13:53:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2023-02-15 13:53:21,114 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2023-02-15 13:53:21,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:53:21,114 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2023-02-15 13:53:21,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:53:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2023-02-15 13:53:21,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:53:21,115 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:53:21,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:53:21,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:53:21,116 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 13:53:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:53:21,118 INFO L85 PathProgramCache]: Analyzing trace with hash 889691398, now seen corresponding path program 1 times [2023-02-15 13:53:21,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:53:21,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168069697] [2023-02-15 13:53:21,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:53:21,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:53:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:53:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:21,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:53:21,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168069697] [2023-02-15 13:53:21,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168069697] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:53:21,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:53:21,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:53:21,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118579088] [2023-02-15 13:53:21,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:53:21,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:53:21,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:53:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:53:21,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:53:21,154 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:53:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:53:21,159 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2023-02-15 13:53:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:53:21,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 13:53:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:53:21,160 INFO L225 Difference]: With dead ends: 13 [2023-02-15 13:53:21,161 INFO L226 Difference]: Without dead ends: 12 [2023-02-15 13:53:21,161 INFO L412 NwaCegarLoop]: 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 [2023-02-15 13:53:21,162 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:53:21,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 7 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:53:21,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-02-15 13:53:21,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-02-15 13:53:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.2) internal successors, (12), 11 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) [2023-02-15 13:53:21,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2023-02-15 13:53:21,165 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 6 [2023-02-15 13:53:21,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:53:21,165 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2023-02-15 13:53:21,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:53:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2023-02-15 13:53:21,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 13:53:21,166 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:53:21,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:53:21,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:53:21,166 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 13:53:21,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:53:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1810629611, now seen corresponding path program 1 times [2023-02-15 13:53:21,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:53:21,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675526181] [2023-02-15 13:53:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:53:21,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:53:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:53:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:21,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:53:21,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675526181] [2023-02-15 13:53:21,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675526181] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:53:21,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:53:21,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:53:21,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487986612] [2023-02-15 13:53:21,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:53:21,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:53:21,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:53:21,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:53:21,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:53:21,191 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-02-15 13:53:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:53:21,208 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2023-02-15 13:53:21,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:53:21,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-02-15 13:53:21,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:53:21,209 INFO L225 Difference]: With dead ends: 15 [2023-02-15 13:53:21,209 INFO L226 Difference]: Without dead ends: 14 [2023-02-15 13:53:21,210 INFO L412 NwaCegarLoop]: 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 [2023-02-15 13:53:21,211 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:53:21,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:53:21,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-02-15 13:53:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-02-15 13:53:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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) [2023-02-15 13:53:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2023-02-15 13:53:21,220 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2023-02-15 13:53:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:53:21,220 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2023-02-15 13:53:21,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-02-15 13:53:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2023-02-15 13:53:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 13:53:21,221 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:53:21,221 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 13:53:21,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:53:21,222 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 13:53:21,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:53:21,222 INFO L85 PathProgramCache]: Analyzing trace with hash -27488384, now seen corresponding path program 1 times [2023-02-15 13:53:21,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:53:21,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310475668] [2023-02-15 13:53:21,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:53:21,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:53:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:53:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:21,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:53:21,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310475668] [2023-02-15 13:53:21,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310475668] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:53:21,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658712719] [2023-02-15 13:53:21,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:53:21,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:53:21,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:53:21,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:53:21,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 13:53:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:53:21,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:53:21,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:53:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:21,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:53:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:21,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658712719] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:53:21,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:53:21,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-15 13:53:21,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085920640] [2023-02-15 13:53:21,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:53:21,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:53:21,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:53:21,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:53:21,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:53:21,387 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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) [2023-02-15 13:53:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:53:21,429 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2023-02-15 13:53:21,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:53:21,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 [2023-02-15 13:53:21,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:53:21,431 INFO L225 Difference]: With dead ends: 30 [2023-02-15 13:53:21,431 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 13:53:21,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:53:21,437 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:53:21,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 19 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:53:21,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 13:53:21,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-02-15 13:53:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 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) [2023-02-15 13:53:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-02-15 13:53:21,444 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2023-02-15 13:53:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:53:21,445 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-02-15 13:53:21,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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) [2023-02-15 13:53:21,445 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-02-15 13:53:21,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:53:21,445 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:53:21,446 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1] [2023-02-15 13:53:21,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 13:53:21,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:53:21,646 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 13:53:21,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:53:21,647 INFO L85 PathProgramCache]: Analyzing trace with hash -646531742, now seen corresponding path program 1 times [2023-02-15 13:53:21,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:53:21,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034760949] [2023-02-15 13:53:21,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:53:21,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:53:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:53:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:21,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:53:21,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034760949] [2023-02-15 13:53:21,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034760949] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:53:21,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208837904] [2023-02-15 13:53:21,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:53:21,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:53:21,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:53:21,684 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:53:21,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 13:53:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:53:21,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:53:21,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:53:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:21,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:53:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:21,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208837904] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:53:21,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:53:21,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-15 13:53:21,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061606090] [2023-02-15 13:53:21,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:53:21,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:53:21,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:53:21,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:53:21,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:53:21,765 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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) [2023-02-15 13:53:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:53:21,786 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2023-02-15 13:53:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:53:21,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 [2023-02-15 13:53:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:53:21,787 INFO L225 Difference]: With dead ends: 30 [2023-02-15 13:53:21,787 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 13:53:21,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:53:21,788 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 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 [2023-02-15 13:53:21,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:53:21,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 13:53:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-15 13:53:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 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) [2023-02-15 13:53:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2023-02-15 13:53:21,792 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 12 [2023-02-15 13:53:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:53:21,793 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2023-02-15 13:53:21,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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) [2023-02-15 13:53:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2023-02-15 13:53:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:53:21,793 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:53:21,794 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1] [2023-02-15 13:53:21,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 13:53:21,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 13:53:21,999 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 13:53:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:53:21,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1232254711, now seen corresponding path program 2 times [2023-02-15 13:53:21,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:53:21,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381996995] [2023-02-15 13:53:22,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:53:22,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:53:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:53:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:22,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:53:22,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381996995] [2023-02-15 13:53:22,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381996995] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:53:22,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396155611] [2023-02-15 13:53:22,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:53:22,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:53:22,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:53:22,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:53:22,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 13:53:22,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:53:22,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:53:22,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 13:53:22,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:53:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:22,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:53:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:22,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396155611] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:53:22,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:53:22,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-02-15 13:53:22,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616905780] [2023-02-15 13:53:22,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:53:22,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:53:22,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:53:22,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:53:22,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:53:22,223 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 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) [2023-02-15 13:53:22,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:53:22,256 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2023-02-15 13:53:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:53:22,272 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 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 25 [2023-02-15 13:53:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:53:22,273 INFO L225 Difference]: With dead ends: 63 [2023-02-15 13:53:22,273 INFO L226 Difference]: Without dead ends: 62 [2023-02-15 13:53:22,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:53:22,274 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:53:22,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:53:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-15 13:53:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2023-02-15 13:53:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 56 states have internal predecessors, (62), 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) [2023-02-15 13:53:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2023-02-15 13:53:22,280 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 25 [2023-02-15 13:53:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:53:22,280 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2023-02-15 13:53:22,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 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) [2023-02-15 13:53:22,280 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2023-02-15 13:53:22,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 13:53:22,281 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:53:22,281 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1] [2023-02-15 13:53:22,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 13:53:22,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:53:22,486 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 13:53:22,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:53:22,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1214197931, now seen corresponding path program 2 times [2023-02-15 13:53:22,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:53:22,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875114794] [2023-02-15 13:53:22,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:53:22,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:53:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:53:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:22,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:53:22,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875114794] [2023-02-15 13:53:22,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875114794] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:53:22,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236066851] [2023-02-15 13:53:22,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:53:22,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:53:22,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:53:22,564 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:53:22,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 13:53:22,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:53:22,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:53:22,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 13:53:22,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:53:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:22,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:53:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:22,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236066851] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:53:22,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:53:22,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-02-15 13:53:22,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353288620] [2023-02-15 13:53:22,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:53:22,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:53:22,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:53:22,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:53:22,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:53:22,716 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 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) [2023-02-15 13:53:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:53:22,757 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2023-02-15 13:53:22,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:53:22,758 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 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) Word has length 27 [2023-02-15 13:53:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:53:22,761 INFO L225 Difference]: With dead ends: 60 [2023-02-15 13:53:22,761 INFO L226 Difference]: Without dead ends: 59 [2023-02-15 13:53:22,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:53:22,764 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:53:22,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:53:22,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-15 13:53:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-02-15 13:53:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 58 states have internal predecessors, (59), 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) [2023-02-15 13:53:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2023-02-15 13:53:22,781 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 27 [2023-02-15 13:53:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:53:22,781 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2023-02-15 13:53:22,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 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) [2023-02-15 13:53:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2023-02-15 13:53:22,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 13:53:22,784 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:53:22,784 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1] [2023-02-15 13:53:22,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:53:22,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:53:22,990 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 13:53:22,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:53:22,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1715294249, now seen corresponding path program 3 times [2023-02-15 13:53:22,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:53:22,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917906096] [2023-02-15 13:53:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:53:22,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:53:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:53:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:23,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:53:23,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917906096] [2023-02-15 13:53:23,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917906096] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:53:23,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733518691] [2023-02-15 13:53:23,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 13:53:23,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:53:23,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:53:23,180 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:53:23,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 13:53:23,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-15 13:53:23,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:53:23,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 13:53:23,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:53:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:23,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:53:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:23,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733518691] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:53:23,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:53:23,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2023-02-15 13:53:23,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447576205] [2023-02-15 13:53:23,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:53:23,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 13:53:23,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:53:23,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 13:53:23,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2023-02-15 13:53:23,495 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 24 states, 23 states have (on average 4.739130434782608) internal successors, (109), 24 states have internal predecessors, (109), 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) [2023-02-15 13:53:23,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:53:23,562 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2023-02-15 13:53:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 13:53:23,563 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.739130434782608) internal successors, (109), 24 states have internal predecessors, (109), 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 55 [2023-02-15 13:53:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:53:23,566 INFO L225 Difference]: With dead ends: 129 [2023-02-15 13:53:23,566 INFO L226 Difference]: Without dead ends: 128 [2023-02-15 13:53:23,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2023-02-15 13:53:23,568 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:53:23,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 66 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:53:23,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-15 13:53:23,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2023-02-15 13:53:23,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.1130434782608696) internal successors, (128), 116 states have internal predecessors, (128), 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) [2023-02-15 13:53:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2023-02-15 13:53:23,586 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 55 [2023-02-15 13:53:23,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:53:23,588 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2023-02-15 13:53:23,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.739130434782608) internal successors, (109), 24 states have internal predecessors, (109), 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) [2023-02-15 13:53:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2023-02-15 13:53:23,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 13:53:23,589 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:53:23,589 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 1, 1, 1] [2023-02-15 13:53:23,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 13:53:23,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:53:23,796 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 13:53:23,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:53:23,796 INFO L85 PathProgramCache]: Analyzing trace with hash -869666869, now seen corresponding path program 3 times [2023-02-15 13:53:23,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:53:23,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063091059] [2023-02-15 13:53:23,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:53:23,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:53:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:53:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:23,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:53:23,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063091059] [2023-02-15 13:53:23,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063091059] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:53:23,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200037927] [2023-02-15 13:53:23,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 13:53:23,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:53:23,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:53:23,953 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:53:23,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 13:53:23,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-15 13:53:23,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:53:23,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 13:53:23,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:53:24,049 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:24,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:53:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:53:24,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200037927] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:53:24,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:53:24,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2023-02-15 13:53:24,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495119047] [2023-02-15 13:53:24,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:53:24,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 13:53:24,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:53:24,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 13:53:24,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2023-02-15 13:53:24,229 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand has 24 states, 23 states have (on average 4.913043478260869) internal successors, (113), 24 states have internal predecessors, (113), 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) [2023-02-15 13:53:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:53:24,278 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2023-02-15 13:53:24,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 13:53:24,278 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.913043478260869) internal successors, (113), 24 states have internal predecessors, (113), 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 57 [2023-02-15 13:53:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:53:24,279 INFO L225 Difference]: With dead ends: 118 [2023-02-15 13:53:24,279 INFO L226 Difference]: Without dead ends: 117 [2023-02-15 13:53:24,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2023-02-15 13:53:24,280 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:53:24,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:53:24,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-15 13:53:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-02-15 13:53:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.0347826086956522) internal successors, (119), 116 states have internal predecessors, (119), 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) [2023-02-15 13:53:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2023-02-15 13:53:24,285 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 57 [2023-02-15 13:53:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:53:24,286 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2023-02-15 13:53:24,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.913043478260869) internal successors, (113), 24 states have internal predecessors, (113), 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) [2023-02-15 13:53:24,286 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2023-02-15 13:53:24,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-02-15 13:53:24,287 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:53:24,287 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 19, 1, 1, 1] [2023-02-15 13:53:24,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:53:24,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:53:24,494 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 13:53:24,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:53:24,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1215695874, now seen corresponding path program 4 times [2023-02-15 13:53:24,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:53:24,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873278160] [2023-02-15 13:53:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:53:24,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:53:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:53:24,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 13:53:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:53:24,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 13:53:24,568 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 13:53:24,569 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2023-02-15 13:53:24,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2023-02-15 13:53:24,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2023-02-15 13:53:24,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2023-02-15 13:53:24,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 13:53:24,573 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2023-02-15 13:53:24,576 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 13:53:24,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:53:24 BoogieIcfgContainer [2023-02-15 13:53:24,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 13:53:24,602 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 13:53:24,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 13:53:24,602 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 13:53:24,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:53:20" (3/4) ... [2023-02-15 13:53:24,604 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 13:53:24,637 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 13:53:24,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 13:53:24,638 INFO L158 Benchmark]: Toolchain (without parser) took 4285.00ms. Allocated memory was 115.3MB in the beginning and 140.5MB in the end (delta: 25.2MB). Free memory was 69.1MB in the beginning and 51.5MB in the end (delta: 17.6MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2023-02-15 13:53:24,638 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:53:24,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 133.57ms. Allocated memory is still 115.3MB. Free memory was 68.7MB in the beginning and 59.8MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 13:53:24,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.67ms. Allocated memory is still 115.3MB. Free memory was 59.8MB in the beginning and 58.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:53:24,639 INFO L158 Benchmark]: Boogie Preprocessor took 10.51ms. Allocated memory is still 115.3MB. Free memory was 58.6MB in the beginning and 57.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:53:24,639 INFO L158 Benchmark]: RCFGBuilder took 164.66ms. Allocated memory is still 115.3MB. Free memory was 57.4MB in the beginning and 49.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 13:53:24,639 INFO L158 Benchmark]: TraceAbstraction took 3918.16ms. Allocated memory was 115.3MB in the beginning and 140.5MB in the end (delta: 25.2MB). Free memory was 48.1MB in the beginning and 53.6MB in the end (delta: -5.4MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2023-02-15 13:53:24,640 INFO L158 Benchmark]: Witness Printer took 35.64ms. Allocated memory is still 140.5MB. Free memory was 53.6MB in the beginning and 51.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:53:24,641 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 133.57ms. Allocated memory is still 115.3MB. Free memory was 68.7MB in the beginning and 59.8MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.67ms. Allocated memory is still 115.3MB. Free memory was 59.8MB in the beginning and 58.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 10.51ms. Allocated memory is still 115.3MB. Free memory was 58.6MB in the beginning and 57.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 164.66ms. Allocated memory is still 115.3MB. Free memory was 57.4MB in the beginning and 49.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3918.16ms. Allocated memory was 115.3MB in the beginning and 140.5MB in the end (delta: 25.2MB). Free memory was 48.1MB in the beginning and 53.6MB in the end (delta: -5.4MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Witness Printer took 35.64ms. Allocated memory is still 140.5MB. Free memory was 53.6MB in the beginning and 51.5MB 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 - CounterExampleResult [Line: 20]: integer overflow possible integer overflow possible We found a FailurePath: [L15] int x, y; [L16] x = 1 [L17] y = 1 VAL [x=1, y=1] [L18] COND TRUE x >= 0 VAL [x=1, y=1] [L19] EXPR 2*x [L19] x = 2*x VAL [x=2, y=1] [L20] EXPR 3*y [L20] y = 3*y VAL [x=2, y=3] [L18] COND TRUE x >= 0 VAL [x=2, y=3] [L19] EXPR 2*x [L19] x = 2*x VAL [x=4, y=3] [L20] EXPR 3*y [L20] y = 3*y VAL [x=4, y=9] [L18] COND TRUE x >= 0 VAL [x=4, y=9] [L19] EXPR 2*x [L19] x = 2*x VAL [x=8, y=9] [L20] EXPR 3*y [L20] y = 3*y VAL [x=8, y=27] [L18] COND TRUE x >= 0 VAL [x=8, y=27] [L19] EXPR 2*x [L19] x = 2*x VAL [x=16, y=27] [L20] EXPR 3*y [L20] y = 3*y VAL [x=16, y=81] [L18] COND TRUE x >= 0 VAL [x=16, y=81] [L19] EXPR 2*x [L19] x = 2*x VAL [x=32, y=81] [L20] EXPR 3*y [L20] y = 3*y VAL [x=32, y=243] [L18] COND TRUE x >= 0 VAL [x=32, y=243] [L19] EXPR 2*x [L19] x = 2*x VAL [x=64, y=243] [L20] EXPR 3*y [L20] y = 3*y VAL [x=64, y=729] [L18] COND TRUE x >= 0 VAL [x=64, y=729] [L19] EXPR 2*x [L19] x = 2*x VAL [x=128, y=729] [L20] EXPR 3*y [L20] y = 3*y VAL [x=128, y=2187] [L18] COND TRUE x >= 0 VAL [x=128, y=2187] [L19] EXPR 2*x [L19] x = 2*x VAL [x=256, y=2187] [L20] EXPR 3*y [L20] y = 3*y VAL [x=256, y=6561] [L18] COND TRUE x >= 0 VAL [x=256, y=6561] [L19] EXPR 2*x [L19] x = 2*x VAL [x=512, y=6561] [L20] EXPR 3*y [L20] y = 3*y VAL [x=512, y=19683] [L18] COND TRUE x >= 0 VAL [x=512, y=19683] [L19] EXPR 2*x [L19] x = 2*x VAL [x=1024, y=19683] [L20] EXPR 3*y [L20] y = 3*y VAL [x=1024, y=59049] [L18] COND TRUE x >= 0 VAL [x=1024, y=59049] [L19] EXPR 2*x [L19] x = 2*x VAL [x=2048, y=59049] [L20] EXPR 3*y [L20] y = 3*y VAL [x=2048, y=177147] [L18] COND TRUE x >= 0 VAL [x=2048, y=177147] [L19] EXPR 2*x [L19] x = 2*x VAL [x=4096, y=177147] [L20] EXPR 3*y [L20] y = 3*y VAL [x=4096, y=531441] [L18] COND TRUE x >= 0 VAL [x=4096, y=531441] [L19] EXPR 2*x [L19] x = 2*x VAL [x=8192, y=531441] [L20] EXPR 3*y [L20] y = 3*y VAL [x=8192, y=1594323] [L18] COND TRUE x >= 0 VAL [x=8192, y=1594323] [L19] EXPR 2*x [L19] x = 2*x VAL [x=16384, y=1594323] [L20] EXPR 3*y [L20] y = 3*y VAL [x=16384, y=4782969] [L18] COND TRUE x >= 0 VAL [x=16384, y=4782969] [L19] EXPR 2*x [L19] x = 2*x VAL [x=32768, y=4782969] [L20] EXPR 3*y [L20] y = 3*y VAL [x=32768, y=14348907] [L18] COND TRUE x >= 0 VAL [x=32768, y=14348907] [L19] EXPR 2*x [L19] x = 2*x VAL [x=65536, y=14348907] [L20] EXPR 3*y [L20] y = 3*y VAL [x=65536, y=43046721] [L18] COND TRUE x >= 0 VAL [x=65536, y=43046721] [L19] EXPR 2*x [L19] x = 2*x VAL [x=131072, y=43046721] [L20] EXPR 3*y [L20] y = 3*y VAL [x=131072, y=129140163] [L18] COND TRUE x >= 0 VAL [x=131072, y=129140163] [L19] EXPR 2*x [L19] x = 2*x VAL [x=262144, y=129140163] [L20] EXPR 3*y [L20] y = 3*y VAL [x=262144, y=387420489] [L18] COND TRUE x >= 0 VAL [x=262144, y=387420489] [L19] EXPR 2*x [L19] x = 2*x VAL [x=524288, y=387420489] [L20] EXPR 3*y [L20] y = 3*y VAL [x=524288, y=1162261467] [L18] COND TRUE x >= 0 VAL [x=524288, y=1162261467] [L19] EXPR 2*x [L19] x = 2*x VAL [x=1048576, y=1162261467] [L20] 3*y VAL [x=1048576, y=1162261467] - UnprovableResult [Line: 19]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 11, TraceHistogramMax: 20, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 235 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 226 IncrementalHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 65 mSDtfsCounter, 226 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=9, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 1978 SizeOfPredicates, 0 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 0/1890 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-15 13:53:24,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)